Photonic counterdiabatic quantum optimization algorithm
arXiv:2307.14853 · doi:10.1038/s42005-024-01807-2
Abstract
We propose a hybrid quantum-classical approximate optimization algorithm for photonic quantum computing, specifically tailored for addressing continuous-variable optimization problems. Inspired by counterdiabatic protocols, our algorithm significantly reduces the required quantum operations for optimization as compared to adiabatic protocols. This reduction enables us to tackle non-convex continuous optimization and countably infinite integer programming within the near-term era of quantum computing. Through comprehensive benchmarking, we demonstrate that our approach outperforms existing state-of-the-art hybrid adiabatic quantum algorithms in terms of convergence and implementability. Remarkably, our algorithm offers a practical and accessible experimental realization, bypassing the need for high-order operations and overcoming experimental constraints. We conduct proof-of-principle experiments on an eight-mode nanophotonic quantum chip, successfully showcasing the feasibility and potential impact of the algorithm.
References in corpus (38)
- Quantum Computing in the NISQ era and beyond
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Encoding a qubit in an oscillator
- Quantum computation over continuous variables
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Shortcuts to adiabaticity
- Quantum circuits with many photons on a programmable nanophotonic chip
- Shortcuts to adiabaticity by counter-diabatic driving
- Robust determination of molecular spectra on a quantum processor
- Efficient Classical Simulation of Continuous Variable Quantum Information Processes
- Continuous-variable quantum neural networks
- A Review on Quantum Approximate Optimization Algorithm and its Variants
- Lewis-Riesenfeld invariants and transitionless tracking algorithm
- Strawberry Fields: A Software Platform for Photonic Quantum Computing
- Minimizing irreversible losses in quantum systems by local counter-diabatic driving
- Improving Variational Quantum Optimization using CVaR
- Floquet-engineering counterdiabatic protocols in quantum many-body systems
- Strategies for solving the Fermi-Hubbard model on near-term quantum computers
- Resource-Efficient Quantum Algorithm for Protein Folding
- Towards Scalable Bosonic Quantum Error Correction
- Machine learning method for state preparation and gate synthesis on photonic quantum computers
- Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
- Digitized-counterdiabatic quantum approximate optimization algorithm
- Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
- Scaling of variational quantum circuit depth for condensed matter systems
- Continuous-Variable Instantaneous Quantum Computing is hard to sample
- Portfolio Optimization with Digitized-Counterdiabatic Quantum Algorithms
- Digitized-Counterdiabatic Quantum Optimization
- Quantum Imaginary Time Evolution Algorithm for Quantum Field Theories with Continuous Variables
- High-efficiency and fast photon-number resolving parallel superconducting nanowire single-photon detector
- Exact gate decompositions for photonic quantum computing
- Optimizing Counterdiabaticity by Variational Quantum Circuits
- Continuous-variable quantum approximate optimization on a programmable photonic quantum processor
- Evidence that PUBO outperforms QUBO when solving continuous optimization problems with the QAOA
- Mixed-Integer Programming Using a Bosonic Quantum Computer
- Variational quantum simulation using non-Gaussian continuous-variable systems