BQP

Definition

In computational complexity theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances. It is the quantum analogue to the complexity class BPP.

Related concepts

2-EXPTIME AC0 ACC0 ALL (complexity)APX Adiabatic quantum computation Algorithm Algorithmic cooling Almost Wide Probabilistic Polynomial-Time Amplitude amplification Arithmetical hierarchy Arthur–Merlin protocol BB84 BHT algorithm BPP (complexity)BQP (disambiguation)Bacon–Shor code Bell's theorem Bernstein–Vazirani algorithm Bit Boolean hierarchy Boson sampling Bounded-error CC (complexity)CSS code Cavity quantum electrodynamics Charge qubit Chernoff bound Circuit complexity Circuit quantum electrodynamics Cirq Classical capacity Cloud-based quantum computing Cluster state Co-NP Co-NP-complete Complete (complexity)Complexity class Computational complexity theory Continuous-variable quantum information Controlled NOT gate Cross-entropy benchmarking DLOGTIME DSPACE DTIME Decision problems Decoy state Deferred Measurement Principle Deutsch–Jozsa algorithm DiVincenzo's criteria Discrete logarithm ELEMENTARY EXPSPACE EXPTIME Eastin–Knill theorem Entanglement-assisted classical capacity Entanglement-assisted stabilizer formalism Entanglement distillation Entanglement swapping Exact quantum polynomial time Exponential hierarchy FL (complexity)FNP (complexity)FP (complexity)Five-qubit error correcting code Flux qubit Gleason's theorem Gnu code Gottesman–Kitaev–Preskill code Gottesman–Knill theorem Grover's algorithm Grzegorczyk hierarchy HHL algorithm Hamiltonian quantum computation Hidden matching problem Hidden subgroup problem Holevo's theorem IBM Quantum Experience IP (complexity)Integer factorization Interactive proof system Jones polynomial KLM protocol Kane quantum computer LOCC L (complexity)Language (computability)Libquantum Linear optical quantum computing List of complexity classes List of quantum key distribution protocols List of quantum processors List of unsolved problems in computer science Low (complexity)Magic state distillation Model of computation Monogamy of entanglement NC (complexity)NEXPTIME NL-complete NL (complexity)NONELEMENTARY NP-completeness NP-hardness NP (complexity)NSPACE NTIME Neutral atom quantum computer Nitrogen-vacancy center No-broadcasting theorem No-cloning theorem No-communication theorem No-deleting theorem No-hiding theorem No-teleportation theorem Noisy intermediate-scale quantum era Nuclear magnetic resonance quantum computer One-way quantum computer One clean qubit OpenQASM Oracle machine P-complete PBR theorem PP (complexity)PR (complexity)PSPACE PSPACE-complete P (complexity)P versus NP problem Parity P Path integral formulation Phase qubit Physical and logical qubits PolyL Polynomial hierarchy Polynomial time Post-quantum cryptography PostBQP Postselection Princeton University Probabilistic Turing machine Probabilistically checkable proof Promise problem QIP (complexity)QMA Q Sharp Qiskit Quantum Fourier transform Quantum Turing machine Quantum algorithm Quantum annealing Quantum capacity Quantum channel Quantum circuit Quantum coin flipping Quantum complexity theory Quantum computer Quantum computing Quantum computing scaling laws Quantum convolutional code Quantum counting algorithm Quantum cryptography Quantum energy teleportation Quantum error correction Quantum gate teleportation Quantum information Quantum information science Quantum key distribution Quantum logic gate Quantum machine learning Quantum money Quantum network Quantum neural network Quantum optics Quantum optimization algorithms Quantum phase estimation algorithm Quantum programming Quantum secret sharing Quantum simulator Quantum speed limit theorems Quantum state purification Quantum supremacy Quantum teleportation Quantum volume Quasi-polynomial time Qubit Qubits Quil (instruction set architecture)RE (complexity)RL (complexity)RP (complexity)R (complexity)Ran Raz Randomized benchmarking Regular language Relaxation (NMR)Richard Feynman Rigetti Computing SARG04 SC (complexity)SL (complexity)Schrödinger–HJW theorem Shor's algorithm Shor code Simon's problem Solovay–Kitaev theorem Spin (physics)Spin qubit quantum computer Spin–lattice relaxation Spin–spin relaxation Stabilizer code Stanford University Steane code Superconducting quantum computing Superdense coding TC0 TC (complexity)TFNP Threshold theorem Timeline of quantum computing and communication Topological quantum computer Toric code Transmon Trapped-ion quantum computer UP (complexity)Ultracold atom Universal quantum simulator Variational quantum eigensolver With high probability ZPP (complexity)♯P ♯P-complete

16 concepts already in your glossary