Complexity Limitations on Quantum Computation

We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP.

• Type: Conference
• Year: 1998
• Where: COCO
• Authors: Lance Fortnow, John D. Rogers
• Keywords: Algorithms, COCO 1998, Probabilistic Quantum Class, Relativized World, There Exists