Numerical Error Extraction by Quantum Measurement Algorithm
Clement Ronfaut, Robin Ollive, Stephane Louise

TL;DR
This paper introduces NEEQMA, a quantum measurement algorithm that extracts convergence constants directly from a QPU, enabling optimized gate approximation accuracy in quantum algorithms.
Contribution
It proposes a novel protocol to determine convergence constants for quantum gate approximation directly on a quantum device, improving practical accuracy control.
Findings
Successfully tested on Quantum Signal Processing instances
Enables optimal selection of convergence parameters
Improves gate approximation accuracy in quantum algorithms
Abstract
Important quantum algorithm routines allow the implementation of specific quantum operations (a.k.a. gates) by combining basic quantum circuits with an iterative structure. In this structure, the number of repetitions of the basic circuit pattern is associated to convergence parameters. This iterative structure behaves similarly to function approximation by series expansion: the higher the truncation order, the better the target gate (i.e. operation) approximation. The asymptotic convergence of the gate error with respect to the number of basic pattern repetitions is known. It is referred to as the query complexity. The underlying convergence law is bounded, but not in an explicit fashion. Upper bounds are generally too pessimistic to be useful in practice. The actual convergence law contains constants that depend on the joint properties of the matrix encoded by the query and the…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
