Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization
arXiv:2308.15475 · doi:10.1103/PhysRevApplied.22.054037
Abstract
We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm in the impulse regime, that is, where the counterdiabatic terms are dominant. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We apply this protocol to a real-case scenario of portfolio optimization with 20 assets, using purely quantum and hybrid classical-quantum paradigms. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer. By benchmarking our method against the standard quantum approximate optimization algorithm and finite-time digitized-adiabatic algorithms, we obtain a significant reduction in the circuit depth by factors of 2.5 to 40, while minimizing the dependence on the classical optimization subroutine. Besides portfolio optimization, the proposed method is applicable to a large class of combinatorial optimization problems.
arXiv comment10 pages, 5 figures
References in corpus (30)
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum computational chemistry
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Quantum computing for finance: overview and prospects
- Shortcuts to adiabaticity by counter-diabatic driving
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Quantum computing for finance
- Warm-starting quantum optimization
- Minimizing irreversible losses in quantum systems by local counter-diabatic driving
- The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
- Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
- Floquet-engineering counterdiabatic protocols in quantum many-body systems
- Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
- Digitized-counterdiabatic quantum approximate optimization algorithm
- Counterdiabaticity and the quantum approximate optimization algorithm
- Benchmarking the performance of portfolio optimization with QAOA
- Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
- Counterdiabatic Optimised Local Driving
- Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
- Tequila: A platform for rapid development of quantum algorithms
- Controlling and exploring quantum systems by algebraic expression of adiabatic gauge potential
- Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
- Shortcuts to Adiabaticity in Krylov Space
- Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
- Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
- Self-healing of Trotter error in digital adiabatic state preparation
- Efficient Product Formulas for Commutators and Applications to Quantum Simulation
- Variational counterdiabatic driving of the Hubbard model for ground-state preparation
- Convergence of Digitized-Counterdiabatic QAOA: circuit depth versus free parameters
Cited by in corpus (5)
- Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling
- Counterdiabatic ADAPT-VQE for molecular simulation
- Symmetry-enhanced Counterdiabatic Quantum Algorithm for Qudits
- Quantum circuit evolutionary framework applied on set partitioning problem
- Quantum coherence and counterdiabatic quantum computing