scientific article; zbMATH DE number 1335895

MaRDI QIDQ4258586zbMATH OpenFDO

Authors John Watrous

Publication date 13 September 1999

zbMATH Keywords

quantum computationprobabilistic Turing machinequantum Turing machine

Mathematics Subject Classification ID

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

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

Cited in

(13)

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

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)