Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy 论文

2010Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences引用 299
DOIArXivPDF
Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in GraphsPolynomial and algebraic computation
量子计算Quantum Computing Algorithms and ArchitecturePolynomial and algebraic computationComplexity and Algorithms in Graphs
相关技术:Complexity and Algorithms in GraphsQuantum Computing Algorithms and Architecture
关系图谱

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy · 相关技术

相关技术

Complexity and Algorithms in GraphsQuantum Computing Algorithms and Architecture