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:2503.11577 · Physical review. B./Physical review. B

Bosonized one-dimensional quantum systems through enhanced event-chain Monte Carlo

Oscar Bouverot-Dupuis, Alberto Rosso, Manon Michel

Published Jun 24, 2025• 3 citations
arXivHTMLPDF

Abstract

We design an enhanced Event-Chain Monte Carlo algorithm to study 1D quantum dissipative systems, using their bosonized representation. Expressing the bosonized Hamiltonian as a path integral over a scalar field enables the application of Monte Carlo algorithms developed for classical systems. Specifically, we focus on a dissipative XXZ spin chain, exhibiting critical slowing down, minima degeneracy and long-range interactions. Addressing all three bottlenecks, we design an algorithm that combines local persistent Event-Chain Monte Carlo moves with global cluster moves, in a O(1)-complexity implementation. Through systematic performance analysis, we show that such an algorithm outperforms traditional Metropolis algorithms by more than a magnitude factor and is competitive with current state-of-the-art Quantum Monte Carlo algorithms. We then use this approach to determine the dissipative spin chain's phase diagram, thereby reinforcing prior analytical predictions.

DOI
10.1103/k43n-yz82

Related papers

Cluster Monte Carlo Algorithms for Dissipative Quantum Phase Transitions

Philipp Werner, Matthias Troyer

Dissipation and decoherence in quantum systems have important practical implications, from stabilizing superconductivity in granular materials, to the loss of information stored in qubits. In the models we consider in this chapter, energy dissipation is introduced by coupling a quantum mechanical degree of freedom to a bath of suitably chosen harmonic oscillators. The degrees of freedom of this bath can be integrated out analytically, which leads to an effective action with long-range interactions in imaginary time. We will review and present a number of recently developed efficient cluster Monte Carlo algorithms for various dissipative quantum systems. This chapter is based in large part on Refs. [1, 2] but has been updated with more recent developments, especially in the applications section.

CRC Press eBooks•Nov 2, 2010•0 citations

Quantum Monte Carlo simulation of the one-dimensional spin S xxz model. I. The method

M Marcu, Andreas Wiesler

The authors develop a quantum Monte Carlo procedure for the xxz spin chain. The quantum model in one dimension is mapped by a path integral method based on the Trotter formula into the infinite anisotropy limit of a classical two-dimensional spin system. The expectation values of the energy density, susceptibility and static s z -s z structure function are computed in the classical model for finite but increasing anisotropy. The computation method is a Monte Carlo simulation of the classical system. The results are systematically extrapolated to the infinite anisotropy limit.

Journal of Physics A Mathematical and General•Sep 11, 1985•13 citations

Directed-Loop Quantum Monte Carlo Method for Retarded Interactions

Manuel Weber, Fakher F. Assaad, Martin Hohenadler

The directed-loop quantum Monte Carlo method is generalized to the case of retarded interactions. Using the path integral, fermion-boson or spin-boson models are mapped to actions with retarded interactions by analytically integrating out the bosons. This yields an exact algorithm that combines the highly efficient loop updates available in the stochastic series expansion representation with the advantages of avoiding a direct sampling of the bosons. The application to electron-phonon models reveals that the method overcomes the previously detrimental issues of long autocorrelation times and exponentially decreasing acceptance rates. For example, the resulting dramatic speedup allows us to investigate the Peierls quantum phase transition on chains of up to 1282 sites.

arXiv:1704.07913•Physical Review Letters•Aug 31, 2017•20 citations

Markov chain Monte Carlo enhanced variational quantum algorithms

Taylor L. Patti, Omar Shehab, Khadijeh Najafi +1 more

Abstract Variational quantum algorithms have the potential for significant impact on high-dimensional optimization, with applications in classical combinatorics, quantum chemistry, and condensed matter. Nevertheless, the optimization landscape of these algorithms is generally nonconvex, leading the algorithms to converge to local, rather than global, minima and the production of suboptimal solutions. In this work, we introduce a variational quantum algorithm that couples classical Markov chain Monte Carlo techniques with variational quantum algorithms, allowing the former to provably converge to global minima and thus assure solution quality. Due to the generality of our approach, it is suitable for a myriad of quantum minimization problems, including optimization and quantum state preparation. Specifically, we devise a Metropolis–Hastings method that is suitable for variational quantum devices and use it, in conjunction with quantum optimization, to construct quantum ensembles that converge to Gibbs states. These performance guarantees are derived from the ergodicity of our algorithm’s state space and enable us to place analytic bounds on its time-complexity. We demonstrate both the effectiveness of our technique and the validity of our analysis through quantum circuit simulations for MaxCut instances, solving these problems deterministically and with perfect accuracy, as well as large-scale quantum Ising and transverse field spin models of up to 50 qubits. Our technique stands to broadly enrich the field of variational quantum algorithms, improving and guaranteeing the performance of these promising, yet often heuristic, methods.

arXiv:2112.02190•Quantum Science and Technology•Dec 2, 2022•20 citations

Efficient Monte Carlo Algorithm in Quasi-One-Dimensional Ising Spin Systems

Tota Nakamura

We develop an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with highly anisotropic exchange interactions. Both correlation time and real CPU time are reduced drastically. The algorithm is demonstrated in the layered triangular-lattice antiferromagnetic Ising model. We have obtained the relation between the transition temperature and the exchange interaction parameters, which modifies the result of the chain-mean-field theory.

arXiv:0809.2969•Physical Review Letters•Nov 20, 2008•20 citations

Wirkungsbasierte Quanten-Monte-Carlo-Methoden für Fermion-Boson-Modelle

Weber, Manuel

This work deals with the development and application of novel quantum Monte Carlo methods to simulate fermion-boson models. Our developments are based on the path-integral formalism, where the bosonic degrees of freedom are integrated out exactly to obtain a retarded fermionic interaction. We give an overview of three methods that can be used to simulate retarded interactions. In particular, we develop a novel quantum Monte Carlo method with global directed-loop updates that solves the autocorrelation problem of previous approaches and scales linearly with system size. We demonstrate its efficiency for the Peierls transition in the Holstein model and discuss extensions to other fermion-boson models as well as spin-boson models. Furthermore, we show how with the help of generating functionals bosonic observables can be recovered directly from the Monte Carlo configurations. This includes estimators for the boson propagator, the fidelity susceptibility, and the specific heat of the Holstein model. The algorithmic developments of this work allow us to study the specific heat of the spinless Holstein model covering its entire parameter range. Its key features are explained from the single-particle spectral functions of electrons and phonons. In the adiabatic limit, the spectral properties are calculated exactly as a function of temperature using a classical Monte Carlo method and compared to results for the Su-Schrieffer-Heeger model.

•Jan 1, 2019•0 citations
We design an enhanced Event-Chain Monte Carlo algorithm to study 1D quantum dissipative systems, using their bosonized representation. Expressing the bosonized Hamiltonian as a path integral over a scalar field enables the application of Monte Carlo algorithms developed for classical systems. Specifically, we focus on a dissipative XXZ spin chain, exhibiting critical slowing down, minima degeneracy and long-range interactions. Addressing all three bottlenecks, we design an algorithm that combines local persistent Event-Chain Monte Carlo moves with global cluster moves, in a O(1)-complexity implementation. Through systematic performance analysis, we show that such an algorithm outperforms traditional Metropolis algorithms by more than a magnitude factor and is competitive with current state-of-the-art Quantum Monte Carlo algorithms. We then use this approach to determine the dissipative spin chain's phase diagram, thereby reinforcing prior analytical predictions.
Dissipation and decoherence in quantum systems have important practical implications, from stabilizing superconductivity in granular materials, to the loss of information stored in qubits. In the models we consider in this chapter, energy dissipation is introduced by coupling a quantum mechanical degree of freedom to a bath of suitably chosen harmonic oscillators. The degrees of freedom of this bath can be integrated out analytically, which leads to an effective action with long-range interactions in imaginary time. We will review and present a number of recently developed efficient cluster Monte Carlo algorithms for various dissipative quantum systems. This chapter is based in large part on Refs. [1, 2] but has been updated with more recent developments, especially in the applications section.
The authors develop a quantum Monte Carlo procedure for the xxz spin chain. The quantum model in one dimension is mapped by a path integral method based on the Trotter formula into the infinite anisotropy limit of a classical two-dimensional spin system. The expectation values of the energy density, susceptibility and static s z -s z structure function are computed in the classical model for finite but increasing anisotropy. The computation method is a Monte Carlo simulation of the classical system. The results are systematically extrapolated to the infinite anisotropy limit.
The directed-loop quantum Monte Carlo method is generalized to the case of retarded interactions. Using the path integral, fermion-boson or spin-boson models are mapped to actions with retarded interactions by analytically integrating out the bosons. This yields an exact algorithm that combines the highly efficient loop updates available in the stochastic series expansion representation with the advantages of avoiding a direct sampling of the bosons. The application to electron-phonon models reveals that the method overcomes the previously detrimental issues of long autocorrelation times and exponentially decreasing acceptance rates. For example, the resulting dramatic speedup allows us to investigate the Peierls quantum phase transition on chains of up to 1282 sites.
Abstract Variational quantum algorithms have the potential for significant impact on high-dimensional optimization, with applications in classical combinatorics, quantum chemistry, and condensed matter. Nevertheless, the optimization landscape of these algorithms is generally nonconvex, leading the algorithms to converge to local, rather than global, minima and the production of suboptimal solutions. In this work, we introduce a variational quantum algorithm that couples classical Markov chain Monte Carlo techniques with variational quantum algorithms, allowing the former to provably converge to global minima and thus assure solution quality. Due to the generality of our approach, it is suitable for a myriad of quantum minimization problems, including optimization and quantum state preparation. Specifically, we devise a Metropolis–Hastings method that is suitable for variational quantum devices and use it, in conjunction with quantum optimization, to construct quantum ensembles that converge to Gibbs states. These performance guarantees are derived from the ergodicity of our algorithm’s state space and enable us to place analytic bounds on its time-complexity. We demonstrate both the effectiveness of our technique and the validity of our analysis through quantum circuit simulations for MaxCut instances, solving these problems deterministically and with perfect accuracy, as well as large-scale quantum Ising and transverse field spin models of up to 50 qubits. Our technique stands to broadly enrich the field of variational quantum algorithms, improving and guaranteeing the performance of these promising, yet often heuristic, methods.
We develop an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with highly anisotropic exchange interactions. Both correlation time and real CPU time are reduced drastically. The algorithm is demonstrated in the layered triangular-lattice antiferromagnetic Ising model. We have obtained the relation between the transition temperature and the exchange interaction parameters, which modifies the result of the chain-mean-field theory.
This work deals with the development and application of novel quantum Monte Carlo methods to simulate fermion-boson models. Our developments are based on the path-integral formalism, where the bosonic degrees of freedom are integrated out exactly to obtain a retarded fermionic interaction. We give an overview of three methods that can be used to simulate retarded interactions. In particular, we develop a novel quantum Monte Carlo method with global directed-loop updates that solves the autocorrelation problem of previous approaches and scales linearly with system size. We demonstrate its efficiency for the Peierls transition in the Holstein model and discuss extensions to other fermion-boson models as well as spin-boson models. Furthermore, we show how with the help of generating functionals bosonic observables can be recovered directly from the Monte Carlo configurations. This includes estimators for the boson propagator, the fidelity susceptibility, and the specific heat of the Holstein model. The algorithmic developments of this work allow us to study the specific heat of the spinless Holstein model covering its entire parameter range. Its key features are explained from the single-particle spectral functions of electrons and phonons. In the adiabatic limit, the spectral properties are calculated exactly as a function of temperature using a classical Monte Carlo method and compared to results for the Su-Schrieffer-Heeger model.