scientific article

DOI10.4086/toc.2012.v008a001zbMath1253.68136OpenAlexW1575641978MaRDI QIDQ2913801

No author found.

Publication date: 27 September 2012

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2012.v008a001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

simulationsquantum computingsatisfiabilitySolovay-Kitaevtime-space lower bounds

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

Quantum alternation ⋮ Quantum circuits with classical channels and the principle of deferred measurements ⋮ On approximating the eigenvalues of stochastic matrices in probabilistic logspace ⋮ A structured view on weighted counting with relations to counting, quantum computation and applications ⋮ A Complete Characterization of Unitary Quantum Space ⋮ Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice

Cites Work

• Time-space tradeoffs for counting NP solutions modulo integers
• Time-space tradeoffs for satisfiability
• Inductive time-space lower bounds for SAT and related problems
• Implementation of the Semiclassical Quantum Fourier Transform in a Scalable System
• Classically controlled quantum computation

This page was built for publication: