Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer

Abstract

Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.

camera-ready version

References in corpus (8)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A Quantum Approximate Optimization Algorithm
• Strong quantum computational advantage using a superconducting quantum processor
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• Wasserstein Solution Quality and the Quantum Approximate Optimization Algorithm: A Portfolio Optimization Case Study
• Characterizing Error Mitigation by Symmetry Verification in QAOA
• On Actual Preparation of Dicke State on a Quantum Computer

Cited by in corpus (33)

• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Quantum computing for finance
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
• Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
• Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
• Constrained Optimization via Quantum Zeno Dynamics
• Quantum Deep Hedging
• Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems
• Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
• Multi-Angle QAOA Does Not Always Need All Its Angles
• Fermionic Quantum Approximate Optimization Algorithm
• Transfer learning of optimal QAOA parameters in combinatorial optimization
• High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management
• Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization
• Quantum Approximate Optimization Algorithm for Test Case Optimization
• Improving Performance in Combinatorial Optimization Problems with Inequality Constraints: An Evaluation of the Unbalanced Penalization Method on D-Wave Advantage
• Exploiting In-Constraint Energy in Constrained Variational Quantum Optimization
• QAOA with $N\cdot p\ge 200$
• NISQ-compatible approximate quantum algorithm for unconstrained and constrained discrete optimization
• Performance of Quantum Approximate Optimization with Quantum Error Detection
• Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era
• Navigating the noise-depth tradeoff in adiabatic quantum circuits
• Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing
• LX-mixers for QAOA: Optimal mixers restricted to subspaces and the stabilizer formalism
• Experimental Demonstration of Fermionic QAOA with One-Dimensional Cyclic Driver Hamiltonian
• The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
• Bounding Entanglement Entropy with Clifford Double Cosets
• Electric Power Demand Portfolio Optimization by Fermionic QAOA with Self-Consistent Local Field Modulation
• Multiclass Portfolio Optimization via Variational Quantum Eigensolver with Dicke State Ansatz
• Q-CHOP: Quantum constrained Hamiltonian optimization
• Variational Quantum Algorithm Landscape Reconstruction by Low-Rank Tensor Completion