BQP and the polynomial hierarchy 论文
2010引用 229
Quantum Computing Algorithms and ArchitectureComputability, Logic, AI AlgorithmsComplexity and Algorithms in Graphs
摘要
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside the entire polynomial hierarchy, by relating this question to topics in circuit complexity, pseudorandomness, and Fourier analysis.