Space-bounded quantum complexity
From MaRDI portal
Publication:1961378
zbMath0947.68051MaRDI QIDQ1961378
Publication date: 6 November 2000
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
Quantum alternation ⋮ On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace ⋮ On approximating the eigenvalues of stochastic matrices in probabilistic logspace ⋮ Reconstructing black hole exteriors and interiors using entanglement and complexity ⋮ The cosmological switchback effect ⋮ Circuit complexity for Carrollian conformal (BMS) field theories ⋮ Exact results for accepting probabilities of quantum automata. ⋮ Unnamed Item ⋮ Surface counterterms and regularized holographic complexity ⋮ A Complete Characterization of Unitary Quantum Space ⋮ Advice Coins for Classical and Quantum Computation ⋮ Complexity is simple! ⋮ Unbounded-error quantum computation with small space bounds ⋮ Quantum simulations of classical random walks and undirected graph connectivity ⋮ Quantum branching programs and space-bounded nonuniform quantum complexity ⋮ Circuit complexity and 2D bosonisation ⋮ Exponential separation of quantum and classical online space complexity ⋮ Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice ⋮ Languages Recognized with Unbounded Error by Quantum Finite Automata ⋮ Quantum State Complexity of Formal Languages ⋮ Complexity from spinning primaries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversible simulation of space-bounded computations
- Space-bounded hierarchies and probabilistic computations
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- Time/Space Trade-Offs for Reversible Computation
- Rapid solution of problems by quantum computation
- Computational Complexity of Probabilistic Turing Machines
- On Relating Time and Space to Size and Depth
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Oracle Quantum Computing
- Relationships among $PL$, $\#L$, and the determinant
- The Kantorovich and Some Related Inequalities
- Logical Reversibility of Computation
This page was built for publication: Space-bounded quantum complexity
