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...

Full description

Saved in:
Bibliographic Details
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!