Information-Theoretic Constraints on Variational Quantum Optimization: Efficiency Transitions and the Dynamical Lie Algebra

• URL: http://arxiv.org/abs/2512.14701v1
• Date: Tue, 02 Dec 2025 16:09:18 GMT
• Title: Information-Theoretic Constraints on Variational Quantum Optimization: Efficiency Transitions and the Dynamical Lie Algebra
• Authors: Jun Liang Tan,
• Abstract summary: Variational quantum algorithms are the leading candidates for near-term quantum advantage, yet their scalability is limited by the Barren Plateau'' phenomenon.<n>Using ancilla-mediated coherent feedback, we demonstrate an empirical relation $E leq I(S:A)$ linking work extraction to mutual information, with quantum entanglement providing a factor-of-2 advantage over classical Landauer bounds.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational quantum algorithms are the leading candidates for near-term quantum advantage, yet their scalability is limited by the ``Barren Plateau'' phenomenon. While traditionally attributed to geometric vanishing gradients, we propose an information-theoretic perspective. Using ancilla-mediated coherent feedback, we demonstrate an empirical constitutive relation $ΔE \leq ηI(S:A)$ linking work extraction to mutual information, with quantum entanglement providing a factor-of-2 advantage over classical Landauer bounds. By scaling the system size, we identify a distinct efficiency transition governed by the dimension of the Dynamical Lie Algebra. Systems with polynomial algebraic complexity exhibit sustained positive efficiency, whereas systems with exponential complexity undergo an ``efficiency collapse'' ($η\to 0$) at $N \approx 6$ qubits. These results suggest that the trainability boundary in variational algorithms correlates with information-theoretic limits of quantum feedback control.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Interior Point Methods for Structured Quantum Relative Entropy Optimization Problems [6.281229317487581]
  We show how structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy optimization problems.<n>Our numerical results show that these techniques improve computation times by up to several orders of magnitude, and allow previously intractable problems to be solved.
  arXiv  Detail & Related papers  (2024-06-28T21:37:45Z)
• Efficient Gradient Estimation of Variational Quantum Circuits with Lie Algebraic Symmetries [16.4882269584049]
  We develop an efficient framework that makes the Hadamard test efficiently applicable to gradient estimation for a broad range of quantum systems. This is an exponential reduction in the measurement cost and up in time compared to existing works.
  arXiv  Detail & Related papers  (2024-04-07T23:34:51Z)
• Adiabatic Bottlenecks in Quantum Annealing and Nonequilibrium Dynamics of Paramagnons [0.0]
  Correspondence between long-range interacting quantum spin glasses and optimization problems underpins the physical motivation for adiabatic quantum computing. In disordered (quantum) spin systems, the focus is on exact methods such as the replica trick that allow the calculation of system quantities in the limit of infinite system and ensemble size. Here, we apply the nonequilibrium Green-function formalism to the spin coherent-state path integral to obtain the statistical fluctuations and the collective-excitation spectrum.
  arXiv  Detail & Related papers  (2024-03-18T07:59:46Z)
• Boundary Treatment for Variational Quantum Simulations of Partial Differential Equations on Quantum Computers [1.6318838452579472]
  The paper presents a variational quantum algorithm to solve initial-boundary value problems described by partial differential equations. The approach uses classical/quantum hardware that is well suited for quantum computers of the current noisy intermediate-scale quantum era.
  arXiv  Detail & Related papers  (2024-02-28T18:19:33Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz [0.4881924950569191]
  We study a family of quantum circuits called the Hamiltonian Variational Ansatz (HVA) HVA exhibits favorable structural properties such as mild or entirely absent barren plateaus and a restricted state space. HVA can find accurate approximations to the ground states of a modified Haldane-Shastry Hamiltonian on a ring.
  arXiv  Detail & Related papers  (2020-08-07T01:28:26Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.