Cover Image

Low-depth Clifford circuits approximately solve MaxCut

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Muñoz-Arias, Manuel H., Kourtis, Stefanos, Blais, Alexandre
Format:	Preprint
Published:	2023
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Effects of Small Graph Perturbations in the MaxCut Problem by QAOA
by: Lavagna, Leonardo, et al.
Published: (2024)

Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
by: Shaydulin, Ruslan, et al.
Published: (2022)

The table maker's quantum search
by: Kourtis, Stefanos
Published: (2026)

No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
by: Parekh, Ojas
Published: (2025)

QAOA-MaxCut has barren plateaus for almost all graphs
by: Mao, Rui, et al.
Published: (2025)

Beyond Quantum Annealing: Optimal control solutions to MaxCut problems
by: Pecci, Giovanni, et al.
Published: (2024)

Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
by: Apte, Anuj, et al.
Published: (2025)

Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA
by: Esposito, Aniello, et al.
Published: (2024)

A Quantum Genetic Algorithm Framework for the MaxCut Problem
by: Viana, Paulo A., et al.
Published: (2025)

Benchmarking Lie-Algebraic Pretraining and Non-Variational QWOA for the MaxCut Problem
by: Zering, Matthaus, et al.
Published: (2025)

Topological Obstructions for Quantum Adiabatic Algorithms: Evidence from MaxCut Instances
by: Joshi, Prathamesh S.
Published: (2026)

Enhanced Distributed Variational Quantum Eigensolver for Large-Scale MaxCut Problem
by: Lin, Yuefeng, et al.
Published: (2025)

Standalone FPGA-Based QAOA Emulator for Weighted-MaxCut on Embedded Devices
by: Choi, Seonghyun, et al.
Published: (2025)

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
by: Farhi, Edward, et al.
Published: (2025)

A Quantum-Inspired Algorithm for Solving Sudoku Puzzles and the MaxCut Problem
by: Zhao, Max B., et al.
Published: (2025)

Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree-Fock Method
by: Ralli, Alexis, et al.
Published: (2025)

Postselection-free experimental observation of the measurement-induced phase transition in circuits with universal gates
by: Feng, Xiaozhou, et al.
Published: (2025)

Any Clifford+T circuit can be controlled with constant T-depth overhead
by: Kim, Isaac H., et al.
Published: (2025)

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
by: Zhong, Dawei, et al.
Published: (2024)

Robustness of longitudinal transmon readout to ionization
by: Chapple, Alex A., et al.
Published: (2024)

An improved Quantum Max Cut approximation via matching
by: Lee, Eunou, et al.
Published: (2024)

Quantum Max-Cut is NP hard to approximate
by: Piddock, Stephen
Published: (2025)

Counting with the quantum alternating operator ansatz
by: Drapeau, Julien, et al.
Published: (2025)

Low-cost noise reduction for Clifford circuits
by: Delfosse, Nicolas, et al.
Published: (2024)

Quantum Counting in the Rydberg Blockade
by: Gibson, Joseph, et al.
Published: (2025)

Toolbox for nonreciprocal dispersive models in circuit QED
by: Labarca, Lautaro, et al.
Published: (2023)

Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder
by: Darmawan, Andrew S., et al.
Published: (2022)

Iterative Qubit Coupled Cluster using only Clifford circuits
by: Brown, James, et al.
Published: (2022)

Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
by: Liu, Zejun, et al.
Published: (2024)

Error correction with brickwork Clifford circuits
by: Kroll, Twan, et al.
Published: (2026)

Max-Cut graph-driven quantum circuit design for planar spin glasses
by: Ghasempouri, Seyed Ehsan, et al.
Published: (2025)

Quantum algorithms for solving a drift-diffusion equation: analysing circuit depths
by: Devereux, Ellen, et al.
Published: (2025)

Shallow shadows: Expectation estimation using low-depth random Clifford circuits
by: Bertoni, Christian, et al.
Published: (2022)

In-situ benchmarking of fault-tolerant quantum circuits. I. Clifford circuits
by: Xiao, Xiao, et al.
Published: (2026)

Complexity of graph-state preparation by Clifford circuits
by: Kumabe, Soh, et al.
Published: (2024)

Fast simulation of planar Clifford circuits
by: Gosset, David, et al.
Published: (2020)

Low-degree approximation of QAC$^0$ circuits
by: Montanaro, Ashley, et al.
Published: (2024)

Symmetry-accelerated classical simulation of Clifford-dominated circuits
by: Camillo, Giulio, et al.
Published: (2025)

Hardware-tailored logical Clifford circuits for stabilizer codes
by: Kuehnke, Eric J., et al.
Published: (2025)

Efficient simulation of Clifford circuits with small Markovian errors
by: Miller, Ashe, et al.
Published: (2025)