Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
arXiv:2301.06846 · doi:10.22331/q-2024-02-13-1253
Abstract
We propose a new design heuristic to tackle combinatorial optimisation problems, inspired by Hamiltonians for optimal state-transfer. The result is a rapid approximate optimisation algorithm. We provide numerical evidence of the success of this new design heuristic. We find this approach results in a better approximation ratio than the Quantum Approximate Optimisation Algorithm at lowest depth for the majority of problem instances considered, while utilising comparable resources. This opens the door to investigating new approaches for tackling combinatorial optimisation problems, distinct from adiabatic-influenced approaches.
arXiv comment37 pages, 25 figures, 2 tables
References in corpus (47)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Quantum Annealing in the Transverse Ising Model
- QuTiP 2: A Python framework for the dynamics of open quantum systems
- QuTiP: An open-source Python framework for the dynamics of open quantum systems
- Adiabatic Quantum Computing
- Shortcuts to adiabaticity: concepts, methods, and applications
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Quantum Computation as Geometry
- Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
- Perspectives of quantum annealing: Methods and implementations
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
- Quantum Brachistochrone
- Improving Variational Quantum Optimization using CVaR
- Consistency of the Adiabatic Theorem
- Quantum Speedup by Quantum Annealing
- Singular extremals for the time-optimal control of dissipative spin 1/2 particles
- Quantum Adiabatic Brachistochrone
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Time Optimal Unitary Operations
- Optimal Protocols in Quantum Annealing and QAOA Problems
- Quantum brachistochrone curves as geodesics: obtaining accurate control protocols for time-optimal quantum gates
- Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search
- Speeding up and slowing down the relaxation of a qubit by optimal control
- Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
- Domain wall encoding of discrete variables for quantum annealing and QAOA
- On optimum Hamiltonians for state transformations
- Zermelo Navigation and a Speed Limit to Quantum Information Processing
- Solution to the quantum Zermelo navigation problem
- Time-optimal navigation through quantum wind
- Tightening the Lieb-Robinson Bound in Locally-Interacting Systems
- Zermelo Navigation in the Quantum Brachistochrone
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Finding spin-glass ground states using quantum walks
- An energetic perspective on rapid quenches in quantum annealing
- Schedule path optimization for quantum annealing and adiabatic quantum computing
- Optimal Control for Closed and Open System Quantum Optimization
- Product Formulas for Exponentials of Commutators
- Greedy parameter optimization for diabatic quantum annealing
- Binary Control Pulse Optimization for Quantum Systems
- How to Compute Using Quantum Walks
- Locally Suppressed Transverse-Field Protocol for Diabatic Quantum Annealing
- Quantum adiabatic brachistochrone for open systems
- A general formulation of time-optimal quantum control and optimality of singular protocols