Limitations of variational quantum algorithms: a quantum optimal transport approach
Giacomo De Palma, Milad Marvian, Cambyse Rouz\'e, Daniel Stilck, Fran\c{c}a

TL;DR
This paper establishes tight theoretical bounds on the performance of variational quantum algorithms in noisy and noiseless regimes, demonstrating fundamental limitations for NISQ devices in solving combinatorial optimization problems.
Contribution
It introduces novel quantum entropic and concentration inequalities based on optimal mass transport theory to analyze the limitations of variational quantum algorithms.
Findings
Noisy quantum circuits at depth L=O(p^{-1}) are unlikely to outperform classical algorithms.
Classical algorithms outperform noisy quantum circuits at constant depth in optimization tasks.
New theoretical tools from quantum optimal transport are developed for analyzing quantum algorithm limitations.
Abstract
The impressive progress in quantum hardware in the last years has raised the interest of the quantum computing community in harvesting the computational power of such devices. However, in the absence of error correction, these devices can only reliably implement very shallow circuits or comparatively deeper circuits at the expense of a nontrivial density of errors. In this work, we obtain extremely tight limitation bounds for standard NISQ proposals in both the noisy and noiseless regimes, with or without error-mitigation tools. The bounds limit the performance of both circuit model algorithms, such as QAOA, and also continuous-time algorithms, such as quantum annealing. In the noisy regime with local depolarizing noise , we prove that at depths it is exponentially unlikely that the outcome of a noisy quantum circuit outperforms efficient classical algorithms…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
