Everything about PostBQP

🧭 Start here: a 6-step reading path

1. Read the overview: PostBQPA 5-minute orientation
2. Go sideways: BQPA closely related topic
3. Go sideways: PP (complexity)A closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• BQP In computational complexity theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial…
• 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 complexity theory Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational…
• 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…
• 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…
• One clean qubit In quantum information, the one clean qubit model of computation is performed an n {\displaystyle n} qubit system with one pure state and n − 1 {\displaystyle…
• Shor's algorithm Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor…
• Grover's algorithm In quantum computing, Grover's algorithm, also known as the quantum search algorithm, is a quantum algorithm for unstructured search that finds with high…