Solving MaxCut with quantum imaginary time evolution

DOI10.1007/s11128-023-04045-7arXiv2201.12221OpenAlexW4384007520MaRDI QIDQ6171442

Rizwanul Alam, Rebekah Herrman, George Siopsis, James Ostrowski, Travis S. Humble, Phillip C. Lotshaw

Publication date: 11 August 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.12221

zbMATH Keywords

quantum computingquantum optimizationMaxCutquantum imaginary time evolution (QITE)

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Classical symmetries and the quantum approximate optimization algorithm
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
• Lower bounds on circuit depth of the quantum approximate optimization algorithm
• .879-approximation algorithms for MAX CUT and MAX 2SAT
• Randomized heuristics for the Max-Cut problem
• Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator

This page was built for publication: Solving MaxCut with quantum imaginary time evolution