Max-flow min-cut theorem in quantum computing

DOI10.1016/J.PHYSA.2024.129990MaRDI QIDQ6593548zbMATH OpenFDO

Authors Nongmeikapam Brajabidhu Singh, Arnab Roy, Anish Kumar Saha

Publication date 26 August 2024

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PHYSA.2024.129990

zbMATH Keywords

Ising modelmax-flow min-cut theoremquantum annealingquadratic unconstrained binary optimizationquantum approximate optimization algorithm

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites work

• A simple min-cut algorithm
• An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Positivity of the universal pairing in 3 dimensions
• The first eigenvalue of the Laplacian, isoperimetric constants, and the max flow min cut theorem
• The unconstrained binary quadratic programming problem: a survey

Cited in

(1)

• Penalty-enhanced quantum approximate optimization algorithm framework for maximization and minimization problems

This page was built for publication: Max-flow min-cut theorem in quantum computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593548)