Live briefing
Everything about BQP
Computational complexity class of problems
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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: BQPA 5-minute orientation
- Skim a recent paper: <p>Hybrid Quantum-Classical Implementation of the Harrow–Hassidim–Lloyd Algorithm: Bounded-Error Quantum Polynomial Time (BQP)-Completeness of Matrix Inversion and Error Mitigation for Noisy Intermediate-Scale Quantum (NISQ) Devices</p>Influential work since 2022
- Pick up a classic book: Big queer poems ; Little queer poemsThe most-reprinted book on the subject
- Read the landmark paper: BQP-completeness of scattering in scalar quantum field theoryCited 90 times
- Go sideways: PostBQPA closely related topic
- Go sideways: Quantum complexity theoryA closely related topic
đź“– Definitions
Symbol ISO 639-3 language code for Busa.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
BQP-completeness of scattering in scalar quantum field theory
Verifying BQP Computations on Noisy Devices with Minimal Overhead
Oracle Separation of BQP and PH
The BQP-hardness of approximating the Jones polynomial
Merlinization of complexity classes above BQP
Error mitigation of BQP computations using measurement-based verification
On the Physical Basis for the Incomparability of NP and BQP
Kronecker Coefficients in #BQP
🆕 Influential since 2022
<p>Hybrid Quantum-Classical Implementation of the Harrow–Hassidim–Lloyd Algorithm: Bounded-Error Quantum Polynomial Time (BQP)-Completeness of Matrix Inversion and Error Mitigation for Noisy Intermediate-Scale Quantum (NISQ) Devices</p>
A reduced proximal-point homotopy method for large-scale non-convex BQP
đź“š Books worth reading
- 📕Big queer poems ; Little queer poemsDan Martell · 1995
- 📕Higher-Level Thinking Questions · 1999
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- PostBQP In computational complexity theory, PostBQP is a complexity class consisting of all of the computational problems solvable in polynomial time on a quantum…
- Quantum complexity theory Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational…
- PP (complexity) In complexity theory, PP, or PPT is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability…
- Quantum algorithm In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the…
- Quantum logic gate In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate (or simply quantum gate) is a basic quantum circuit…
- Quantum computing A quantum computer is a computer that represents and processes information using quantum states. Quantum computations exploit phenomena such as superposition…
- Quantum supremacy In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that…
- QMA QMA, as an abbreviation for Quantum Merlin Arthur, refers to a complexity class in computational complexity theory. It is the set of all formal languages…