scientific article; zbMATH DE number 1335895

zbMATH Open0935.68043MaRDI QIDQ4258586FDOQ4258586

Authors: John Watrous 

Publication date: 13 September 1999

Title of this publication is not available (Why is that?)

Recommendations

• Space-bounded quantum complexity
• Classical simulation complexity of quantum machines.
• On the complexity of simulating space-bounded quantum computations
• Unbounded-error quantum computation with small space bounds

zbMATH Keywords

quantum computationprobabilistic Turing machinequantum Turing machine

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (13)

• Unbounded-error quantum computation with small space bounds
• On the complexity of simulating space-bounded quantum computations
• Classical simulation complexity of quantum machines.
• Quantum simulations of classical random walks and undirected graph connectivity
• Classically controlled quantum computation
• Complexity limitations on quantum computation
• Quantum alternation
• Quantum computation with devices whose contents are never read
• Quantum branching programs and space-bounded nonuniform quantum complexity
• Space-bounded quantum complexity
• On the computational power of bounded error quantum Turing machines
• Time-Space Complexity Advantages for Quantum Computing
• Time-space efficient simulations of quantum computations

This page was built for publication:

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