Classical simulation and complexity of quantum computations (invited talk)

DOI10.1007/978-3-642-13182-0_23zbMATH Open1285.68047OpenAlexW1554033614MaRDI QIDQ3569748FDOQ3569748

Authors: Richard Jozsa 

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_23

Recommendations

• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
• Invited Talk: Embedding Classical into Quantum Computation
• Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time
• Commuting quantum circuits with few outputs are unlikely to be classically simulatable

zbMATH Keywords

quantum complexityquantum computationmatchgatesclassical simulation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Cited In (10)

• Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
• Classical simulation complexity of quantum machines.
• Simulating quantum computers with probabilistic methods
• Invited Talk: Embedding Classical into Quantum Computation
• Commuting quantum circuits with few outputs are unlikely to be classically simulatable
• Quantum computers that can be simulated classically in polynomial time
• Quantum advantage of unitary Clifford circuits with magic state inputs
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
• Exact and efficient simulation of concordant computation
• Computational complexity, step by step

This page was built for publication: Classical simulation and complexity of quantum computations (invited talk)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569748)