Table 1 Three approaches studied for MaxCut problems: the Dürr–Høyer algorithm for quantum minimum finding (DH-QMF) based on Grover’s search, the discretized adiabatic quantum computation algorithm (DAQC), and the measurement-feedback coherent Ising machine (MFB-CIM)
From: A benchmarking study of quantum algorithms for combinatorial optimization
DH-QMF | DAQC | MFB-CIM | |
|---|---|---|---|
Quantum dynamics | Closed-unitary | Closed-unitary | Open-dissipative |
Operational principle | Amplitude amplification by quantum interference | Adiabatic quantum evolution | Quantum-to-classical transition |
Information carrier | Digital (spin-1/2 particle) | Digital (spin-1/2 particle) | Analog (harmonic oscillator) |
Decoherence time | T2 → ∞ | T2 → ∞ | T2 → ∞ |
Dissipation time | T1 → ∞ | T1 → ∞ | T1: finite |
Gate error | None | None | Vacuum noise limited |
Spin–spin coupling | All-to-all | All-to-all | All-to-all |
