pith. sign in

arxiv: 2509.17110 · v1 · submitted 2025-09-21 · ❄️ cond-mat.stat-mech

Efficient simulation of a pair of dissipative qubits antiferromagnetically coupled

Francesco G. Capone , Giulio De Filippis , Vittorio Cataudella , Antonio de Candia This is my paper

Pith reviewed 2026-05-18 14:41 UTC · model grok-4.3

classification ❄️ cond-mat.stat-mech
keywords dissipative qubitsquantum Monte Carlocluster algorithmsfrustrated Ising modelOhmic dissipationantiferromagnetic couplingTrotter-Suzuki decompositionKandel-Domany algorithm
0
0 comments X

The pith

The Kandel-Domany cluster algorithm with long-range plaquette decompositions efficiently simulates a pair of antiferromagnetically coupled dissipative qubits.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper demonstrates an efficient way to perform quantum Monte Carlo simulations for two qubits that are antiferromagnetically coupled to each other and each coupled to its own Ohmic dissipative bath. The quantum system is mapped to a classical frustrated Ising model on a double chain with long-range interactions. Conventional Swendsen-Wang cluster updates become inefficient because clusters do not respect the spin correlations induced by frustration. In contrast, the Kandel-Domany method, when applied to carefully chosen plaquette decompositions, avoids this problem and runs much faster, with longer-range plaquettes working best when dissipation is strong.

Core claim

Due to frustration in the mapped Ising model, the standard Swendsen-Wang cluster algorithm suffers from severe inefficiency because of a mismatch between spin correlations and cluster connectivity. The Kandel-Domany approach is extremely effective, and partitioning the double-chain into long-range plaquettes minimizes the weight of graphs containing antiferromagnetic bonds, leading to superior performance in Monte Carlo simulations especially at high dissipation levels.

What carries the argument

The Kandel-Domany cluster algorithm applied to different types of plaquette decompositions of the frustrated long-range double-chain Ising lattice obtained after integrating out the Ohmic bath.

If this is right

  • Monte Carlo simulations of dissipative quantum systems can reach larger sizes and stronger dissipation without critical slowing down.
  • Optimized plaquette choices reduce the computational cost for studying equilibrium properties of the qubit pair.
  • The method provides a practical tool for exploring the phase diagram or dynamics in the presence of frustration and dissipation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar plaquette-based cluster methods might improve simulations of larger arrays of dissipative qubits or other frustrated quantum spin systems.
  • This efficiency gain could enable studies of entanglement or coherence times in open quantum systems that were previously computationally inaccessible.
  • The approach may generalize to other baths or coupling types beyond Ohmic dissipation.

Load-bearing premise

The Trotter-Suzuki decomposition and exact integration of the Ohmic bath produce an Ising model that correctly captures the equilibrium statistics of the original quantum dissipative dynamics.

What would settle it

Comparing the Monte Carlo results from this method against exact solutions or other numerical methods for small systems at varying dissipation strengths; disagreement would indicate the approach does not faithfully represent the quantum system.

Figures

Figures reproduced from arXiv: 2509.17110 by Antonio de Candia, Francesco G. Capone, Giulio De Filippis, Vittorio Cataudella.

Figure 1
Figure 1. Figure 1: FIG. 1. Geometry of the triangular plaquettes [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. All possible graphs [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Geometry of the rectangular plaquette [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. All graphs [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Geometry of the bi-rectangular plaquette [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Autocorrelation time [PITH_FULL_IMAGE:figures/full_fig_p008_6.png] view at source ↗
read the original abstract

We investigate the efficiency of different quantum Monte Carlo simulations of a pair of antiferromagnetically coupled qubits in an Ohmic dissipative environment. Using a Trotter-Suzuky decomposition and integrating out the degrees of freedom of the thermal bath, the model maps onto a frustrated long-range double-chain Ising lattice. We prove that: i) due to frustration, the conventional Swendsen-Wang approach to cluster dynamics turns out to suffer from a severe inefficiency, stemming from the mismatch between spin correlations and cluster connectivity; ii) the Kandel-Domany approach is extremely effective in the study of dissipative quantum qubits. We partition the double-chain into different types of plaquettes and minimize the weight of graphs containing antiferromagnetic bonds by using both analytic and numerical approaches. Monte Carlo simulation results show that ``long range'' plaquette decompositions are more efficient than the ``local'' ones, especially for high levels of dissipation.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper maps a pair of antiferromagnetically coupled qubits in an Ohmic bath to a frustrated long-range double-chain Ising model via Trotter-Suzuki decomposition and exact bath integration. It proves that the Swendsen-Wang cluster algorithm is severely inefficient due to frustration-induced mismatch between spin correlations and cluster connectivity, while the Kandel-Domany approach with analytically and numerically optimized plaquette decompositions (especially long-range ones) is highly effective, as confirmed by Monte Carlo simulations showing superior performance at high dissipation levels.

Significance. If the mapped discrete-time Ising model faithfully reproduces the continuous-time quantum dissipative dynamics, this provides a concrete algorithmic advance for simulating small frustrated dissipative quantum systems, with potential relevance to quantum information and decoherence studies. The analytic minimization of graph weights for plaquettes and the direct runtime/acceptance-rate comparisons are strengths that support the efficiency claims without relying on fitted parameters.

major comments (2)
  1. [Mapping and Trotter-Suzuki decomposition] Mapping and Trotter-Suzuki section: The efficiency advantage of long-range plaquette decompositions is demonstrated on the mapped Ising model, but no explicit convergence tests with Trotter number M are reported for autocorrelation times or relative efficiencies as M → ∞. This is load-bearing for the central claim that the method efficiently simulates the original quantum qubits, particularly at strong dissipation where long-range couplings dominate.
  2. [Kandel-Domany approach and plaquette decompositions] Kandel-Domany plaquette analysis: The analytic minimization of weights for graphs containing antiferromagnetic bonds is presented as parameter-free in some cases, but it is unclear from the description whether this minimization is performed independently per Trotter slice or accounts for the full long-range interactions across the double chain; this affects whether the reported superiority scales correctly with dissipation strength.
minor comments (2)
  1. [Abstract] Abstract: Typo 'Trotter-Suzuky' should be corrected to 'Trotter-Suzuki'.
  2. [Monte Carlo simulation results] Simulation results: The Monte Carlo comparisons would benefit from explicit reporting of error bars, number of independent runs, and finite-size scaling details to strengthen the efficiency claims.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the positive overall assessment. We respond to each major comment below.

read point-by-point responses

  1. Referee: [Mapping and Trotter-Suzuki decomposition] Mapping and Trotter-Suzuki section: The efficiency advantage of long-range plaquette decompositions is demonstrated on the mapped Ising model, but no explicit convergence tests with Trotter number M are reported for autocorrelation times or relative efficiencies as M → ∞. This is load-bearing for the central claim that the method efficiently simulates the original quantum qubits, particularly at strong dissipation where long-range couplings dominate.

    Authors: We agree that explicit checks of convergence in M are necessary to substantiate the efficiency claims for the underlying continuous-time quantum dynamics. Although the Trotter-Suzuki error vanishes systematically as M increases and the mapping is standard, we will add new Monte Carlo runs in the revised manuscript that track autocorrelation times and relative efficiencies versus M at fixed strong dissipation. These data will confirm that the superiority of the long-range plaquette decompositions persists in the large-M limit. revision: yes

  2. Referee: [Kandel-Domany approach and plaquette decompositions] Kandel-Domany plaquette analysis: The analytic minimization of weights for graphs containing antiferromagnetic bonds is presented as parameter-free in some cases, but it is unclear from the description whether this minimization is performed independently per Trotter slice or accounts for the full long-range interactions across the double chain; this affects whether the reported superiority scales correctly with dissipation strength.

    Authors: The weight minimization (both analytic and numerical) is performed on the full long-range double-chain Ising model after bath integration, so that all inter-slice couplings are included simultaneously. The plaquette decompositions are therefore chosen globally rather than slice by slice. We will clarify this point explicitly in the revised text, including a brief description of how the long-range terms enter the graph-weight optimization. revision: partial

Circularity Check

0 steps flagged

No circularity: standard mapping and direct efficiency measurements

full rationale

The derivation begins with the standard Trotter-Suzuki decomposition plus exact bath integration to obtain the frustrated long-range Ising model; this mapping is not derived from or fitted to the efficiency metric being studied. Efficiency is then quantified by direct Monte Carlo runtime, acceptance rates, and cluster statistics on the resulting lattice. The claimed mismatch between spin correlations and Swendsen-Wang cluster connectivity is exhibited explicitly rather than defined into existence, and the superiority of Kandel-Domany plaquette decompositions is demonstrated by numerical comparison of those same observables. No load-bearing step reduces a reported prediction to a self-citation, a fitted parameter renamed as output, or an ansatz smuggled through prior work by the same authors. The analysis is therefore self-contained against external benchmarks of algorithmic performance.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central efficiency claims rest on the standard Trotter-Suzuki approximation for the quantum-to-classical mapping and the assumption that the Ohmic bath can be integrated out exactly to produce the long-range Ising interactions; no new free parameters are introduced beyond those already present in the spin-boson model.

axioms (2)
  • standard math Trotter-Suzuki decomposition converges to the correct quantum dynamics in the limit of infinite slices
    Invoked in the mapping step described in the abstract
  • domain assumption The Ohmic spectral density allows exact integration of bath degrees of freedom yielding long-range Ising couplings
    Core step that produces the frustrated double-chain Ising lattice

pith-pipeline@v0.9.0 · 5697 in / 1525 out tokens · 51628 ms · 2026-05-18T14:41:08.364931+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

  1. [1]

    long-range

    Within this framework, the efficiency of the algorithm increases when the clusters predominantly consist of strongly correlated spins. A cluster algorithm is characterized, for any pair of spin and bond configu- rations {Si}, C , by a weightW sb {Si}, C [17]. In the following, we define⟨·⟩as the conventional thermal aver- age and⟨·⟩ sb as the average over...

    work page 1987

  2. [2]

    M. A. Nielsen and I. L. Chuang,Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th ed. (Cambridge University Press, Cambridge, 2010)

    work page 2010

  3. [3]

    Gisin, G

    N. Gisin, G. Ribordy, W. Tittel, and H. Zbinden, Rev. Mod. Phys.74, 145 (2002)

    work page 2002

  4. [4]

    Weiss,Quantum Dissipative Systems, 4th ed

    U. Weiss,Quantum Dissipative Systems, 4th ed. (World Scientific Publishing Co., Singapore, 2012)

    work page 2012

  5. [5]

    A. J. Leggett, S. Chakravarty, A. T. Dorsey, M. P. A. Fisher, A. Garg, and W. Zwerger, Rev. Mod. Phys.59, 1 (1987)

    work page 1987

  6. [6]

    Chakravarty and J

    S. Chakravarty and J. Rudnick, Phys. Rev. Lett.75, 501 (1995)

    work page 1995

  7. [7]

    V¨ olker, Phys

    K. V¨ olker, Phys. Rev. B58, 1862 (1998)

    work page 1998

  8. [8]

    J. M. Kosterlitz, Phys. Rev. Lett.37, 1577 (1976)

    work page 1976

  9. [9]

    Winter and H

    A. Winter and H. Rieger, Phys. Rev. B90, 224401 (2014)

    work page 2014

  10. [10]

    De Filippis, A

    G. De Filippis, A. de Candia, A. S. Mishchenko, L. M. Cangemi, A. Nocera, P. A. Mishchenko, M. Sassetti, R. Fazio, N. Nagaosa, and V. Cataudella, Phys. Rev. B 104, L060410 (2021), arXiv:2103.16222 [cond-mat.stat- mech]

    work page arXiv 2021

  11. [11]

    R. H. Swendsen and J.-S. Wang, Phys. Rev. Lett.58, 86 (1987)

    work page 1987

  12. [12]

    Coniglio, F

    A. Coniglio, F. Di Liberto, and G. Monroy, Phys. Rev. B44, 12605 (1991)

    work page 1991

  13. [13]

    Kandel, R

    D. Kandel, R. Ben-Av, and E. Domany, Phys. Rev. Lett. 65, 941 (1990)

    work page 1990

  14. [14]

    Kandel and E

    D. Kandel and E. Domany, Phys. Rev. B43, 8539 (1991)

    work page 1991

  15. [15]

    Luijten and H

    E. Luijten and H. Meßingfeld, Physical Review Letters 86, 5305 (2001)

    work page 2001

  16. [16]

    Luijten, inComputer Simulation Studies in Condensed-Matter Physics XII, edited by D

    E. Luijten, inComputer Simulation Studies in Condensed-Matter Physics XII, edited by D. Lan- dau, S. Lewis, and H. Sch¨ uttler (Springer, 2000) pp. 86–99

    work page 2000

  17. [17]

    J. L. Cardy, Journal of Physics A: Mathematical and General14, 1407 (1981)

    work page 1981

  18. [18]

    Cataudella, G

    V. Cataudella, G. Franzese, M. Nicodemi, and A. Coniglio, Phys. Rev. E54, 175 (1996), arXiv:cond- mat/9604169

    work page arXiv 1996

  19. [19]

    Cataudella, G

    V. Cataudella, G. Franzese, M. Nicodemi, A. Scala, and A. Coniglio, Phys. Rev. Lett.72, 1541 (1994)

    work page 1994

  20. [20]

    C. M. Fortuin and P. W. Kasteleyn, Physica57, 536 (1972)

    work page 1972

  21. [21]

    Coniglio and W

    A. Coniglio and W. Klein, J. Phys. A13, 2775 (1980)

    work page 1980

  22. [22]

    Coniglio, F

    A. Coniglio, F. di Liberto, G. Monroy, and F. Peruggi, J. Phys. A22, L837 (1989)

    work page 1989

  23. [23]

    W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling,Numerical Recipes in C: The Art of Scientific Computing, 2nd ed. (Cambridge University Press, 1992)

    work page 1992