Classical Simulation of Commuting Quantum Computations Implies Collapse of the Polynomial Hierarchy

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences - United Kingdom
doi 10.1098/rspa.2010.0301
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Royal Society

Related search

Classical Simulation of Quantum Computations

2005English

Classical and Quantum Computations With Restricted Memory

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Classical Simulation of Quantum Systems?

Physics
2016English

On the Complexity of Polynomial Matrix Computations

2003English

Elimination of Parameters in the Polynomial Hierarchy

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1999English

Clifford Recompilation for Faster Classical Simulation of Quantum Circuits

Quantum
2019English

Graph Ramsey Theory and the Polynomial Hierarchy

1999English

The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1986English

Quantum Relatives of the Alexander Polynomial

St. Petersburg Mathematical Journal
Applied MathematicsNumber TheoryAnalysisAlgebra
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy