Entanglement budgets and certified energy floors for variational quantum circuits

This preprint develops optimizer-independent lower bounds on the minimum energy error attainable by a fixed variational quantum circuit. The central idea is to compare the entanglement that a circuit can generate across cuts of the qubit register with the Schmidt spectrum of a target ground state. Combining this representational limitation with the spectral gap gives a certified energy floor that applies to every parameter choice in the circuit family. The basic certificate uses the number of entangling gates crossing each cut and gives a rank-based lower bound on the attainable energy. We characterize the regime in which this bound is informative, evaluate it for transverse-field Ising chains up to 128 qubits using a free-fermion representation, and bound the additional improvement available from imposing rank constraints across several cuts simultaneously. We further introduce an angle-budget certificate that retains the strength of partial entanglers rather than treating every nonzero entangling gate identically. Its continuous-time form gives pulse-area and interaction-time lower bounds. When a variational circuit preserves a symmetry of the Hamiltonian, replacing the global spectral gap with the gap inside the accessible symmetry sector can substantially strengthen the certificate. Numerical tests on disordered Ising and Heisenberg chains also examine whether minimizing the certified rank floor provides a useful rule for allocating entangling gates. In the systems studied here, lowering the certificate does not reliably lower the trained VQE energy, showing that the bounds are best interpreted as necessary-condition tests of representational capacity rather than complete predictors of variational performance.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24344722
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Entanglement budgets and certified energy floors for variational quantum circuits

Shreya Girish Savadatti
2 links
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Entanglement budgets and certified energy floors for variational quantum circuits

Shreya Girish Savadatti
preprint en

Abstract

This preprint develops optimizer-independent lower bounds on the minimum energy error attainable by a fixed variational quantum circuit. The central idea is to compare the entanglement that a circuit can generate across cuts of the qubit register with the Schmidt spectrum of a target ground state. Combining this representational limitation with the spectral gap gives a certified energy floor that applies to every parameter choice in the circuit family. The basic certificate uses the number of entangling gates crossing each cut and gives a rank-based lower bound on the attainable energy. We characterize the regime in which this bound is informative, evaluate it for transverse-field Ising chains up to 128 qubits using a free-fermion representation, and bound the additional improvement available from imposing rank constraints across several cuts simultaneously. We further introduce an angle-budget certificate that retains the strength of partial entanglers rather than treating every nonzero entangling gate identically. Its continuous-time form gives pulse-area and interaction-time lower bounds. When a variational circuit preserves a symmetry of the Hamiltonian, replacing the global spectral gap with the gap inside the accessible symmetry sector can substantially strengthen the certificate. Numerical tests on disordered Ising and Heisenberg chains also examine whether minimizing the certified rank floor provides a useful rule for allocating entangling gates. In the systems studied here, lowering the certificate does not reliably lower the trained VQE energy, showing that the bounds are best interpreted as necessary-condition tests of representational capacity rather than complete predictors of variational performance.

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon