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
-
Entropic Lower Bound for Distinguishability of Quantum States
by: Seungho Yang, et al.
Published: (2015-01-01) -
Lower bounds for the expected sample size in the classical and d-posterior statistical problems
by: I.A. Kareev, et al.
Published: (2018-06-01) -
Classical and quantum algorithms for many-body problems
by: Ayral, Thomas
Published: (2025-01-01) -
Effect of Population Structures on Quantum-Inspired Evolutionary Algorithm
by: Nija Mani, et al.
Published: (2014-01-01) -
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
by: J.‐F. Biasse, et al.
Published: (2023-03-01)