Cover Image

Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yao, Jiaqi, Liu, Ding
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics Computational Complexity Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
by: Grewal, Sabee, et al.
Published: (2022)

Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games
by: Li, Tongyang, et al.
Published: (2025)

Learning Quantum Processes with Quantum Statistical Queries
by: Wadhwa, Chirag, et al.
Published: (2023)

Universal Matrix Multiplication on Quantum Computer
by: Yao, Jiaqi, et al.
Published: (2024)

Classical Verification of Quantum Learning
by: Caro, Matthias C., et al.
Published: (2023)

Proper vs Improper Quantum PAC learning
by: Nayak, Ashwin, et al.
Published: (2024)

Quantum computing and persistence in topological data analysis
by: Gyurik, Casper, et al.
Published: (2024)

Quantum Learning Theory Beyond Batch Binary Classification
by: Mohan, Preetham, et al.
Published: (2023)

Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
by: Meyer, Sabri, et al.
Published: (2025)

Scalable Quantum Error Mitigation with Neighbor-Informed Learning
by: Chen, Zhenyu, et al.
Published: (2025)

Spacetime-Efficient Low-Depth Quantum State Preparation with Applications
by: Gui, Kaiwen, et al.
Published: (2023)

Learning Robust Observable to Address Noise in Quantum Machine Learning
by: Khanal, Bikram, et al.
Published: (2024)

Quantum-Classical Separations in Shallow-Circuit-Based Learning with and without Noises
by: Zhang, Zhihan, et al.
Published: (2024)

Generalization Error Bound for Quantum Machine Learning in NISQ Era -- A Survey
by: Khanal, Bikram, et al.
Published: (2024)

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems
by: Grønlund, Allan, et al.
Published: (2024)

Raising the Bar: An Asymptotic Comparison of Classical and Quantum Shortest Path Algorithms
by: Do, Phuc Hao, et al.
Published: (2025)

Learning quantum states prepared by shallow circuits in polynomial time
by: Landau, Zeph, et al.
Published: (2024)

Taming Barren Plateaus in Arbitrary Parameterized Quantum Circuits without Sacrificing Expressibility
by: Chen, Zhenyu, et al.
Published: (2025)

Noisy Quantum Learning Theory
by: Cotler, Jordan, et al.
Published: (2025)

The Communication Complexity of Approximating Matrix Rank
by: Sherstov, Alexander A., et al.
Published: (2024)

On the average-case complexity of learning output distributions of quantum circuits
by: Nietner, Alexander, et al.
Published: (2023)

Learning unitaries with quantum statistical queries
by: Angrisani, Armando
Published: (2023)

Learning depth-3 circuits via quantum agnostic boosting
by: Arunachalam, Srinivasan, et al.
Published: (2025)

Entanglement-induced provable and robust quantum learning advantages
by: Zhao, Haimeng, et al.
Published: (2024)

Learning quantum states and unitaries of bounded gate complexity
by: Zhao, Haimeng, et al.
Published: (2023)

A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
by: Wu, Xudong, et al.
Published: (2025)

Quantum and Classical Communication Complexity of Permutation-Invariant Functions
by: Guan, Ziyi, et al.
Published: (2023)

Lower Bounds for Learning Quantum States with Single-Copy Measurements
by: Lowe, Angus, et al.
Published: (2022)

The Exact Replica Threshold for Nonlinear Moments of Quantum States
by: Zeng, Shuai
Published: (2026)

Optimal lower bounds for Quantum Learning via Information Theory
by: Hadiashar, Shima Bab, et al.
Published: (2023)

Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
by: Oh, Yun-Tak, et al.
Published: (2026)

Nonlocal Games in the High-Noise Regime: Optimal Quantum Values and Rigidity
by: Fu, Honghao, et al.
Published: (2025)

New Quantum Algorithms for Computing Quantum Entropies and Distances
by: Wang, Qisheng, et al.
Published: (2022)

On the Computational Complexity of Schrödinger Operators
by: Zheng, Yufan, et al.
Published: (2024)

Basic Quantum Algorithms
by: Portugal, Renato
Published: (2022)

Quantum Complexity vs Classical Complexity: A Survey
by: Vaezi, Arash, et al.
Published: (2023)

Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood
by: Chen, Sitan, et al.
Published: (2025)

Pseudo-deterministic Quantum Algorithms
by: Aaronson, Hugo, et al.
Published: (2026)

An Efficient Quantum Factoring Algorithm
by: Regev, Oded
Published: (2023)

Efficient Algorithms for Quantum Hashing
by: Zinnatullin, Ilnar, et al.
Published: (2025)