Oracle Quantum Computing

DOI10.1080/09500349414552351zbMath0942.81536OpenAlexW2079429651MaRDI QIDQ4490519

André Berthiaume, Gilles Brassard

Publication date: 16 July 2000

Published in: Journal of Modern Optics (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.1951

Mathematics Subject Classification ID

Related Items (17)

Quantum computing without entanglement ⋮ Quantum computation with classical light: the Deutsch algorithm ⋮ Time evolution of complexity: a critique of three methods ⋮ On the simulation of quantum Turing machines. ⋮ VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM ⋮ Space-bounded quantum complexity ⋮ ANALYSIS OF QUANTUM FUNCTIONS ⋮ QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES ⋮ The Road to Quantum Computational Supremacy ⋮ The Deutsch-Jozsa problem: de-quantisation and entanglement ⋮ The robustness of LWPP and WPP, with an application to graph reconstruction ⋮ Analogies and differences between quantum and stochastic automata ⋮ Quantum computation and quantum information† ⋮ Quantum computing: beyond the limits of conventional computation† ⋮ Almost-everywhere superiority for quantum polynomial time ⋮ Computational complexity of uniform quantum circuit families and quantum Turing machines ⋮ Relativized separation of EQP from \(\text{P}^{\text{NP}}\)

Cites Work

• Experimental quantum cryptography.
• Complexity Measures for Public-Key Cryptosystems
• Characterizing classes of functions computable by quantum parallelism
• Rapid solution of problems by quantum computation
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Computational Complexity of Probabilistic Turing Machines
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum complexity theory
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Logical Reversibility of Computation

This page was built for publication: Oracle Quantum Computing