The following pages link to Space-bounded quantum complexity (Q1961378):
Displaying 30 items.
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- Exact results for accepting probabilities of quantum automata. (Q1401229) (← links)
- Surface counterterms and regularized holographic complexity (Q1705931) (← links)
- Complexity is simple! (Q1748732) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- On the complexity of simulating space-bounded quantum computations (Q1889853) (← links)
- Complexity from spinning primaries (Q2085207) (← links)
- Space complexity of streaming algorithms on universal quantum computers (Q2110722) (← links)
- Circuit complexity and 2D bosonisation (Q2283552) (← links)
- Quantum alternation (Q2361668) (← links)
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace (Q2410679) (← links)
- On the computational power of bounded error quantum Turing machines (Q2735185) (← links)
- Time-space efficient simulations of quantum computations (Q2913801) (← links)
- Advice Coins for Classical and Quantum Computation (Q3012792) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace (Q3448804) (← links)
- (Q4598147) (← links)
- (Q4782728) (← links)
- A Complete Characterization of Unitary Quantum Space (Q4993267) (← links)
- Probabilistic logarithmic-space algorithms for Laplacian solvers (Q5002644) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- Uncountable classical and quantum complexity classes (Q5223610) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- Fundamentals of Computation Theory (Q5900805) (← 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)
- Reconstructing black hole exteriors and interiors using entanglement and complexity (Q6055692) (← links)
- The cosmological switchback effect (Q6055773) (← links)
- Circuit complexity for Carrollian conformal (BMS) field theories (Q6079641) (← links)
