Hamiltonian Decoded Quantum Interferometry

Hamiltonian Decoded Quantum Interferometry

🎙 Yihui Quek 👥 42K 📅 January 15, 2026 ⏱ 39 min 👁 643 📄 original study 🧭 2026-08-13
Available in: English (current) Français

Keywords

HDQIquantum algorithmGibbs statedecodingPauli group

Summary

The talk presents Hamiltonian Decoded Quantum Interferometry (HDQI), a quantum algorithm that reduces the preparation of Gibbs states and other spectral filters for a given Hamiltonian to classical decoding problems. The algorithm leverages coherent Bell measurements and the symplectic representation of the Pauli group. For a signed Pauli Hamiltonian H and a polynomial P, HDQI prepares a purification of a density matrix proportional to P(H)^2 by solving two tasks: decoding errors on a classical code defined by H, and preparing a pilot state encoding the anti-commutation structure of H. The speaker explains the connection to previous work, including Regev’s reduction and Decoded Quantum Interferometry (DQI). For commuting Hamiltonians, the pilot state is always efficient to prepare, and the decoding problem corresponds to LDPC codes. The talk proves that HDQI efficiently prepares Gibbs states for certain commuting Hamiltonians, such as the toric code and Haah’s cubic code, but also provides a matching classical algorithm. For non-commuting Hamiltonians, the pilot state preparation becomes non-trivial, but the speaker shows that it admits an efficient matrix product state representation for Hamiltonians with anti-commutation graphs of logarithmic connected components. The algorithm is positioned as a versatile primitive and the first extension of Regev’s reduction to non-abelian groups.

202 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides a high-value contribution by introducing a new algorithmic framework that connects quantum state preparation to classical decoding, potentially offering new insights into quantum advantage. The argumentation is rigorous, with clear logical steps from the problem setting to the algorithm’s construction and its complexity analysis. The speaker carefully explains the intuition and formalizes the reduction, addressing potential pitfalls such as normalization and the role of the pilot state. The discussion of applications (Gibbs state preparation, ground state preparation, spectral filters) demonstrates the broad utility of the approach. The speaker also honestly acknowledges limitations, such as the need for efficient decoding and pilot state preparation, and notes that for some cases a classical algorithm matches the quantum one.

Scientific Rigor, Source Quality, Title Accuracy

The presentation is scientifically rigorous, with formal definitions, theorems, and proofs sketched. The speaker references prior work (Regev’s reduction, DQI, etc.) and builds upon it. The title accurately reflects the content. The talk is part of a workshop at IPAM, a reputable institution, and the speaker is a researcher at EPFL. The description provides a link to the workshop page, but no direct sources are cited in the description. The talk itself mentions several papers (e.g., Regev 2005, Chenlu and Jandry 2022, Yamakawa and Jandry 2024, Jordan et al. 2024) but does not provide URLs. The audience interaction shows engagement and the speaker handles questions well, indicating depth of understanding.

244 words

Title / Content Match

The title accurately reflects the content, which introduces a new quantum algorithm named Hamiltonian Decoded Quantum Interferometry.

Quality & Reliability

8/10

Presentation of original research with rigorous mathematical proofs, clear definitions, and explicit connections to prior work. The speaker is an expert (EPFL) and the venue is a reputable workshop (IPAM).

Key Moments

Cited Sources

Concurring Sources

Contribution & Novelties

The talk introduces HDQI, a novel quantum algorithm that reduces the preparation of Gibbs states and other spectral filters to classical decoding, extending the DQI framework to non-commuting Hamiltonians. This is the first extension of Regev’s reduction to non-abelian groups, providing a new algorithmic primitive for quantum simulation. The algorithm’s efficiency depends on the structure of the Hamiltonian, and the talk identifies classes of Hamiltonians where it is efficient, including commuting Hamiltonians and those with anti-commutation graphs of logarithmic connected components.

Pour aller plus loin :

124 words

Radar Profile

The radar profile shows high scores in all dimensions, indicating a technically deep and reliable presentation. The talk is particularly strong in technical level and information quality, with a slightly lower but still high score in information quantity due to the focused scope.

Reliability 8/10