Universal Resources for QAOA and Quantum Annealing

• URL: http://arxiv.org/abs/2506.03241v1
• Date: Tue, 03 Jun 2025 18:00:00 GMT
• Title: Universal Resources for QAOA and Quantum Annealing
• Authors: Pablo Díez-Valle, Fernando J. Gómez-Ruiz, Diego Porras, Juan José García-Ripoll,
• Abstract summary: We show the angles of a multilayer QAOA circuit converge to universal QA trajectories.<n>Errors in both QAOA circuits and QA paths act as thermal excitations in pseudo-Boltzmann probability distributions.
• Score: 41.94295877935867
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Quantum Approximate Optimization Algorithm (QAOA) is a variational ansatz that resembles the Trotterized dynamics of a Quantum Annealing (QA) protocol. This work formalizes this connection formally and empirically, showing the angles of a multilayer QAOA circuit converge to universal QA trajectories. Furthermore, the errors in both QAOA circuits and QA paths act as thermal excitations in pseudo-Boltzmann probability distributions whose temperature decreases with the invested resource -- i.e. integrated angles or total time -- and which in QAOA also contain a higher temperature arising from the Trotterization. This also means QAOA and QA are cooling protocols and simulators of partition functions whose target temperature can be tuned by rescaling the universal trajectory. The average cooling power of both methods exhibits favorable algebraic scalings with respect to the target temperature and problem size, whereby in QAOA the coldest temperature is inversely proportional to the number of layers, $T\sim 1/p$, and to the integrated angles -- or integrated interactions in QA.

Related papers

• Equivalence of Quantum Approximate Optimization Algorithm and Linear-Time Quantum Annealing for the Sherrington-Kirkpatrick Model [2.0174252910776556]
  We show that QAOA energy approximates that of quantum annealing under two conditions, namely that angles vary smoothly from one layer to the next and that the sum is bounded by a constant.<n>Our results are enabled by novel formulae for QAOA energy with constant sum of angles and arbitrary depth and the series expansion of energy in sum of angles.
  arXiv  Detail & Related papers  (2025-03-12T17:27:40Z)
• Bayesian estimation for collisional thermometry and time-optimal holonomic quantum computation [0.0]
  In the first half we investigate how the Bayesian formalism can be introduced into the problem of quantum thermometry. In the last part of the thesis we approach the problem of non-adiabatic holonomic computation.
  arXiv  Detail & Related papers  (2023-07-16T17:46:13Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• R\'enyi entropy of quantum anharmonic chain at non-zero temperature [0.0]
  We show that the R'enyi entropy is a precious tool to characterize the phase diagram of critical systems. For an efficient evaluation of the R'enyi entropy, we introduce a new algorithm based on a path integral Langevin dynamics.
  arXiv  Detail & Related papers  (2023-03-08T18:06:49Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Exploring the neighborhood of 1-layer QAOA with Instantaneous Quantum Polynomial circuits [0.0]
  We embed 1-layer QAOA circuits into the larger class of parameterized Instantaneous Quantum Polynomial circuits. The use of analytic expressions to find optimal parameters makes our protocol robust against barren plateaus and hardware noise. Our protocol outperforms 1-layer QAOA on the recently released Quantinuum H2 trapped-ion quantum hardware and emulator.
  arXiv  Detail & Related papers  (2022-10-11T15:16:44Z)
• General Hamiltonian Representation of ML Detection Relying on the Quantum Approximate Optimization Algorithm [74.6114458993128]
  The quantum approximate optimization algorithm (QAOA) conceived for solving optimization problems can be run on the existing noisy intermediate-scale quantum (NISQ) devices. We solve the maximum likelihood (ML) detection problem for general constellations by appropriately adapting the QAOA. In particular, for an M-ary Gray-mapped quadrature amplitude modulation (MQAM) constellation, we show that the specific qubits encoding the in-phase components and those encoding the quadrature components are independent in the quantum system of interest.
  arXiv  Detail & Related papers  (2022-04-11T14:11:24Z)
• Shortcuts to Quantum Approximate Optimization Algorithm [2.150418646956503]
  We propose a new ansatz dubbed as "Shortcuts to QAOA" (S-QAOA) S-QAOA provides shortcuts to the ground state of target Hamiltonian by including more two-body interactions and releasing the parameter freedoms. Considering the MaxCut problem and Sherrington-Kirkpatrick (SK) model, numerically shows the YY interaction has the best performance.
  arXiv  Detail & Related papers  (2021-12-21T02:24:19Z)
• Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries [2.517903855792476]
  We introduce an application-specific approach for mitigating the errors in QAOA evolution by leveraging the symmetries present in the classical objective function to be optimized. Specifically, the QAOA state is projected into the symmetry-restricted subspace, with projection being performed either at the end of the circuit or throughout the evolution. Our approach improves the fidelity of the QAOA state, thereby increasing both the accuracy of the sample estimate of the QAOA objective and the probability of sampling the binary string corresponding to that objective value.
  arXiv  Detail & Related papers  (2021-06-08T14:40:48Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

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.