aiqbench analysis
This research presents DQ²MC, a novel quantum algorithm that elevates the auxiliary-field sampling of classical determinant Monte Carlo directly onto a quantum computer. By utilizing block encoding and quantum singular value transformations, the method eliminates the need to enumerate or store exponentially many Hubbard-Stratonovich weights, thereby removing Markov chain autocorrelation entirely. The approach offers favorable circuit-depth scaling with system volume while mapping the fermion sign problem cost precisely to post-selection overhead in weak-value extraction.
Determinant Quantum-Quantum Monte Carlo: Coherent Auxiliary-Field Sampling
arXiv:2608.28742v1 Announce Type: cross Abstract: We introduce determinant quantum-quantum Monte Carlo (DQ$^2$MC), a quantum algorithm that lifts the auxiliary-field sampling and averaging at the operational core of determinant quantum Monte Carlo onto a quantum computer. A determinant oracle synthesizes the DQMC amplitudes directly from a block encoding of the single-particle action matrix via quantum singular value transformations, so that the exponentially many Hubbard-Stratonovich weights are never enumerated, precomputed, or stored. Since the fermions are free for fixed auxiliary fields, the construction operates entirely at the single-particle level, requiring $O(\log N_{\mathrm{st}})$ system qubits and no Jordan-Wigner or Bravyi-Kitaev encoding, where $N_{\mathrm{st}}$ is the space-time volume. A full-quantum protocol makes observables interference amplitudes, eliminating the Markov chain and its autocorrelation time altogether; a hybrid quantum-classical protocol retains a constant-size active block of qubits and replaces the Metropolis-Hastings acceptance step with an exact heat-bath draw, so that cluster updates of any size are rejection-free, and passes only classical information between updates, admitting parallel tempering and distributed execution across quantum processors. The circuit-depth scales more favorably with spatial volume than classical DQMC, at the price of a post-selection overhead determined exactly by the largest target probability --- polynomial for smooth distributions, exponential for sharply peaked ones. Finally, the reweighting estimator underlying the fermion sign problem maps exactly onto a quantum weak value, placing the exponential cost of sign-problematic DQMC in precise correspondence with the post-selection overhead of weak-value extraction.
Abstract:We introduce determinant quantum-quantum Monte Carlo (DQ$^2$MC), a quantum algorithm that lifts the auxiliary-field sampling and averaging at the operational core of determinant quantum Monte Carlo onto a quantum computer. A determinant oracle synthesizes the DQMC amplitudes directly from a block encoding of the single-particle action matrix via quantum singular value transformations, so that the exponentially many Hubbard-Stratonovich weights are never enumerated, precomputed, or stored. Since the fermions are free for fixed auxiliary fields, the construction operates entirely at the single-particle level, requiring $O(\log N_{\mathrm{st}})$ system qubits and no Jordan-Wigner or Bravyi-Kitaev encoding, where $N_{\mathrm{st}}$ is the space-time volume. A full-quantum protocol makes observables interference amplitudes, eliminating the Markov chain and its autocorrelation time altogether; a hybrid quantum-classical protocol retains a constant-size active block of qubits and replaces the Metropolis-Hastings acceptance step with an exact heat-bath draw, so that cluster updates of any size are rejection-free, and passes only classical information between updates, admitting parallel tempering and distributed execution across quantum processors. The circuit-depth scales more favorably with spatial volume than classical DQMC, at the price of a post-selection overhead determined exactly by the largest target probability --- polynomial for smooth distributions, exponential for sharply peaked ones. Finally, the reweighting estimator underlying the fermion sign problem maps exactly onto a quantum weak value, placing the exponential cost of sign-problematic DQMC in precise correspondence with the post-selection overhead of weak-value extraction.
Strongly Correlated Electrons (cond-mat.str-el); Statistical Mechanics (cond-mat.stat-mech); High Energy Physics - Lattice (hep-lat); Quantum Physics (quant-ph)
arXiv:2608.28742 [cond-mat.str-el]
(or arXiv:2608.28742v1 [cond-mat.str-el] for this version)
https://doi.org/10.48550/arXiv.2608.28742 arXiv-issued DOI via DataCite (pending registration)
Full text under the publisher's open licence · 261 words
Related coverage
U-238 Resonance Integral Computed With Quantum Monte Carlo Speedup
Quantum Zeitgeist · Jul 14, 2026
Stabilizer-R\'enyi Microscopy of Critical Correlations in Interacting Fermions
arXiv · Aug 18, 2026
Orbital-Rotation Shadow Tomography Reduces the Classical Cost of Quantum-Classical Auxiliary-Field Quantum Monte Carlo
arXiv · Oct 5, 2026
Neural Network Backflow with Low-Rank Multi-Determinant Updates
arXiv · Sep 23, 2026