Quantum logspace algorithm for powering matrices with bounded norm
From MaRDI portal
Cites work
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- A time-space lower bound for a large class of learning problems
- Both Toffoli and Controlled-NOT need little help to universal quantum computing
- Contractivity of positive and trace-preserving maps under Lp norms
- Entropy samplers and strong generic lower bounds for space bounded learning
- Extractor-based time-space lower bounds for learning
- Fast learning requires good memory: a time-space lower bound for parity learning
- scientific article; zbMATH DE number 6820203 (Why is no real title available?)
- Inverting well conditioned matrices in quantum logspace
- Irreversibility and Heat Generation in the Computing Process
- Matrix theory. Basic results and techniques
- Notes on Landauer's principle, reversible computation, and Maxwell's demon
- Quantum Arthur-Merlin games
- Quantum computation and quantum information. 10th anniversary edition
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Reproducibility and pseudo-determinism in log-space
- Reversible space equals deterministic space
- Space-bounded quantum complexity
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- Time-space efficient simulations of quantum computations
- Time-space hardness of learning sparse parities
- Time-space tradeoff in derandomizing probabilistic logspace
This page was built for publication: Quantum logspace algorithm for powering matrices with bounded norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241171)
