Pages that link to "Item:Q1889853"
From MaRDI portal
The following pages link to On the complexity of simulating space-bounded quantum computations (Q1889853):
Displaying 23 items.
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties (Q498408) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- Space-bounded quantum complexity (Q1961378) (← links)
- Space complexity of streaming algorithms on universal quantum computers (Q2110722) (← links)
- Quantum circuits with classical channels and the principle of deferred measurements (Q2139049) (← links)
- Perturbation gadgets: arbitrary energy scales from a single strong interaction (Q2288292) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Quantum alternation (Q2361668) (← links)
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs (Q2361670) (← links)
- Time-space efficient simulations of quantum computations (Q2913801) (← links)
- (Q3304156) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)
- (Q4637976) (← links)
- (Q4782728) (← links)
- QUANTUM COUNTER AUTOMATA (Q4902895) (← links)
- A Complete Characterization of Unitary Quantum Space (Q4993267) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Quantum simulations of classical random walks and undirected graph connectivity (Q5943095) (← links)
