Citation notice #212 · 2026-07-11 03:18:48.707106+00:00
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization
Correction
Crossref
Open
cites doi: 10.1038/s41567-019-0704-4, which carries a correction notice dated 2020-01-29. One-hop deterministic notice: the citation edge exists in the Pith bibliography graph; no model judged whether the citation was load-bearing.
Citing paper Event page Original DOI Notice DOI File a formal challenge All reference changes
01Evidence
Raw extraction · citation context · bibliography index 13
scheme is claimed to be classically intractable for sufficiently large|V|, the crossover point where quantum advantage emerges remains empirically unclear. B. Quantum Optimization Algorithms Quantum algorithms for combinatorial optimization that are compatible with our encoding include variational quantum computing (VQC) [31], quantum imaginary time evolution (QITE) [12], Grover-based adaptive search (GAS) [13], [32], and adiabatic quantum computation (AQC)/quantum annealing (QA) [33]. We summarize these methods, and briefly comment on their resource use when applied QUBO and HUBO models. a) Variational Quantum Computing:VQC minimizes ⟨ψ(θ)|H|ψ(θ)⟩ ≥E 0 by classically adjusting circuit parame- tersθ[31]. QUBOs require only2-qubit gates;k-local HUBO terms are realized via phase gadgets using2(k−1)CNOTs and
02Event
- Type
- Correction
- Source
- Crossref
- Original DOI
- 10.1038/s41567-019-0704-4
- Notice DOI
- 10.1038/s41567-020-0798-8
- Date
- 2020-01-29
- Title
- Publisher Correction: Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Reasons
- ['Correction']
- Work
- doi: 10.1038/s41567-019-0704-4 (2020) Nature Physics
03Dispute this notice
If this citation does not depend on the flagged claim, or the event is wrong, say so. Disputes are public. For a signed challenge against the paper itself, use the formal challenge form.