Lyapunov control-inspired strategies for quantum combinatorial optimization
arXiv:2108.05945 · doi:10.1103/PhysRevA.106.062414
Abstract
The prospect of using quantum computers to solve combinatorial optimization problems via the quantum approximate optimization algorithm (QAOA) has attracted considerable interest in recent years. However, a key limitation associated with QAOA is the need to classically optimize over a set of quantum circuit parameters. This classical optimization can have significant associated costs and challenges. Here, we provide an expanded description of Lyapunov control-inspired strategies for quantum optimization, as presented in [Magann et al., Phys. Rev. Lett. 129, 250502 (2022)], that do not require any classical optimization effort. Instead, these strategies utilize feedback from qubit measurements to assign values to the quantum circuit parameters in a deterministic manner, such that the combinatorial optimization problem solution improves monotonically with the quantum circuit depth. Numerical analyses are presented that investigate the utility of these strategies towards MaxCut on weighted and unweighted 3-regular graphs, both in ideal implementations and also in the presence of measurement noise. We also discuss how how these strategies compare with QAOA, how they may be used to seed QAOA optimizations in order to improve performance for near-term applications, and explore connections to quantum annealing.
arXiv commentarXiv admin note: text overlap with arXiv:2103.08619
References in corpus (48)
- Quantum Computing in the NISQ era and beyond
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- Barren plateaus in quantum neural network training landscapes
- Control of quantum phenomena: Past, present, and future
- Training Schrödinger's cat: quantum optimal control
- Quantum Annealing and Analog Quantum Computation
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Quantum Search by Local Adiabatic Evolution
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Training variational quantum algorithms is NP-hard
- Quantum feedback control and classical control theory
- A Quantum Algorithm for Finding the Minimum
- Layerwise learning for quantum neural networks
- Warm-starting quantum optimization
- Quantum feedback: theory, experiments, and applications
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- Complete controllability of quantum systems
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
- Efficient quantum measurement of Pauli operators in the presence of finite sampling error
- Quantum Control Landscapes
- Controllability of quantum mechanical systems by root space decomposition of su(N)
- Quantum annealing initialization of the quantum approximate optimization algorithm
- The SLH framework for modeling quantum input-output networks
- Benchmarking the Quantum Approximate Optimization Algorithm
- Quantum query complexity of some graph problems
- Implementation of the XY interaction family with calibration of a single pulse
- From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
- Variational Quantum Unsampling on a Quantum Photonic Processor
- Complete controllability of finite-level quantum systems
- On the Universality of the Quantum Approximate Optimization Algorithm
- Improved success probability with greater circuit depth for the quantum approximate optimization algorithm
- Zero forcing, linear and quantum controllability for systems evolving on networks
- Feedback-based quantum optimization
- Training Saturation in Layerwise Quantum Approximate Optimisation
- Abrupt Transitions in Variational Quantum Circuit Training
- Progress toward favorable landscapes in quantum combinatorial optimization
- Exploring adiabatic quantum trajectories via optimal control
- A Survey of Quantum Lyapunov Control Methods
- Schedule path optimization for quantum annealing and adiabatic quantum computing
- Driven Imposters: Controlling Expectations in Many-Body Systems
- Making Distinct Dynamical Systems Appear Spectrally Identical
- Controlling Arbitrary Observables in Correlated Many-body Systems
- Controlling qubit networks in polynomial time
- Universal Control Induced by Noise
- Drawing together control landscape and tomography principles
Cited by in corpus (15)
- A Review on Quantum Approximate Optimization Algorithm and its Variants
- Feedback-based quantum optimization
- Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
- Randomized adaptive quantum state preparation
- Using a Feedback-Based Quantum Algorithm to Analyze the Critical Properties of the ANNNI Model Without Classical Optimization
- Simulation of a feedback-based algorithm for quantum optimization for a realistic neutral atom system with an optimized small-angle controlled-phase gate
- Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation
- Quantum optimal control in quantum technologies. Strategic report on current status, visions and goals for research in Europe
- Measurement-Based Control for Minimizing Energy Functions in Quantum Systems
- Accelerating Feedback-Based Quantum Algorithms through Time Rescaling
- Constraint-Aware Quantum Optimization via Hamming Weight Operators
- Feedback-Based Quantum Strategies for Constrained Combinatorial Optimization Problems
- Tuning the terahertz response of liquids by creating polar many-body excitations
- Enhancement of superconducting pairing via quantum Lyapunov control
- Feedback-Based Quantum Algorithm for Constrained Optimization Problems