Tagged Questions
4
votes
1answer
60 views
Do error checking costs of quantum computing shrink BQP?
BQP is the set of problems solvable in polynomial time for a given error tolerance, and it is suspected to be larger than P (and BPP, which is probably equal to P). However, inability for the gates to ...
