Single-Layer Digitized-Counterdiabatic Quantum Optimization for $p$-spin Models

Abstract

Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers from limited hardware coherence times. In this sense, counterdiabatic quantum protocols provide a shortcut to this process, steering the system along its ground state with fast-changing Hamiltonian. In this work, we take full advantage of a digitized-counterdiabatic quantum optimization (DCQO) algorithm to find an optimal solution of the $p$-spin model up to 4-local interactions. We choose a suitable scheduling function and initial Hamiltonian such that a single-layer quantum circuit suffices to produce a good ground-state overlap. By further optimizing parameters using variational methods, we solve with unit accuracy 2-spin, 3-spin, and 4-spin problems for $100\%$, $93\%$, and $83\%$ of instances, respectively. As a particular case of the latter, we also solve factorization problems involving 5, 9, and 12 qubits. Due to the low computational overhead, our compact approach may become a valuable tool towards quantum advantage in the NISQ era.

References in corpus (15)

• Shortcuts to adiabaticity: concepts, methods, and applications
• Shortcut to adiabatic passage in two and three level atoms
• Spin-Glass Theory for Pedestrians
• Superconducting Quantum Computing: A Review
• Geometry and non-adiabatic response in quantum and classical systems
• Assisted finite-rate adiabatic passage across a quantum critical point: Exact solution for the quantum Ising model
• Minimizing irreversible losses in quantum systems by local counter-diabatic driving
• Floquet-engineering counterdiabatic protocols in quantum many-body systems
• Pretending to factor large numbers on a quantum computer
• The Overlap Gap Property: a Geometric Barrier to Optimizing over Random Structures
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Dynamics of reverse annealing for the fully-connected $p$-spin model
• Portfolio Optimization with Digitized-Counterdiabatic Quantum Algorithms
• Digitized-Counterdiabatic Quantum Optimization

Cited by in corpus (4)

• Digital-Analog Counterdiabatic Quantum Optimization with Trapped Ions
• High-dimensional counterdiabatic quantum computing
• Improving Variational Counterdiabatic Driving with Weighted Actions and Computer Algebra
• Quantum coherence and counterdiabatic quantum computing