Quantum catalytic space
From MaRDI portal
Cites work
- A note on amortized branching program complexity
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Catalytic space: non-determinism and hierarchy
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Computing Algebraic Formulas Using a Constant Number of Registers
- Computing with a full memory: catalytic space
- Eliminating intermediate measurements in space-bounded Quantum computation
- Estimating Jones polynomials is a complete problem for one clean qubit
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Inverting well conditioned matrices in quantum logspace
- Matchgate and space-bounded quantum computations are equivalent
- Mathematical models of quantum computation
- Nondeterministic Space is Closed under Complementation
- On pure space vs catalytic space
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Problems and results in extremal combinatorics. I.
- Quantum algorithms for solvable groups
- Quantum Complexity Theory
- Quantum computation and quantum information. 10th anniversary edition
- Quantum computations: algorithms and error correction
- Quantum logspace computations are verifiable
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Relationships between nondeterministic and deterministic tape complexities
- Reusing space: techniques and open problems
- The method of forced enumeration for nondeterministic automata
- The Solovay--Kitaev algorithm
- Trading time and space in catalytic branching programs
This page was built for publication: Quantum catalytic space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313327)
