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

Abstract

In this work, 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 systems 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.

arXiv comment14 pages, 13 figures

References in corpus (51)

• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum Simulation
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Control of quantum phenomena: Past, present, and future
• Scalable Quantum Simulation of Molecular Energies
• Towards Practical Quantum Variational Algorithms
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Fast optimal frictionless atom cooling in harmonic traps
• Shortcuts to adiabaticity
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Qubit architecture with high coherence and fast tunable coupling
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Quantum Natural Gradient
• Robust determination of molecular spectra on a quantum processor
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Observation of Entangled States of a Fully Controlled 20-Qubit System
• Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
• From transistor to trapped-ion computers for quantum chemistry
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• Adiabatic Quantum Simulation of Quantum Chemistry
• Quantum versus Classical Annealing of Ising Spin Glasses
• $XY$-mixers: analytical and numerical results for QAOA
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Sequential minimal optimization for quantum-classical hybrid algorithms
• Quantum Adiabatic Brachistochrone
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
• Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Anti-Kibble-Zurek Behavior in Crossing the Quantum Critical Point of a Thermally Isolated System Driven by a Noisy Control Field
• Training A Quantum Optimizer
• Fast closed-loop optimal control of ultracold atoms in an optical lattice
• Adiabatic Quantum Simulators
• Exploring Interacting Quantum Many-Body Systems by Experimentally Creating Continuous Matrix Product States in Superconducting Circuits
• Optimal control of superconducting gmon qubits using Pontryagin's minimum principle: preparing a maximally entangled state with singular bang-bang protocols
• Optimal control for unitary preparation of many-body states: application to Luttinger liquids
• Heavy tails in the distribution of time-to-solution for classical and quantum annealing
• Cooling through optimal control of quantum evolution
• Policy Gradient based Quantum Approximate Optimization Algorithm
• Stochastic optimization of a cold atom experiment using a genetic algorithm
• Operator Sampling for Shot-frugal Optimization in Variational Algorithms
• Resonant shortcuts for adiabatic rapid passage with only $z$-field control
• Optimal diabatic dynamics of Majorana-based quantum gates
• Speeding up adiabatic passage with an optimal modified Roland-Cerf protocol
• Optimal noise-canceling shortcuts to adiabaticity: application to noisy Majorana-based gates
• Quantum dynamics with an ensemble of Hamiltonians
• Robust and efficient algorithms for high-dimensional black-box quantum optimization
• Gate-free state preparation for fast variational quantum eigensolver simulations: ctrl-VQE
• Optimal preparation of the $W$ state for qubits with XY coupling