Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.28742

Determinant Quantum-Quantum Monte Carlo: Coherent Auxiliary-Field Sampling

Xuepeng Wang, Sagnik Banerjee, Debanjan Chowdhury

cond-mat.str-elcond-mat.stat-mechhep-latquant-phSubmitted Aug 28, 2026• Announced Sep 1, 2026• 0 citations
arXivHTMLPDF

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.

Comments
27 pages, 8 figures

Related papers

Reformulating Pfaffian Quantum Monte Carlo with the Hybrid Monte Carlo formalism

Thomas Hauschild, Lin Wang, Finn L. Temmen +1 more

Pfaffian quantum Monte Carlo extends auxiliary field methods to anomalous fermionic Hamiltonians, opening access to pairing systems and Hubbard--Stratonovich decompositions that are unavailable in determinant formulations. We show that this flexibility can be combined with the global updates of Hybrid Monte Carlo (HMC), leading to an algorithm scaling as $\mathcal{O}(N_τL^3)$, similar to its determinant quantum Monte Carlo (DQMC) counterpart without pseudofermions. The central observation is that the molecular dynamics force depends only on the magnitude of the Pfaffian weight, which admits a determinant representation and leads to a simplified force expression. This construction also yields unequal-time Majorana correlators at essentially no additional cost. We demonstrate the method for the interacting Kitaev chain using the imaginary and symmetric Majorana hopping channel. The resulting noncommuting auxiliary-field bond operators are treated through an even-odd decomposition. Their block structure permits an analytic reduction to a sparse effective interaction matrix of bandwidth two and allows explicit force expressions. Results agree with exact diagonalization and resolve low-energy modes localized at opposite boundaries, together with their increasing overlap near the topological transition of the non-interacting system. These findings establish HMC as an efficient sampling framework for Pfaffian auxiliary-field simulations.

arXiv:2609.21631•Sep 18, 2026•0 citations

A unified theory of variational and quantum Monte Carlo methods and beyond

Mohammad-Sadegh Vaezi, Abolhassan Vaezi

We present a unified theory of the variational Monte Carlo (VMC) and determinant quantum Monte Carlo (DQMC) methods using a novel density matrix formulation of VMC. We introduce an efficient algorithm for VMC to compute correlation functions and expectation values based on the auxiliary field Hirsch-Hubbard-Stratonovic transformation. We show that this new approach to VMC converges significantly faster than its traditional implementations. Furthermore, we generalize the Trotter-Suzuki decomposition to finite imaginary time steps $τ\sim O(1)$ and develop a variational quantum Monte Carlo (VQMC) method accordingly, which is more accurate than VMC and can incorporate quantum fluctuations more efficiently. The two extreme limits of the VQMC method, namely infinitesimal and infinite imaginary time steps, correspond to the DQMC and VMC techniques, respectively. We demonstrate that our VQMC allows us to access lower temperatures in comparison with the conventional DQMC before the sign problem comes into play. We finally show that our VQMC can also enhance the accuracy of the projector Monte Carlo methods by providing better and less biased candidates for the trial wave functions, requiring shorter projection times for a given accuracy and alleviating the sign problem further.

arXiv:1810.00864•Oct 1, 2018•2 citations

Fast and scalable quantum Monte Carlo simulations of electron-phonon models

Benjamin Cohen-Stead, Owen Bradley, Cole Miles +3 more

We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and we report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a widely used tool for simulating simple electron-phonon models at finite temperatures, but it incurs a computational cost that scales cubically with system size. Alternatively, near-linear scaling with system size can be achieved with the hybrid Monte Carlo (HMC) method and an integral representation of the Fermion determinant. Here, we introduce a collection of methodologies that make such simulations even faster. To combat "stiffness" arising from the bosonic action, we review how Fourier acceleration can be combined with time-step splitting. To overcome phonon sampling barriers associated with strongly bound bipolaron formation, we design global Monte Carlo updates that approximately respect particle-hole symmetry. To accelerate the iterative linear solver, we introduce a preconditioner that becomes exact in the adiabatic limit of infinite atomic mass. Finally, we demonstrate how stochastic measurements can be accelerated using fast Fourier transforms. These methods are all complementary and, combined, may produce multiple orders of magnitude speedup, depending on model details.

arXiv:2203.01291•Physical review. E•Jun 15, 2022•35 citations

Quantum Computing Approach to Fixed-Node Monte Carlo Using Classical Shadows

Nick S. Blunt, Laura Caune, Javiera Quiroz-Fernandez

High Resolution Image Download MS PowerPoint Slide Quantum Monte Carlo (QMC) methods are powerful approaches for solving electronic structure problems. Although they often provide high-accuracy solutions, the precision of most QMC methods is ultimately limited by the trial wave function that must be used. Recently, an approach has been demonstrated to allow the use of trial wave functions prepared on a quantum computer [Huggins et al., Unbiasing fermionic quantum Monte Carlo with a quantum computer. Nature 2022, 603, 416] in the auxiliary-field QMC (AFQMC) method using classical shadows to estimate the required overlaps. However, this approach has an exponential post-processing step to construct these overlaps when performing classical shadows obtained using random Clifford circuits. Here, we study an approach to avoid this exponential scaling step by using a fixed-node Monte Carlo method based on full configuration interaction quantum Monte Carlo. This method is applied to the local unitary cluster Jastrow ansatz. We consider H 4, ferrocene, and benzene molecules using up to 12 qubits as examples. Circuits are compiled to native gates for typical near-term architectures, and we assess the impact of circuit-level depolarizing noise on the method. We also provide a comparison of AFQMC and fixed-node approaches, demonstrating that AFQMC is more robust to errors, although extrapolations of the fixed-node energy reduce this discrepancy. Although the method can be used to reach chemical accuracy, the sampling cost to achieve this is high even for small active spaces, suggesting caution about the prospect of outperforming conventional QMC approaches.

arXiv:2410.18901•Journal of Chemical Theory and Computation•Feb 5, 2025•3 citations

Geometry dependence of the sign problem in quantum Monte Carlo simulations

Vladimir Iglovikov, Ehsan Khatami, Richard T. Scalettar

The sign problem is the fundamental limitation to quantum Monte Carlo simulations of the statistical mechanics of interacting fermions. Determinant quantum Monte Carlo (DQMC) is one of the leading methods to study lattice fermions, such as the Hubbard Hamiltonian, which describe strongly correlated phenomena including magnetism, metal-insulator transitions, and possibly exotic superconductivity. Here, we provide a comprehensive dataset on the geometry dependence of the DQMC sign problem for different densities, interaction strengths, temperatures, and spatial lattice sizes. We supplement these data with several observations concerning general trends in the data, including the dependence on spatial volume and how this can be probed by examining decoupled clusters, the scaling of the sign in the vicinity of a particle-hole symmetric point, and the correlation between the total sign and the signs for the individual spin species.

arXiv:1501.02832•Physical Review B•Jul 9, 2015•106 citations

Pfaffian quantum Monte Carlo: solution to Majorana sign ambiguity and applications

Ze-Yao Han, Zhou‐Quan Wan, Hong Yao

Determinant quantum Monte Carlo (DQMC), formulated in complex-fermion representation, has played a key role in studying strongly-correlated fermion systems. However, its applicability is limited due to the requirement of particle-number conservation after Hubbard-Stratonovich transformation. In going beyond the conventional DQMC, one encouraging development occurred when Majorana fermions were introduced for QMC [1,2]. But in previous Majorana-based QMC, Boltzmann weight is determined often with a sign ambiguity. Here we successfully resolved this ambiguity by deriving a closed-form Pfaffian formula for the weight, enabling efficient calculation of the weight with its sign in polynomial time. We call it ''Pfaffian quantum Monte Carlo'' (PfQMC), which can be applied to generic interacting fermion models. We have successfully employed PfQMC to explore how robust Majorana edge modes in Kitaev chain are against strong interactions. By offering greater flexibility, PfQMC can potentially enhance existing sign-mitigating and approximation methods and help address challenging issues such as the ground-state properties of the doped Hubbard model.

arXiv:2408.10311•Aug 19, 2024•0 citations
We introduce determinant quantum-quantum Monte Carlo (DQ2^22MC), 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⁡Nst)O(\log N_{\mathrm{st}})O(logNst​) system qubits and no Jordan-Wigner or Bravyi-Kitaev encoding, where NstN_{\mathrm{st}}Nst​ 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.
Pfaffian quantum Monte Carlo extends auxiliary field methods to anomalous fermionic Hamiltonians, opening access to pairing systems and Hubbard--Stratonovich decompositions that are unavailable in determinant formulations. We show that this flexibility can be combined with the global updates of Hybrid Monte Carlo (HMC), leading to an algorithm scaling as O(NτL3)\mathcal{O}(N_τL^3)O(Nτ​L3), similar to its determinant quantum Monte Carlo (DQMC) counterpart without pseudofermions. The central observation is that the molecular dynamics force depends only on the magnitude of the Pfaffian weight, which admits a determinant representation and leads to a simplified force expression. This construction also yields unequal-time Majorana correlators at essentially no additional cost. We demonstrate the method for the interacting Kitaev chain using the imaginary and symmetric Majorana hopping channel. The resulting noncommuting auxiliary-field bond operators are treated through an even-odd decomposition. Their block structure permits an analytic reduction to a sparse effective interaction matrix of bandwidth two and allows explicit force expressions. Results agree with exact diagonalization and resolve low-energy modes localized at opposite boundaries, together with their increasing overlap near the topological transition of the non-interacting system. These findings establish HMC as an efficient sampling framework for Pfaffian auxiliary-field simulations.
We present a unified theory of the variational Monte Carlo (VMC) and determinant quantum Monte Carlo (DQMC) methods using a novel density matrix formulation of VMC. We introduce an efficient algorithm for VMC to compute correlation functions and expectation values based on the auxiliary field Hirsch-Hubbard-Stratonovic transformation. We show that this new approach to VMC converges significantly faster than its traditional implementations. Furthermore, we generalize the Trotter-Suzuki decomposition to finite imaginary time steps τ∼O(1)τ\sim O(1)τ∼O(1) and develop a variational quantum Monte Carlo (VQMC) method accordingly, which is more accurate than VMC and can incorporate quantum fluctuations more efficiently. The two extreme limits of the VQMC method, namely infinitesimal and infinite imaginary time steps, correspond to the DQMC and VMC techniques, respectively. We demonstrate that our VQMC allows us to access lower temperatures in comparison with the conventional DQMC before the sign problem comes into play. We finally show that our VQMC can also enhance the accuracy of the projector Monte Carlo methods by providing better and less biased candidates for the trial wave functions, requiring shorter projection times for a given accuracy and alleviating the sign problem further.
We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and we report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a widely used tool for simulating simple electron-phonon models at finite temperatures, but it incurs a computational cost that scales cubically with system size. Alternatively, near-linear scaling with system size can be achieved with the hybrid Monte Carlo (HMC) method and an integral representation of the Fermion determinant. Here, we introduce a collection of methodologies that make such simulations even faster. To combat "stiffness" arising from the bosonic action, we review how Fourier acceleration can be combined with time-step splitting. To overcome phonon sampling barriers associated with strongly bound bipolaron formation, we design global Monte Carlo updates that approximately respect particle-hole symmetry. To accelerate the iterative linear solver, we introduce a preconditioner that becomes exact in the adiabatic limit of infinite atomic mass. Finally, we demonstrate how stochastic measurements can be accelerated using fast Fourier transforms. These methods are all complementary and, combined, may produce multiple orders of magnitude speedup, depending on model details.
High Resolution Image Download MS PowerPoint Slide Quantum Monte Carlo (QMC) methods are powerful approaches for solving electronic structure problems. Although they often provide high-accuracy solutions, the precision of most QMC methods is ultimately limited by the trial wave function that must be used. Recently, an approach has been demonstrated to allow the use of trial wave functions prepared on a quantum computer [Huggins et al., Unbiasing fermionic quantum Monte Carlo with a quantum computer. Nature 2022, 603, 416] in the auxiliary-field QMC (AFQMC) method using classical shadows to estimate the required overlaps. However, this approach has an exponential post-processing step to construct these overlaps when performing classical shadows obtained using random Clifford circuits. Here, we study an approach to avoid this exponential scaling step by using a fixed-node Monte Carlo method based on full configuration interaction quantum Monte Carlo. This method is applied to the local unitary cluster Jastrow ansatz. We consider H 4, ferrocene, and benzene molecules using up to 12 qubits as examples. Circuits are compiled to native gates for typical near-term architectures, and we assess the impact of circuit-level depolarizing noise on the method. We also provide a comparison of AFQMC and fixed-node approaches, demonstrating that AFQMC is more robust to errors, although extrapolations of the fixed-node energy reduce this discrepancy. Although the method can be used to reach chemical accuracy, the sampling cost to achieve this is high even for small active spaces, suggesting caution about the prospect of outperforming conventional QMC approaches.
The sign problem is the fundamental limitation to quantum Monte Carlo simulations of the statistical mechanics of interacting fermions. Determinant quantum Monte Carlo (DQMC) is one of the leading methods to study lattice fermions, such as the Hubbard Hamiltonian, which describe strongly correlated phenomena including magnetism, metal-insulator transitions, and possibly exotic superconductivity. Here, we provide a comprehensive dataset on the geometry dependence of the DQMC sign problem for different densities, interaction strengths, temperatures, and spatial lattice sizes. We supplement these data with several observations concerning general trends in the data, including the dependence on spatial volume and how this can be probed by examining decoupled clusters, the scaling of the sign in the vicinity of a particle-hole symmetric point, and the correlation between the total sign and the signs for the individual spin species.
Determinant quantum Monte Carlo (DQMC), formulated in complex-fermion representation, has played a key role in studying strongly-correlated fermion systems. However, its applicability is limited due to the requirement of particle-number conservation after Hubbard-Stratonovich transformation. In going beyond the conventional DQMC, one encouraging development occurred when Majorana fermions were introduced for QMC [1,2]. But in previous Majorana-based QMC, Boltzmann weight is determined often with a sign ambiguity. Here we successfully resolved this ambiguity by deriving a closed-form Pfaffian formula for the weight, enabling efficient calculation of the weight with its sign in polynomial time. We call it ''Pfaffian quantum Monte Carlo'' (PfQMC), which can be applied to generic interacting fermion models. We have successfully employed PfQMC to explore how robust Majorana edge modes in Kitaev chain are against strong interactions. By offering greater flexibility, PfQMC can potentially enhance existing sign-mitigating and approximation methods and help address challenging issues such as the ground-state properties of the doped Hubbard model.