Classical simulation complexity of quantum machines.

DOI10.1007/B11926MaRDI QIDQ5900805zbMATH OpenOpenAlexFDO

Authors F. Ablayev, Aida Gainutdinova

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11926

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 1335895
• Classically controlled quantum computation
• Quantum Complexity Theory
• Classical simulation and complexity of quantum computations (invited talk)
• Space-bounded quantum complexity

Cited in

(5)

• On the simulation of quantum Turing machines.
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time
• Languages Recognized with Unbounded Error by Quantum Finite Automata
• scientific article; zbMATH DE number 1335895 (Why is no real title available?)
• Quantum computing, postselection, and probabilistic polynomial-time

This page was built for publication: Classical simulation complexity of quantum machines.

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