MPS-JuliQAOA: User-Friendly, Scalable MPS-Based Simulation for Quantum Optimization

We present MPS-JuliQAOA, an open-source, Julianative framework for simulating the Quantum Approximate Optimization Algorithm (QAOA) using Matrix Product States (MPS). The tool supports general cost Hamiltonians that are diagonal in the computational basis and integrates tensornetwork simulation with automatic differentiation for parameter optimization within a unified workflow. Built on the ITensor ecosystem, MPS-JuliQAOA replaces exact statevector simulation with an MPS backend, enabling QAOA simulations beyond the practical limits of full statevector methods when entanglement growth remains controlled. We demonstrate simulations of up to 512 qubits and 20 QAOA layers on 3-regular Max-Cut instances, and analyze runtime scaling and approximation accuracy as functions of bond dimension and circuit depth. The framework abstracts tensor-network and differentiation details from the user, allowing high-level Hamiltonian specification without requiring expertise in MPS methods. Source code is publicly available at https://github.com/lanl/JuliQAOA.jl/tree/mps.

Authors

Institutions

Publication Details

Published
2026-04-06
DOI
https://doi.org/10.1109/qcnc69040.2026.00094
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MPS-JuliQAOA: User-Friendly, Scalable MPS-Based Simulation for Quantum Optimization

Reuben Tate, John Golden, Stephan Eidenbenz, Sean Feeney
Quantum Computing Algorithms and Architecture
article

MPS-JuliQAOA: User-Friendly, Scalable MPS-Based Simulation for Quantum Optimization

Reuben Tate, John Golden, Stephan Eidenbenz, Sean Feeney
article en

Abstract

We present MPS-JuliQAOA, an open-source, Julianative framework for simulating the Quantum Approximate Optimization Algorithm (QAOA) using Matrix Product States (MPS). The tool supports general cost Hamiltonians that are diagonal in the computational basis and integrates tensornetwork simulation with automatic differentiation for parameter optimization within a unified workflow. Built on the ITensor ecosystem, MPS-JuliQAOA replaces exact statevector simulation with an MPS backend, enabling QAOA simulations beyond the practical limits of full statevector methods when entanglement growth remains controlled. We demonstrate simulations of up to 512 qubits and 20 QAOA layers on 3-regular Max-Cut instances, and analyze runtime scaling and approximation accuracy as functions of bond dimension and circuit depth. The framework abstracts tensor-network and differentiation details from the user, allowing high-level Hamiltonian specification without requiring expertise in MPS methods. Source code is publicly available at https://github.com/lanl/JuliQAOA.jl/tree/mps.

Los Alamos National Laboratory (US)
Openalex Percentile: Top 99%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.