Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2012.05476 · Physical Review Research

Topological and geometric patterns in optimal bang-bang protocols for variational quantum algorithms: Application to the XXZ model on the square lattice

Matthew T. Scoggins, Armin Rahmani

Published Dec 8, 2021• 0 citations
arXivHTMLPDF

Abstract

In this paper, we address the challenge of uncovering patterns in variational optimal protocols for taking the system to ground states of many-body Hamiltonians, using variational quantum algorithms. We develop highly optimized classical Monte Carlo (MC) algorithms to find the optimal protocols for transformations between the ground states of the square-lattice $XXZ$ model for finite system sizes. The MC method obtains optimal bang-bang protocols, as predicted by Pontryagin's minimum principle. We identify the minimum time needed for reaching an acceptable error for different system sizes as a function of the initial and target states and uncover correlations between the total time and the wave-function overlap. We determine a dynamical phase diagram for the optimal protocols, with different phases characterized by a topological number, namely, the number of on pulses. Bifurcation transitions as a function of initial and final states, associated with new jumps in the optimal protocols, demarcate these different phases. The number of pulses correlates with the total evolution time. In addition to identifying the topological characteristic above, i.e., the number of pulses, we introduce a correlation function to characterize bang-bang protocols' quantitative geometric similarities. We find that protocols within one phase are indeed geometrically correlated. Identifying and extrapolating patterns in these protocols may inform efficient large-scale simulations on quantum devices.

DOI
10.1103/physrevresearch.3.043165

Related papers

Optimal control of superconducting gmon qubits using Pontryagin's minimum principle: Preparing a maximally entangled state with singular bang-bang protocols

Seraph L. Bao, Silken Kleer, Ruoyu Wang +1 more

We apply the theory of optimal control to the dynamics of two ``gmon'' qubits, with the goal of preparing a desired entangled ground state from an initial unentangled one. Given an initial state, a target state, and a Hamiltonian with a set of permissible controls, can we reach the target state with coherent quantum evolution, and, in that case, what is the minimum time required? The adiabatic theorem provides a far from optimal solution in the presence of a spectral gap. Optimal control yields the fastest possible way of reaching the target state and helps identify unreachable states. In the context of a simple quantum system, we provide examples of both reachable and unreachable target ground states, and show that the unreachability is due to a symmetry. We find the optimal protocol in the reachable case using three different approaches: (i) a brute-force numerical minimization, (ii) an efficient numerical minimization using the bang-bang ansatz expected from the Pontryagin minimum principle, and (iii) direct solution of the Pontryagin boundary value problem, which yields an analytical understanding of the numerically obtained optimal protocols. Interestingly, our system provides an example of singular control, where the Pontryagin theorem does not guarantee bang-bang protocols. Nevertheless, all three approaches give the same bang-bang protocol.

arXiv:1704.01423•Physical Review A•Jun 27, 2018•41 citations

Bang-bang preparation of quantum many-body ground states in two dimensions: Optimization of the algorithm with a two-dimensional tensor network

Yintai Zhang, Jacek Dziarmaga

A bang-bang (BB) algorithm prepares the ground state of a two-dimensional (2D) quantum many-body Hamiltonian $H={H}_{1}+{H}_{2}$ by evolving an initial product state alternating between ${H}_{1}$ and ${H}_{2}$. We use the neighborhood tensor update to simulate the BB evolution with an infinite pair-entangled projected state (iPEPS). The alternating sequence is optimized with the final energy as a cost function. The energy is calculated with a tangent space power method for the sake of its stability. The method is benchmarked in the 2D transverse field quantum Ising model near its quantum critical point against a ground state obtained with variational optimization of the iPEPS. The optimal BB sequence differs nonperturbatively from a sequence simulating quantum annealing or adiabatic preparation (AP) of the ground state. The optimal BB energy converges with the number of bangs much faster than the optimal AP energy.

arXiv:2401.09158•Physical review. B./Physical review. B•Jun 11, 2024•6 citations

Bang-bang algorithms for quantum many-body ground states: A tensor network exploration

Ruoshui Wang, Timothy H. Hsieh, Guifré Vidal

We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H={H}_{A}+{H}_{B}$ in infinite systems. The first algorithm is a generalization of the quantum approximate optimization algorithm and uses a quantum computer to evolve an initial product state into an approximation of the ground state of $H$ by alternating between ${H}_{A}$ and ${H}_{B}$. We show for the one-dimensional (1D) quantum Ising model that the accuracy in representing a gapped ground state improves exponentially with the number of alternations. The second algorithm is the variational imaginary time ansatz, which uses a classical computer to simulate the ground state via alternating imaginary time steps with ${H}_{A}$ and ${H}_{B}$. We find for the 1D quantum Ising model that an accurate approximation to the ground state is obtained with a total imaginary time $\ensuremath{\tau}$ that grows only logarithmically with the inverse energy gap $1/\mathrm{\ensuremath{\Delta}}$ of $H$. This is much faster than imaginary time evolution by $H$, which would require $\ensuremath{\tau}\ensuremath{\sim}1/\mathrm{\ensuremath{\Delta}}$.

arXiv:2208.00271•Physical review. B./Physical review. B•Nov 17, 2022•5 citations

Optimal preparation of the W state for qubits with XY coupling

Dalton W. Jones, Armin Rahmani

Abstract Using simulated annealing, we find optimal protocols that evolve a simple product state into a three-qubit W state with a Hamiltonian that describes XY coupling and single-qubit gates, and determine the associated quantum speed limit. Applying Pontryagin's minimum principle, we fully characterize the optimal “bang-bang” protocols. While leakage affects performance, the protocols remain robust to implementation errors and operate well within relaxation and decoherence times. Our findings highlight Pontryagin's principle as a powerful tool for designing pulse shapes that directly link device interactions to specific quantum gates and target states.

arXiv:1909.09289•Europhysics Letters (EPL)•Apr 7, 2026•3 citations

Ultrafast critical ground state preparation via bang–bang protocols

Luca Innocenti, Gabriele De Chiara, Mauro Paternostro +1 more

Abstract The fast and faithful preparation of the ground state of quantum systems is a challenging but crucial task for several applications in the realm of quantum-based technologies. Decoherence limits the maximum time-window allowed to an experiment to faithfully achieve such desired states. This is of particular significance in systems featuring a quantum phase transition, where the vanishing energy gap challenges an adiabatic ground state preparation. We show that a bang–bang protocol, consisting of a time evolution under two different values of an externally tunable parameter, allows for a high-fidelity ground state preparation in evolution times no longer than those required by the application of standard optimal control techniques, such as the chopped-random basis quantum optimization. In addition, owing to their reduced number of variables, such bang–bang protocols are very well suited to optimization tasks, reducing the high computational cost of other optimal control protocols. We benchmark the performance of such approach through two paradigmatic models, namely the Landau–Zener and the Lipkin–Meshkov–Glick model. Remarkably, we find that the critical ground state of the latter model, i.e. its ground state at the critical point, can be prepared with a high fidelity in a total evolution time that scales slower than the inverse of the vanishing energy gap.

arXiv:2007.07381•New Journal of Physics•Aug 24, 2020•16 citations

Quantum Approximate Optimization Algorithm and Variational Quantum Computing: from binary neural networks to ground state preparation

Pietro Torta

In this thesis, I explore the domain of hybrid quantum-classical computation, the foremost approach for utilizing Noisy Intermediate-Scale Quantum (NISQ) devices. The opening chapter presents an overview of Variational Quantum Algorithms (VQAs), highlighting the primary algorithmic challenges. It offers an in-depth review of the Quantum Approximate Optimization Algorithm (QAOA), discussing its variants for ground state preparation. In the second chapter, we apply QAOA for the supervised learning of a simple Binary Neural Network. This model represents an idealized yet prototypical example of classical combinatorial optimization problems involving multi-spin interactions. In the following chapters, the discussion shifts toward quantum many-body ground state preparation, focusing on the one-dimensional Heisenberg XYZ model and the longitudinal-transverse-field Ising model (LTFIM). We have developed a novel technique that, at any point in the phase diagram, leverages the transferability of a specific class of optimal schedules from systems with small to those with larger numbers of qubits. This approach mitigates trainability issues, specifically vanishing gradients (Barren Plateaus). Next, we tailor a QAOA scheme to characterize a topological quantum phase transition within a lattice gauge theory model. This investigation is particularly significant due to its implications for high-energy physics and relevance to quantum error correction and surface codes. In the concluding chapter, I propose new stimulating research directions and help to identify core challenges and unresolved questions in variational quantum computing that transcend any particular application domain.

•Apr 9, 2024•0 citations
In this paper, we address the challenge of uncovering patterns in variational optimal protocols for taking the system to ground states of many-body Hamiltonians, using variational quantum algorithms. We develop highly optimized classical Monte Carlo (MC) algorithms to find the optimal protocols for transformations between the ground states of the square-lattice XXZXXZXXZ model for finite system sizes. The MC method obtains optimal bang-bang protocols, as predicted by Pontryagin's minimum principle. We identify the minimum time needed for reaching an acceptable error for different system sizes as a function of the initial and target states and uncover correlations between the total time and the wave-function overlap. We determine a dynamical phase diagram for the optimal protocols, with different phases characterized by a topological number, namely, the number of on pulses. Bifurcation transitions as a function of initial and final states, associated with new jumps in the optimal protocols, demarcate these different phases. The number of pulses correlates with the total evolution time. In addition to identifying the topological characteristic above, i.e., the number of pulses, we introduce a correlation function to characterize bang-bang protocols' quantitative geometric similarities. We find that protocols within one phase are indeed geometrically correlated. Identifying and extrapolating patterns in these protocols may inform efficient large-scale simulations on quantum devices.
We apply the theory of optimal control to the dynamics of two ``gmon'' qubits, with the goal of preparing a desired entangled ground state from an initial unentangled one. Given an initial state, a target state, and a Hamiltonian with a set of permissible controls, can we reach the target state with coherent quantum evolution, and, in that case, what is the minimum time required? The adiabatic theorem provides a far from optimal solution in the presence of a spectral gap. Optimal control yields the fastest possible way of reaching the target state and helps identify unreachable states. In the context of a simple quantum system, we provide examples of both reachable and unreachable target ground states, and show that the unreachability is due to a symmetry. We find the optimal protocol in the reachable case using three different approaches: (i) a brute-force numerical minimization, (ii) an efficient numerical minimization using the bang-bang ansatz expected from the Pontryagin minimum principle, and (iii) direct solution of the Pontryagin boundary value problem, which yields an analytical understanding of the numerically obtained optimal protocols. Interestingly, our system provides an example of singular control, where the Pontryagin theorem does not guarantee bang-bang protocols. Nevertheless, all three approaches give the same bang-bang protocol.
A bang-bang (BB) algorithm prepares the ground state of a two-dimensional (2D) quantum many-body Hamiltonian H=H1+H2H={H}_{1}+{H}_{2}H=H1​+H2​ by evolving an initial product state alternating between H1{H}_{1}H1​ and H2{H}_{2}H2​. We use the neighborhood tensor update to simulate the BB evolution with an infinite pair-entangled projected state (iPEPS). The alternating sequence is optimized with the final energy as a cost function. The energy is calculated with a tangent space power method for the sake of its stability. The method is benchmarked in the 2D transverse field quantum Ising model near its quantum critical point against a ground state obtained with variational optimization of the iPEPS. The optimal BB sequence differs nonperturbatively from a sequence simulating quantum annealing or adiabatic preparation (AP) of the ground state. The optimal BB energy converges with the number of bangs much faster than the optimal AP energy.
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian H=HA+HBH={H}_{A}+{H}_{B}H=HA​+HB​ in infinite systems. The first algorithm is a generalization of the quantum approximate optimization algorithm and uses a quantum computer to evolve an initial product state into an approximation of the ground state of HHH by alternating between HA{H}_{A}HA​ and HB{H}_{B}HB​. We show for the one-dimensional (1D) quantum Ising model that the accuracy in representing a gapped ground state improves exponentially with the number of alternations. The second algorithm is the variational imaginary time ansatz, which uses a classical computer to simulate the ground state via alternating imaginary time steps with HA{H}_{A}HA​ and HB{H}_{B}HB​. We find for the 1D quantum Ising model that an accurate approximation to the ground state is obtained with a total imaginary time $\ensuremath{\tau}$ that grows only logarithmically with the inverse energy gap $1/\mathrm{\ensuremath{\Delta}}$ of HHH. This is much faster than imaginary time evolution by HHH, which would require $\ensuremath{\tau}\ensuremath{\sim}1/\mathrm{\ensuremath{\Delta}}$.
Abstract Using simulated annealing, we find optimal protocols that evolve a simple product state into a three-qubit W state with a Hamiltonian that describes XY coupling and single-qubit gates, and determine the associated quantum speed limit. Applying Pontryagin's minimum principle, we fully characterize the optimal “bang-bang” protocols. While leakage affects performance, the protocols remain robust to implementation errors and operate well within relaxation and decoherence times. Our findings highlight Pontryagin's principle as a powerful tool for designing pulse shapes that directly link device interactions to specific quantum gates and target states.
Abstract The fast and faithful preparation of the ground state of quantum systems is a challenging but crucial task for several applications in the realm of quantum-based technologies. Decoherence limits the maximum time-window allowed to an experiment to faithfully achieve such desired states. This is of particular significance in systems featuring a quantum phase transition, where the vanishing energy gap challenges an adiabatic ground state preparation. We show that a bang–bang protocol, consisting of a time evolution under two different values of an externally tunable parameter, allows for a high-fidelity ground state preparation in evolution times no longer than those required by the application of standard optimal control techniques, such as the chopped-random basis quantum optimization. In addition, owing to their reduced number of variables, such bang–bang protocols are very well suited to optimization tasks, reducing the high computational cost of other optimal control protocols. We benchmark the performance of such approach through two paradigmatic models, namely the Landau–Zener and the Lipkin–Meshkov–Glick model. Remarkably, we find that the critical ground state of the latter model, i.e. its ground state at the critical point, can be prepared with a high fidelity in a total evolution time that scales slower than the inverse of the vanishing energy gap.
In this thesis, I explore the domain of hybrid quantum-classical computation, the foremost approach for utilizing Noisy Intermediate-Scale Quantum (NISQ) devices. The opening chapter presents an overview of Variational Quantum Algorithms (VQAs), highlighting the primary algorithmic challenges. It offers an in-depth review of the Quantum Approximate Optimization Algorithm (QAOA), discussing its variants for ground state preparation. In the second chapter, we apply QAOA for the supervised learning of a simple Binary Neural Network. This model represents an idealized yet prototypical example of classical combinatorial optimization problems involving multi-spin interactions. In the following chapters, the discussion shifts toward quantum many-body ground state preparation, focusing on the one-dimensional Heisenberg XYZ model and the longitudinal-transverse-field Ising model (LTFIM). We have developed a novel technique that, at any point in the phase diagram, leverages the transferability of a specific class of optimal schedules from systems with small to those with larger numbers of qubits. This approach mitigates trainability issues, specifically vanishing gradients (Barren Plateaus). Next, we tailor a QAOA scheme to characterize a topological quantum phase transition within a lattice gauge theory model. This investigation is particularly significant due to its implications for high-energy physics and relevance to quantum error correction and surface codes. In the concluding chapter, I propose new stimulating research directions and help to identify core challenges and unresolved questions in variational quantum computing that transcend any particular application domain.