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

Global scheme of sweeping cluster algorithm to sample among topological sectors

Zheng Yan

Published May 31, 2022• 46 citations
arXivHTMLPDF

Abstract

Local constraint is closely related to the gauge field, so constrained models are usually effective low energy descriptions and important in condensed matter physics. On the other hand, local restriction hinders the application of numerical algorithms. In addition to the computational difficulties of the constraints, the various topological sectors which cannot be connected through local operators are also one of the key computational difficulties. Taking a quantum dimer model as an example in this paper, we construct a global scheme based on a sweeping cluster Monte Carlo method, which can sample among different topological sectors. In principle, this method can be generalized to other models.

DOI
10.1103/physrevb.105.184432

Related papers

Improved Sweeping Cluster Algorithm for Quantum Dimer Model

Zheng Yan

Quantum dimer models~(QDMs) featured by strong geometric constraint are effective low energy descriptions of many quantum spin systems. The geometric restriction described by local gauge field, hinders the application of numerical algorithms. Before sweeping cluster method was applied in world-line quantum Monte Carlo (QMC) algorithm, there is only projector QMC which obey the constraints and could be used for calculation on QDMs. However, the projector QMC for QDMs has some drawbacks, e.g., it is not effective when the parameter interval away from Rokhsar-Kivelson (RK) point. That's because the projector method still lacks a cluster update to improve its efficiency. Although sweeping cluster algorithm improves the update for these systems, it also only works in one winding (topological) sector. In this paper, we improve the sweeping cluster method to sample in different winding sectors.

•Nov 16, 2020•5 citations

Quantum optimization within lattice gauge theory model on a quantum simulator

Zheng Yan, Zheng Zhou, Yan-Hua Zhou +4 more

Abstract Simulating lattice gauge theory (LGT) Hamiltonian and its nontrivial states by programmable quantum devices has attracted numerous attention in recent years. Rydberg atom arrays constitute one of the most rapidly developing arenas for quantum simulation and quantum computing. The $${{\mathbb{Z}}}_{2}$$ Z 2 LGT and topological order has been realized in experiments while the U (1) LGT is being worked hard on the way. States of LGT have local constraints and are fragmented into several winding sectors with topological protection. It is therefore difficult to reach the ground state in target sector for experiments, and it is also an important task for quantum topological memory. Here, we propose a protocol of sweeping quantum annealing (SQA) for searching the ground state among topological sectors. With the quantum Monte Carlo method, we show that this SQA has linear time complexity of size with applications to the antiferromagnetic transverse field Ising model, which has emergent U (1) gauge fields. This SQA protocol can be realized easily on quantum simulation platforms such as Rydberg array and D-wave annealer. We expect this approach would provide an efficient recipe for resolving the topological hindrances in quantum optimization and the preparation of quantum topological state.

arXiv:2105.07134•npj Quantum Information•Sep 15, 2023•20 citations

Sweeping cluster algorithm for quantum spin systems with strong geometric restrictions

Zheng Yan, Yongzheng Wu, Chenrong Liu +3 more

Quantum spin systems with strong geometric restrictions give rise to rich quantum phases such as valence bond solids and spin liquid states. However, the geometric restrictions often hamper the application of sophisticated numerical approaches. Based on the stochastic series expansion method, we develop an efficient and exact quantum Monte Carlo ``sweeping cluster'' algorithm which automatically satisfies the geometrical restrictions. Here we use the quantum dimer model as a benchmark to demonstrate the reliability and power of this algorithm. Comparing to existing numerical methods, we can obtain higher accuracy results for a wider parameter region and much more substantial system sizes.

arXiv:1809.05792•Physical review. B./Physical review. B•Apr 23, 2019•64 citations

Efficient Quantum Monte Carlo through Cluster Expansions

Jorge Sánchez-Segovia, Álvaro M. Alhambra

The sign problem remains a major obstacle to extending the success of Monte Carlo methods to generic quantum many-body systems. A powerful alternative relies on cluster expansions, which provide convergent representations of free energies and related quantities, with applications ranging from tensor network contractions to quantum dynamics and circuits. Within their convergence regime, these expansions often yield deterministic polynomial-time algorithms. However, such methods require exhaustive enumeration of connected clusters, leading to a computational overhead of $(N\varepsilon^{-1})^{\mathcal{O}(\logΔ)}$, where $N$ is the system size, $\varepsilon$ the desired precision, and $Δ$ the interaction-graph degree. This becomes particularly severe in long-range systems, where $Δ\equiv N$, resulting in quasi-polynomial runtimes. Here, we introduce a Markov chain algorithm that samples cluster expansions directly in the space of connected clusters, replacing deterministic enumeration by Monte Carlo sampling. Because sampling occurs in an abstract cluster space rather than a physical configuration space, the conventional exponential sign problem is absent within the convergence regime. For general polymer models, we establish an FPRAS with runtime $\tilde{\mathcal{O}}(N^4\varepsilon^{-3})$. For quantum partition functions at temperatures $β\leqβ_{\mathrm{sampling}}\equiv\mathcal{O}(1)$, this improves to $\tilde{\mathcal{O}}(N^{3+1/D}\varepsilon^{-3})$, where $D$ is the lattice dimension. The framework directly applies to long-range quantum systems with interactions $\propto1/r^α$, including $2$-local models with $α>2D$.

quant-pharXiv:2610.03893•Oct 6, 2026•0 citations

Sweeping quantum annealing algorithm for constrained optimization problems

Zheng Yan, Zheng Zhou, Yan-Cheng Wang +2 more

Abstract As a typical quantum computing algorithm, quantum annealing is widely used in the optimization of glass-like problems to find the best solution. However, the optimization problems in constrained complex systems usually involve topological structures, and the performance of the quantum annealing algorithm is still largely unknown. Here, we take an Ising system as a typical example with local constraints accompanied by intrinsic topological properties that can be implemented on quantum computing platforms such as the D-wave machine, and study the effectiveness of the quantum annealing algorithm in its optimization and compare it with that of the thermal annealing. We find that although conventional quantum annealing is difficult for the optimization of constrained topological problems, a generalized algorithm --- the sweeping quantum annealing method --- can be designed and solve the problem with better efficiency than both conventional quantum and thermal annealing algorithms. The sweeping quantum annealing algorithm, therefore, opens up a promising avenue for quantum computing of constrained problems and can be readily employed on the optimizations in quantum material design, engineering, and even social sciences.

•May 25, 2021•2 citations

Improvement of numerical algorithm for quantum dimer models

Ruixiao Cao

The quantum dimer model has been continuously discussed both theoretically and numerically.Numerical methods have been developed on the quantum dimer model, but efficiency has been an essential problem due to the strong geometry constraint of the model.Recently, sweeping cluster update based on stochastic series expansion has shown power on quantum Monte Carlo on quantum dimer model.In this thesis, we propose improvements to the sweeping cluster update algorithm, which can reduce the time complexity by smartly choosing the next operator to update on.We also show a general framework to extend the current method to a broader range of models, including dimermonomer and monomer-monomer operators.As a benchmark of our algorithm, we simulate the quantum dimer model at finite temperatures in a wide region of parameters.By measuring several order parameters by the quantum Monte Carlo and using the finitescaling analysis, the phase boundary of the quantum dimer model on the square lattice can be estimated numerically, and the phase diagram in V /J < 1 region is determined accurately.We find evidence to support the expectation of previous research that the phase transition at finite temperature of quantum dimer model shows similar behavior to the Kosterlitz-Thouless transition in the classical dimer model.The intermediate plaquette phase may not exist, and the columnar phase in the classical model extends up to the Rokhsar-Kivelson point.iii This thesis is supported by Prof. Synge Todo and Prof. Hidemaro Suwa.I greatly appreciate the discussions we had during my doctoral years with them.Many ideas have been discussed in the meetings and then applied to the model for interesting numerical results.I also appreciated

•Sep 22, 2023•0 citations
Local constraint is closely related to the gauge field, so constrained models are usually effective low energy descriptions and important in condensed matter physics. On the other hand, local restriction hinders the application of numerical algorithms. In addition to the computational difficulties of the constraints, the various topological sectors which cannot be connected through local operators are also one of the key computational difficulties. Taking a quantum dimer model as an example in this paper, we construct a global scheme based on a sweeping cluster Monte Carlo method, which can sample among different topological sectors. In principle, this method can be generalized to other models.
Quantum dimer models~(QDMs) featured by strong geometric constraint are effective low energy descriptions of many quantum spin systems. The geometric restriction described by local gauge field, hinders the application of numerical algorithms. Before sweeping cluster method was applied in world-line quantum Monte Carlo (QMC) algorithm, there is only projector QMC which obey the constraints and could be used for calculation on QDMs. However, the projector QMC for QDMs has some drawbacks, e.g., it is not effective when the parameter interval away from Rokhsar-Kivelson (RK) point. That's because the projector method still lacks a cluster update to improve its efficiency. Although sweeping cluster algorithm improves the update for these systems, it also only works in one winding (topological) sector. In this paper, we improve the sweeping cluster method to sample in different winding sectors.
Abstract Simulating lattice gauge theory (LGT) Hamiltonian and its nontrivial states by programmable quantum devices has attracted numerous attention in recent years. Rydberg atom arrays constitute one of the most rapidly developing arenas for quantum simulation and quantum computing. The Z2{{\mathbb{Z}}}_{2}Z2​ Z 2 LGT and topological order has been realized in experiments while the U (1) LGT is being worked hard on the way. States of LGT have local constraints and are fragmented into several winding sectors with topological protection. It is therefore difficult to reach the ground state in target sector for experiments, and it is also an important task for quantum topological memory. Here, we propose a protocol of sweeping quantum annealing (SQA) for searching the ground state among topological sectors. With the quantum Monte Carlo method, we show that this SQA has linear time complexity of size with applications to the antiferromagnetic transverse field Ising model, which has emergent U (1) gauge fields. This SQA protocol can be realized easily on quantum simulation platforms such as Rydberg array and D-wave annealer. We expect this approach would provide an efficient recipe for resolving the topological hindrances in quantum optimization and the preparation of quantum topological state.
Quantum spin systems with strong geometric restrictions give rise to rich quantum phases such as valence bond solids and spin liquid states. However, the geometric restrictions often hamper the application of sophisticated numerical approaches. Based on the stochastic series expansion method, we develop an efficient and exact quantum Monte Carlo ``sweeping cluster'' algorithm which automatically satisfies the geometrical restrictions. Here we use the quantum dimer model as a benchmark to demonstrate the reliability and power of this algorithm. Comparing to existing numerical methods, we can obtain higher accuracy results for a wider parameter region and much more substantial system sizes.
The sign problem remains a major obstacle to extending the success of Monte Carlo methods to generic quantum many-body systems. A powerful alternative relies on cluster expansions, which provide convergent representations of free energies and related quantities, with applications ranging from tensor network contractions to quantum dynamics and circuits. Within their convergence regime, these expansions often yield deterministic polynomial-time algorithms. However, such methods require exhaustive enumeration of connected clusters, leading to a computational overhead of (Nε−1)O(log⁡Δ)(N\varepsilon^{-1})^{\mathcal{O}(\logΔ)}(Nε−1)O(logΔ), where NNN is the system size, ε\varepsilonε the desired precision, and ΔΔΔ the interaction-graph degree. This becomes particularly severe in long-range systems, where Δ≡NΔ\equiv NΔ≡N, resulting in quasi-polynomial runtimes. Here, we introduce a Markov chain algorithm that samples cluster expansions directly in the space of connected clusters, replacing deterministic enumeration by Monte Carlo sampling. Because sampling occurs in an abstract cluster space rather than a physical configuration space, the conventional exponential sign problem is absent within the convergence regime. For general polymer models, we establish an FPRAS with runtime O~(N4ε−3)\tilde{\mathcal{O}}(N^4\varepsilon^{-3})O~(N4ε−3). For quantum partition functions at temperatures β≤βsampling≡O(1)β\leqβ_{\mathrm{sampling}}\equiv\mathcal{O}(1)β≤βsampling​≡O(1), this improves to O~(N3+1/Dε−3)\tilde{\mathcal{O}}(N^{3+1/D}\varepsilon^{-3})O~(N3+1/Dε−3), where DDD is the lattice dimension. The framework directly applies to long-range quantum systems with interactions ∝1/rα\propto1/r^α∝1/rα, including 222-local models with α>2Dα>2Dα>2D.
Abstract As a typical quantum computing algorithm, quantum annealing is widely used in the optimization of glass-like problems to find the best solution. However, the optimization problems in constrained complex systems usually involve topological structures, and the performance of the quantum annealing algorithm is still largely unknown. Here, we take an Ising system as a typical example with local constraints accompanied by intrinsic topological properties that can be implemented on quantum computing platforms such as the D-wave machine, and study the effectiveness of the quantum annealing algorithm in its optimization and compare it with that of the thermal annealing. We find that although conventional quantum annealing is difficult for the optimization of constrained topological problems, a generalized algorithm --- the sweeping quantum annealing method --- can be designed and solve the problem with better efficiency than both conventional quantum and thermal annealing algorithms. The sweeping quantum annealing algorithm, therefore, opens up a promising avenue for quantum computing of constrained problems and can be readily employed on the optimizations in quantum material design, engineering, and even social sciences.
The quantum dimer model has been continuously discussed both theoretically and numerically.Numerical methods have been developed on the quantum dimer model, but efficiency has been an essential problem due to the strong geometry constraint of the model.Recently, sweeping cluster update based on stochastic series expansion has shown power on quantum Monte Carlo on quantum dimer model.In this thesis, we propose improvements to the sweeping cluster update algorithm, which can reduce the time complexity by smartly choosing the next operator to update on.We also show a general framework to extend the current method to a broader range of models, including dimermonomer and monomer-monomer operators.As a benchmark of our algorithm, we simulate the quantum dimer model at finite temperatures in a wide region of parameters.By measuring several order parameters by the quantum Monte Carlo and using the finitescaling analysis, the phase boundary of the quantum dimer model on the square lattice can be estimated numerically, and the phase diagram in V /J < 1 region is determined accurately.We find evidence to support the expectation of previous research that the phase transition at finite temperature of quantum dimer model shows similar behavior to the Kosterlitz-Thouless transition in the classical dimer model.The intermediate plaquette phase may not exist, and the columnar phase in the classical model extends up to the Rokhsar-Kivelson point.iii This thesis is supported by Prof. Synge Todo and Prof. Hidemaro Suwa.I greatly appreciate the discussions we had during my doctoral years with them.Many ideas have been discussed in the meetings and then applied to the model for interesting numerical results.I also appreciated