Quantum communication complexity of linear regression
From MaRDI portal
Cites work
- 3. Inconsistent systems of linear equations
- A quantum-inspired classical algorithm for recommendation systems
- Exponential separation of quantum and classical communication complexity
- scientific article; zbMATH DE number 177818 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- On quantum and probabilistic communication: Las Vegas and one-way protocols
- On randomized one-round communication complexity
- Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with subconstant error
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Quantum communication and complexity.
- Quantum communication complexity of symmetric predicates
- Quantum one-way communication can be exponentially stronger than classical communication
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Randomized communication complexity for linear algebra problems over finite fields
- Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
- The Communication Complexity of Optimization
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- The Quantum Communication Complexity of Sampling
- Variable time amplitude amplification and quantum algorithms for linear algebra problems
- When distributed computation is communication expensive
This page was built for publication: Quantum communication complexity of linear regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022395)
