Max-flow min-cut theorem in quantum computing
From MaRDI portal
Publication:6593548
DOI10.1016/j.physa.2024.129990MaRDI QIDQ6593548
Anish Kumar Saha, Nongmeikapam Brajabidhu Singh, Arnab Roy
Publication date: 26 August 2024
Published in: Physica A (Search for Journal in Brave)
Ising modelquantum annealingmax-flow min-cut theoremquadratic unconstrained binary optimizationquantum approximate optimization algorithm
This page was built for publication: Max-flow min-cut theorem in quantum computing