analiza aiqbench
This study provides the first quantitative analysis of convergence rates for Sum-of-Hermitian-Squares relaxations in noncommutative polynomial optimization, specifically for n-qubit ground state energy problems. By bounding convergence via Krawtchouk polynomial roots, the work establishes a critical theoretical foundation for assessing the accuracy and efficiency of these tools in quantum theory. This advancement offers practitioners a clearer metric for predicting when these relaxations reach sufficient precision for practical quantum applications.
Convergence rates of Sum-of-Hermitian-Squares Hierarchies for the Pauli algebra
arXiv:2606.04940v1 Announce Type: new Abstract: Moment/Sum-of-Hermitian-Squares relaxations for noncommutative polynomial optimization problems have become an important tool for analyzing problems within quantum theory. Despite their widespread success, little is known about their rate of convergence and, consequently, their accuracy. In this work, we develop explicit convergence rates for relaxations of noncommutative polynomial optimization problems generated from the Pauli algebra -- covering applications to the ground state energy problem for n-qubit systems. In particular, we show that the rate of convergence can be bounded in terms of the smallest roots of a family of orthogonal polynomials known as Krawtchouk polynomials. Our result represents the first quantitative analysis of the rate of convergence for relaxations of noncommutative polynomial optimization problems.
Abstract:Moment/Sum-of-Hermitian-Squares relaxations for noncommutative polynomial optimization problems have become an important tool for analyzing problems within quantum theory. Despite their widespread success, little is known about their rate of convergence and, consequently, their accuracy. In this work, we develop explicit convergence rates for relaxations of noncommutative polynomial optimization problems generated from the Pauli algebra -- covering applications to the ground state energy problem for n-qubit systems. In particular, we show that the rate of convergence can be bounded in terms of the smallest roots of a family of orthogonal polynomials known as Krawtchouk polynomials. Our result represents the first quantitative analysis of the rate of convergence for relaxations of noncommutative polynomial optimization problems.
Quantum Physics (quant-ph); Optimization and Control (math.OC)
arXiv:2606.04940 [quant-ph]
(or arXiv:2606.04940v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2606.04940 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 211 cuvinte
Subiecte conexe

Exploding variance of means of exponentials: least-squares to the rescue – Machine Learning Research Blog
francisbach.com · 27 sept. 2026
Running Variational Quantum Eigensolver with Qiskit Aer on AMD Instinct
AMD · 29 mai 2026

Quantum Max d-Cut via qudit swap operators
Quantum Journal · 3 sept. 2026
A Sum-of-Squares Hierarchy with Quadratic Convergence for Quantum Channel Coding
arXiv · 10 sept. 2026