Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

Abstract

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters. Parameter transfer is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. We systematically study QAOA parameter transferability from small problems (16, 27 qubits) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool JuliQAOA to perform classical angle finding for up to 49 QAOA layers. Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States, Matrix Product State, and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to unseen problem instances does not in general provide monotonically improving performance as a function of p - there are many cases where the performance temporarily decreases as a function of p - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the 100+ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of fixed QAOA angles on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to p=5 on ibm_fez, p=9 on ibm_torino, and p=10 on ibm_pittsburgh.

References in corpus (50)

• Quantum Computing in the NISQ era and beyond
• Variational Quantum Algorithms
• Efficient classical simulation of slightly entangled quantum computations
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• The ITensor Software Library for Tensor Network Calculations
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Validating quantum computers using randomized model circuits
• Classical simulation of quantum many-body systems with a tree tensor network
• Efficient Z-Gates for Quantum Computing
• Accurate determination of tensor network state of quantum lattice models in two dimensions
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• A simple all-microwave entangling gate for fixed-frequency superconducting qubits
• Characterizing Quantum Gates via Randomized Benchmarking
• Simulation of two dimensional quantum systems on an infinite lattice revisited: corner transfer matrix for tensor contraction
• Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
• The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
• Stripes in the two-dimensional t-J model with infinite projected entangled-pair states
• Topological and subsystem codes on low-degree graphs with flag qubits
• Quantum annealing initialization of the quantum approximate optimization algorithm
• Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Parameter Concentration in Quantum Approximate Optimization
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• A Density Matrix Algorithm for 3D Classical Models
• MAXCUT QAOA performance guarantees for p >1
• Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
• Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
• Efficient tensor network simulation of IBM's largest quantum processors
• Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations
• Statistical analysis of randomized benchmarking
• Expectation Values from the Single-Layer Quantum Approximate Optimization Algorithm on Ising Problems
• Parameter Setting in Quantum Approximate Optimization of Weighted Problems
• Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
• Gauging tensor networks with belief propagation
• Tensor Networks contraction and the Belief Propagation algorithm
• Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems
• Self-healing of Trotter error in digital adiabatic state preparation
• Creating entangled logical qubits in the heavy-hex lattice with topological codes
• Provable bounds for noise-free expectation values computed from noisy samples
• Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement
• Quantum Approximate Multi-Objective Optimization
• Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
• Transfer learning of optimal QAOA parameters in combinatorial optimization
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• A Parameter Setting Heuristic for the Quantum Alternating Operator Ansatz
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice
• Symmetry-informed transferability of optimal parameters in the Quantum Approximate Optimization Algorithm
• Universal Resources for QAOA and Quantum Annealing
• Efficient Online Quantum Circuit Learning with No Upfront Training

Cited by in corpus (1)

• Evidence for effectively constant shot complexity in the quantum approximate optimization algorithm without per-instance optimization