JuliQAOA: Fast, Flexible QAOA Simulation
arXiv:2312.06451 · doi:10.1145/3624062.3624220
Abstract
We introduce JuliQAOA, a simulation package specifically built for the Quantum Alternating Operator Ansatz (QAOA). JuliQAOA does not require a circuit-level description of QAOA problems, or another package to simulate such circuits, instead relying on a more direct linear algebra implementation. This allows for increased QAOA-specific performance improvements, as well as improved flexibility and generality. JuliQAOA is the first QAOA package designed to aid in the study of both constrained and unconstrained combinatorial optimization problems, and can easily include novel cost functions, mixer Hamiltonians, and other variations. JuliQAOA also includes robust and extensible methods for learning optimal angles. Written in the Julia language, JuliQAOA outperforms existing QAOA software packages and scales well to HPC-level resources. JuliQAOA is available at https://github.com/lanl/JuliQAOA.jl.
References in corpus (11)
- A Quantum Approximate Optimization Algorithm
- Warm-starting quantum optimization
- Quantum annealing initialization of the quantum approximate optimization algorithm
- A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
- Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
- Short-Depth Circuits for Dicke State Preparation
- QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA
- Fast Simulation of High-Depth QAOA Circuits
- Performance Evaluation and Acceleration of the QTensor Quantum Circuit Simulator on GPUs
- The Quantum Alternating Operator Ansatz for Satisfiability Problems
- High-Round QAOA for MAX -SAT on Trapped Ion NISQ Devices
Cited by in corpus (6)
- Quantum Approximate Multi-Objective Optimization
- Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
- Trainability Barriers in Low-Depth QAOA Landscapes
- QUBO.jl: A Julia Ecosystem for Quadratic Unconstrained Binary Optimization
- Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems
- Quantum tree generator improves QAOA state-of-the-art for the knapsack problem