Lower bounds for quantum-inspired classical algorithms via communication complexity
Quantum-inspired classical algorithms provide us with a new way to understand the computational power of quantum computers for practically-relevant problems, especially in machine learning. In the past several years, numerous efficient algorithms for various tasks have been found, while an analysis...
Saved in:
| Main Authors: | Nikhil S. Mande, Changpeng Shao |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2025-01-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2025-01-14-1593/pdf/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
by: Arjan Cornelissen, et al.
Published: (2025-06-01) -
Quantum-Inspired Models for Classical Time Series
by: Zoltán Udvarnoki, et al.
Published: (2025-05-01) -
Tighter lower bounds on quantum annealing times
by: Luis Pedro García-Pintos, Mrunmay Sahasrabudhe, Christian Arenz
Published: (2025-05-01) -
Spectral bounds on entropy and ergotropy via statistical effective temperature in classical polarization and quantum thermal states
by: Tariq Aziz, et al.
Published: (2025-08-01) -
Quantum-annealing-inspired algorithms for multijet clustering
by: Hideki Okawa, et al.
Published: (2025-05-01)