Complexity limitations on quantum computation
Lance Fortnow, John D. Rogers
Abstract
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. 1. BQP is low for PP, i.e., PPBQP=PP. 2. There exists a relativized world where P=BQP and the polynomial-time hierarchy is infinite. 3. There exists a relativized world where BQP does not have complete sets. 4. There exists a relativized world where P=BQP but P is not equal to UP intersect coUP and one-way functions exist. This gives a relativized answer to an open question of Simon.
Create a lesson
Related papers
Learning, Compression, and Meta-Complexity
Halley Goldberg, Mikito Nanashima, Igor C. Oliveira
Graph determination problem from knowledge of its subgraphs
Coralie Zens, Dominique Barth, Dimitri Watel et al.
NP-hardness of additive approximation for generalized Turán problems
Yihan Chen, Jialin He, Xihe Li et al.
A simplified proof of polynomial improvements for 3SUM and APSP
Sankeerth Rao Karingula, Shachar Lovett
Saving the Queen is hard: Hive is EXPTIME-complete
Francesco Carboni, Daniele Muscillo
Unconditional Separation between LL and CLL
Shubham Bhardwaj