Corpus ID: 220495817

# Benchmarking 16-element quantum search algorithms on IBM quantum processors

@article{Gwinner2020Benchmarking1Q,
title={Benchmarking 16-element quantum search algorithms on IBM quantum processors},
author={Jan Gwinner and Marcin Brianski and W. Burkot and Lukasz Czerwi'nski and Vladyslav Hlembotskyi},
journal={ArXiv},
year={2020},
volume={abs/2007.06539}
}
We present experimental results on running 4-qubit unstructured search on IBM quantum processors. Our best attempt attained probability of success around 24.5%. We try several algorithms and use the most recent developments in quantum search to reduce the number of entangling gates that are currently considered the main source of errors in quantum computations. Comparing theoretical expectations of an algorithm performance with the actual data, we explore the hardware limits, showing sharp… Expand
3 Citations

#### Figures, Tables, and Topics from this paper

Efficient unstructured search implementation on current ion-trap quantum processors
• Computer Science, Physics
• 2020
Experimental results on running unstructured search in spaces defined by 4, 5 and 6 qubits on ion-trapped quantum processor show fewer expected number of oracle calls required to find a marked element than any classical approach. Expand
Modelling of Grover’s quantum search algorithms: implementations of Simple quantum simulators on classical computers
• Computer Science
• 2020
Models of Grover’s search algorithm is reviewed to build the foundation for the other algorithms. Thereafter, some preliminary modifications of the original algorithms by others are stated, thatExpand
Introducing Structure to Expedite Quantum Search
• Computer Science, Physics
• ArXiv
• 2020
A novel quantum algorithm for solving the unstructured search problem with one marked element and the technique which exploits the oracle structure and allows a significant reduction in the number of elementary gates required to find the solution is described. Expand

#### References

SHOWING 1-9 OF 9 REFERENCES
Implementing Grover’s Algorithm on the IBM Quantum Computers
• Computer Science
• 2018 IEEE International Conference on Big Data (Big Data)
• 2018
It is indicated that quantum computers can currently only be used accurately for solving simple problems with very small amounts of data. Expand
Complete 3-Qubit Grover search on a programmable quantum computer
• Computer Science, Physics
• Nature Communications
• 2017
The authors perform the Grover quantum search algorithm on 3 qubits using trapped ions, demonstrating two methods for marking the correct result in the algorithm’s oracle and providing data for searches yielding 1 or 2 solutions. Expand
Depth optimization of quantum search algorithms beyond Grover's algorithm
• Physics
• 2020
Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modernExpand
A fast quantum mechanical algorithm for database search
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) . Expand
Optimizing the number of gates in quantum search
• Mathematics, Computer Science
• Quantum Inf. Comput.
• 2017
For a very large $N$ that is a power of 2, the number of gates between two queries barely touch more than a constant number of the $\log N$ qubits on which the algorithm acts, so that the algorithm uses essentially the minimal number of queries. Expand
The simplified Toffoli gate implementation by Margolus is optimal
• Mathematics, Physics
• 2003
Unitary operations are expressed in the quantum circuit model as a finite sequence of elementary gates, such as controlled-not gates and single qubit gates. We prove that the simplified Toffoli gateExpand
Trade-offs in the quantum search algorithm
Quantum search has been proved to be the best possible algorithm for the exhaustive search problem in the sense that the number of queries it requires cannot be reduced. However, the number ofExpand
Quantum Amplitude Amplification and Estimation
• Physics, Mathematics
• 2000
Consider a Boolean function $\chi: X \to \{0,1\}$ that partitions set $X$ between its good and bad elements, where $x$ is good if $\chi(x)=1$ and bad otherwise. Consider also a quantum algorithmExpand
Introducing Structure to Expedite Quantum Search
• Computer Science, Physics
• ArXiv
• 2020
A novel quantum algorithm for solving the unstructured search problem with one marked element and the technique which exploits the oracle structure and allows a significant reduction in the number of elementary gates required to find the solution is described. Expand