BQP algorithms are bounded error and quantum polynomial time algorithms. These algorithms are related to a class of decision problems executable on quantum computer in polynomial time.
Bounded-error, quantum, polynomial time algorithms are listed below.
- Computing Knot invariants
- Quantum Simulation
Q# laatste nieuws 