Quantum Simulation Logic, Oracles, and the Quantum Advantage
AbstractQuery complexity is a common tool for comparing quantum and classical computation, and it has produced many examples of how quantum algorithms differ from classical ones. Here we investigate in detail the role that oracles play for the advantage of quantum algorithms. We do so by using a simulation framework, Quantum Simulation Logic (QSL), to construct oracles and algorithms that solve some problems with the same success probability and number of queries as the quantum algorithms. The framework can be simulated using only classical resources at a constant overhead as compared to the quantum resources used in quantum computation. Our results clarify the assumptions made and the conditions needed when using quantum oracles. Using the same assumptions on oracles within the simulation framework we show that for some specific algorithms, such as the Deutsch-Jozsa and Simon’s algorithms, there simply is no advantage in terms of query complexity. This does not detract from the fact that quantum query complexity provides examples of how a quantum computer can be expected to behave, which in turn has proved useful for finding new quantum algorithms outside of the oracle paradigm, where the most prominent example is Shor’s algorithm for integer factorization. View Full-Text
Share & Cite This Article
Johansson, N.; Larsson, J.-Å. Quantum Simulation Logic, Oracles, and the Quantum Advantage. Entropy 2019, 21, 800.
Johansson N, Larsson J-Å. Quantum Simulation Logic, Oracles, and the Quantum Advantage. Entropy. 2019; 21(8):800.Chicago/Turabian Style
Johansson, Niklas; Larsson, Jan-Åke. 2019. "Quantum Simulation Logic, Oracles, and the Quantum Advantage." Entropy 21, no. 8: 800.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.