MPS-JuliQAOA: User-friendly, Scalable MPS-based Simulation for Quantum Optimization

August 07, 2025 Β· Declared Dead Β· πŸ› arXiv.org

πŸ’€ CAUSE OF DEATH: 404 Not Found
Code link is broken/dead
Authors Sean Feeney, Reuben Tate, John Golden, Stephan Eidenbenz arXiv ID 2508.05883 Category quant-ph: Quantum Computing Cross-listed cs.ET, cs.SE Citations 1 Venue arXiv.org Repository https://github.com/lanl/JuliQAOA.jl/tree/mps Last Checked 2 months ago
Abstract
We present the MPS-JuliQAOA simulator, a user-friendly, open-source tool to simulate the Quantum Approximate Optimization Algorithm (QAOA) of any optimization problem that can be expressed as diagonal Hamiltonian. By leveraging Julia-language constructs and the ITensor package to implement a Matrix Product State (MPS) approach to simulating QAOA, MPS-Juli-QAOA effortlessly scales to 512 qubits and 20 simulation rounds on the standard de-facto benchmark 3-regular MaxCut QAOA problem. MPS-JuliQAOA also has built-in parameter finding capabilities, which is a crucial performance aspect of QAOA. We illustrate through examples that the user does not need to know MPS principles or complex automatic differentiation techniques to use MPS-JuliQAOA. We study the scalability of our tool with respect to runtime, memory usage and accuracy tradeoffs. Code available at https://github.com/lanl/JuliQAOA.jl/tree/mps.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

R.I.P. πŸ‘» Ghosted

Variational Quantum Algorithms

M. Cerezo, Andrew Arrasmith, ... (+9 more)

quant-ph πŸ› Nature Reviews Physics πŸ“š 3.3K cites 5 years ago

Died the same way β€” πŸ’€ 404 Not Found