Misplaced Pages

The following pages link to BQP

• (link count
• transclusion count
• sorted list) · See help page for transcluding these entries

Showing 50 items.

• BPP (complexity) (links | edit)
• P versus NP problem (links | edit)
• Co-NP (links | edit)
• Church–Turing thesis (links | edit)
• Computational complexity theory (links | edit)
• Electron (links | edit)
• Integer factorization (links | edit)
• NP (complexity) (links | edit)
• Nondeterministic Turing machine (links | edit)
• No-cloning theorem (links | edit)
• NC (complexity) (links | edit)
• Quantum computing (links | edit)
• Quantum information (links | edit)
• Quantum teleportation (links | edit)
• Qubit (links | edit)
• ♯P (links | edit)
• ♯P-complete (links | edit)
• PSPACE (links | edit)
• Shor's algorithm (links | edit)
• Quantum key distribution (links | edit)
• Co-NP-complete (links | edit)
• NP-hardness (links | edit)
• P-complete (links | edit)
• PSPACE-complete (links | edit)
• EXPTIME (links | edit)
• EXPSPACE (links | edit)
• RP (complexity) (links | edit)
• ZPP (complexity) (links | edit)
• Bell's theorem (links | edit)
• Grover's algorithm (links | edit)
• Schrödinger equation (links | edit)
• Interactive proof system (links | edit)
• List of unsolved problems in physics (links | edit)
• Arithmetical hierarchy (links | edit)
• Timeline of quantum computing and communication (links | edit)
• UP (complexity) (links | edit)
• Time complexity (links | edit)
• Deutsch–Jozsa algorithm (links | edit)
• Complexity class (links | edit)
• Probabilistically checkable proof (links | edit)
• Kane quantum computer (links | edit)
• Quantum algorithm (links | edit)
• NSPACE (links | edit)
• DSPACE (links | edit)
• DTIME (links | edit)
• NTIME (links | edit)
• P (complexity) (links | edit)
• PH (complexity) (links | edit)
• Polynomial hierarchy (links | edit)
• Quantum optics (links | edit)