Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Low-depth Clifford circuits approximately solve MaxCut

Journal Article · · Physical Review Research

We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. We start by showing that the solution unitaries found by the adaptive quantum approximation optimization algorithm (ADAPT-QAOA) for the MaxCut problem on weighted fully connected graphs are (almost) Clifford circuits. Motivated by this observation, we devise an approximation algorithm for MaxCut, ADAPT-Clifford, that searches through the Clifford manifold by combining a minimal set of generating elements of the Clifford group. Our algorithm finds an approximate solution of MaxCut on an N -vertex graph by building a depth O ( N ) Clifford circuit. The algorithm has runtime complexity O ( N 2 ) and O ( N 3 ) for sparse and dense graphs, respectively, and space complexity O ( N 2 ) , with improved solution quality achieved at the expense of more demanding runtimes. We implement ADAPT-Clifford and characterize its performance on graphs with positive and signed weights. The case of signed weights is illustrated with the paradigmatic Sherrington-Kirkpatrick model, for which our algorithm finds solutions with ground-state mean energy density corresponding to 94 % of the Parisi value in the thermodynamic limit. The case of positive weights is investigated by comparing the cut found by ADAPT-Clifford with the cut found with the Goemans-Williamson (GW) algorithm. For both sparse and dense instances we provide copious evidence that, up to hundreds of nodes, ADAPT-Clifford finds cuts of lower energy than GW.

Published by the American Physical Society 2024
Sponsoring Organization:
USDOE
OSTI ID:
2375894
Journal Information:
Physical Review Research, Journal Name: Physical Review Research Journal Issue: 2 Vol. 6; ISSN 2643-1564; ISSN PPRHAI
Publisher:
American Physical SocietyCopyright Statement
Country of Publication:
United States
Language:
English

References (75)

MAX-CUT has a randomized approximation scheme in dense graphs journal May 1996
Polynomial time approximation of dense weighted instances of MAX-CUT journal January 2000
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree journal May 2023
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems journal February 1999
The Sherrington-Kirkpatrick Model book February 2013
Some rigorous results on the Sherrington-Kirkpatrick spin glass model journal March 1987
Worst-case comparison of valid inequalities for the TSP journal July 1995
A polynomial algorithm for the max-cut problem on graphs without long odd cycles journal May 1984
Broken Replica Symmetry Bounds in the Mean Field Spin Glass Model journal February 2003
Partitioning planar graphs: a fast combinatorial approach for max-cut journal June 2010
The Sherrington-Kirkpatrick Model: An Overview journal September 2012
Weakly bipartite graphs and the Max-cut problem journal October 1981
QuantumOptics.jl: A Julia framework for simulating open quantum systems journal June 2018
MAX CUT in cubic graphs journal November 2004
A review on Quantum Approximate Optimization Algorithm and its variants journal June 2024
Geometry of Quantum States: An Introduction to Quantum Entanglement book August 2017
Variational quantum algorithms journal August 2021
The theory of variational hybrid quantum-classical algorithms journal February 2016
Ground-state energy fluctuations in the Sherrington–Kirkpatrick model journal October 2008
Disordered systems insights on computational hardness journal November 2022
Filtering variational quantum algorithms for combinatorial optimization journal January 2022
Mean-Field Approximate Optimization Algorithm journal September 2023
MaxCut quantum approximate optimization algorithm performance guarantees for p > 1 journal April 2021
Quantum variational optimization: The role of entanglement and problem hardness journal December 2021
Entanglement perspective on the quantum approximate optimization algorithm journal August 2022
Approximate Boltzmann distributions in quantum approximate optimization journal October 2023
Extending relax-and-round combinatorial optimization solvers with quantum correlations journal January 2024
Class of quantum error-correcting codes saturating the quantum Hamming bound journal September 1996
Mixed-state entanglement and quantum error correction journal November 1996
Improved simulation of stabilizer circuits journal November 2004
Quantum Zeno effect and the many-body entanglement transition journal November 2018
Unitary-projective entanglement dynamics journal June 2019
Quantum Computational Advantage with String Order Parameters of One-Dimensional Symmetry-Protected Topological Order journal March 2021
Stabilizer Rényi Entropy journal February 2022
Entanglement Phase Transition with Spin Glass Criticality journal June 2022
Quantum Approximate Optimization Algorithm Pseudo-Boltzmann States journal February 2023
Solvable Model of a Spin-Glass journal December 1975
Infinite Number of Order Parameters for Spin-Glasses journal December 1979
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states journal November 1992
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels journal March 1993
Quantum Error Correction and Orthogonal Geometry journal January 1997
Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer journal July 2022
Quantum computational advantage attested by nonlocal games with the cyclic cluster state journal July 2022
Hardness of the maximum-independent-set problem on unit-disk graphs and prospects for quantum speedups journal December 2023
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices journal June 2020
Spin glasses: Experimental facts, theoretical concepts, and open questions journal October 1986
Noisy intermediate-scale quantum algorithms journal February 2022
Unifying maximum cut and minimum cut of a planar graph journal May 1990
Quantum optimization of maximum independent set using Rydberg atom arrays journal June 2022
Finding a Maximum Cut of a Planar Graph in Polynomial Time journal September 1975
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization journal February 1995
How Good is the Goemans--Williamson MAX CUT Algorithm? journal January 1999
Information scrambling and entanglement in quantum approximate optimization algorithm circuits journal January 2024
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications book November 1986
Spin Glass Theory and Far Beyond book February 2023
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming journal November 1995
A simple min-cut algorithm journal July 1997
P-Complete Approximation Problems journal July 1976
Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut journal April 2023
Some optimal inapproximability results journal July 2001
Optimization of mean-field spin glasses journal November 2021
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO journal August 2018
On greedy construction heuristics for the MAX-CUT problem journal January 2007
Coherence requirements for quantum communication from hybrid circuit dynamics journal December 2023
Quantum Computing in the NISQ era and beyond journal August 2018
Quantum-inspired algorithms in practice journal August 2020
Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design journal October 2020
Warm-starting quantum optimization journal June 2021
Stim: a fast stabilizer circuit simulator journal July 2021
An improved quantum-inspired algorithm for linear regression journal June 2022
The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size journal July 2022
Ising formulations of many NP problems journal January 2014
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz journal February 2019
The Parisi formula journal January 2006
Maximum Cut Parameterized by Crossing Number journal January 2020

Similar Records

Entanglement perspective on the quantum approximate optimization algorithm
Journal Article · Mon Aug 22 00:00:00 EDT 2022 · Phys.Rev.A · OSTI ID:1988467

Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian
Journal Article · Thu Mar 14 20:00:00 EDT 2024 · PRX Quantum · OSTI ID:2323947

Anomalous interactions between mesons with nonzero spin and glueballs
Journal Article · Sun Apr 07 20:00:00 EDT 2024 · Physical Review. D. · OSTI ID:2335536

Related Subjects