ParaToric 1.0: Continuous-time quantum Monte Carlo for the toric code in a parallel field

Lode Pollet; Simon M. Linsel

arxiv: 2510.14781 · v3 · submitted 2025-10-16 · 🪐 quant-ph

ParaToric 1.0: Continuous-time quantum Monte Carlo for the toric code in a parallel field

Simon M. Linsel , Lode Pollet This is my paper

Pith reviewed 2026-05-18 06:15 UTC · model grok-4.3

classification 🪐 quant-ph

keywords toric codecontinuous-time quantum Monte Carloparallel fieldfinite temperaturequantum spin liquidlattice gauge theoryquantum error correctionsoftware package

0 comments

The pith

ParaToric implements continuous-time quantum Monte Carlo for the toric code in parallel X and Z fields across multiple lattices.

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

The paper introduces ParaToric, a C++ package for simulating the toric code with both X- and Z-magnetic fields at finite temperature. It implements and extends the continuous-time quantum Monte Carlo algorithm on square, triangular, honeycomb, and cubic lattices with periodic or open boundaries. The package supports snapshot extraction in either basis and is designed to generate training data for methods including lattice gauge theories, quantum simulators, and quantum error correction. Bindings to C/C++ and Python allow integration into other projects, and the code is structured for expansion to new lattices and observables.

Core claim

ParaToric is a C++ package for simulating the toric code in a parallel field at finite temperature. It implements and extends the continuous-time quantum Monte Carlo algorithm of Wu, Deng, and Prokof'ev on the square, triangular, honeycomb, and cubic lattices with either periodic or smooth open boundaries. The package supports arbitrary lattice geometries, custom observables diagonal in the X- or Z-basis, and snapshot extraction in both bases.

What carries the argument

The continuous-time quantum Monte Carlo algorithm of Wu, Deng, and Prokof'ev extended to the toric code Hamiltonian with parallel fields, which samples equilibrium configurations on chosen lattices without time discretization.

If this is right

Simulations become available on square, triangular, honeycomb, and cubic lattices with periodic or open boundaries.
Snapshot data in X and Z bases can be produced for training or benchmarking lattice gauge theories and quantum error correction codes.
The package can be extended to arbitrary lattices and custom observables diagonal in one basis.
Python and C/C++ bindings enable direct use inside other simulation or machine-learning workflows.

Where Pith is reading between the lines

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

The tool could help map finite-temperature phase boundaries of the toric code under competing fields.
Generated configurations might serve as reference states for testing variational or tensor-network methods on topological models.
Open-boundary support could allow direct study of edge modes or defects in finite systems.

Load-bearing premise

The implemented continuous-time quantum Monte Carlo algorithm correctly samples the equilibrium distribution of the toric code Hamiltonian without significant discretization errors or sampling biases for the chosen lattice geometries and boundary conditions.

What would settle it

Direct comparison of computed observables such as magnetization or energy on small periodic lattices against exact diagonalization results for the toric code model.

read the original abstract

We introduce ParaToric, a C++ package for simulating the toric code in a parallel field (i.e., $X$- and $Z$-fields) at finite temperature. We implement and extend the continuous-time quantum Monte Carlo algorithm of Wu, Deng, and Prokof'ev on the square, triangular, honeycomb, and cubic lattices with either periodic or smooth open boundaries. The package is expandable to arbitrary lattice geometries and custom observables diagonal in either the $X$- or $Z$-basis. ParaToric also supports snapshot extraction in both bases, making it ideal for generating training/benchmarking data for other methods, such as lattice gauge theories, cold atom or other quantum simulators, quantum spin liquids, artificial intelligence, and quantum error correction. The software provides bindings to C/C++ and Python, and is thus almost universally integrable into other software projects.

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.

Desk Editor's Note private letter to a colleague

ParaToric is a practical C++ implementation of CTQMC for the toric code in parallel fields on multiple lattices, with useful snapshot features but thin validation details.

read the letter

The main point with this paper is that it delivers a C++ package called ParaToric for running continuous-time quantum Monte Carlo on the toric code with both X and Z fields at finite temperature. The authors implement the algorithm from Wu, Deng, and Prokof'ev and extend it to the toric code on square, triangular, honeycomb, and cubic lattices. They support periodic boundaries as well as smooth open ones, and they include snapshot extraction in either the X or Z basis. The code is set up to handle custom observables and can be expanded to other geometries, with bindings for both C++ and Python. This setup does a good job of providing a ready tool for producing data that could be used in quantum error correction studies, cold atom simulations, or even training AI models on quantum spin liquids. The focus on parallel fields and multiple lattices fills a specific need for finite-temperature work on this model. One area that feels light is the lack of reported checks against exact diagonalization for small systems or against the exactly solvable case when the fields are zero. Those kinds of tests are standard for confirming that the Monte Carlo updates sample correctly across different lattice types and boundary conditions. Without them, it's harder to gauge how solid the implementation is for the new features. Readers who work with topological models or need Monte Carlo samples for benchmarking other methods will find this useful. It's not a big theoretical advance, but a practical one for the subfield. I would recommend sending it to peer review. The referees can assess the code quality and ask for more validation if needed. The work is grounded enough to deserve that step.

Referee Report

1 major / 2 minor

Summary. The manuscript introduces ParaToric 1.0, a C++ package implementing the continuous-time quantum Monte Carlo algorithm of Wu, Deng, and Prokof'ev for the toric code in parallel X- and Z-fields at finite temperature. It supports square, triangular, honeycomb, and cubic lattices with periodic or smooth open boundaries, allows custom observables diagonal in the X- or Z-basis, and includes snapshot extraction. The package provides C/C++ and Python bindings and is described as expandable to arbitrary lattices.

Significance. If the implementation correctly samples the equilibrium distribution, ParaToric would offer a practical tool for finite-temperature studies of topological phases and for generating benchmark data for lattice gauge theories, quantum simulators, spin liquids, AI methods, and quantum error correction. The support for multiple lattices, custom observables, and Python bindings is a clear strength for usability and extensibility.

major comments (1)

[Implementation and results sections (or equivalent)] The manuscript provides no benchmarks or validation against exact diagonalization for small systems, high-temperature series expansions, or the exactly solvable h_x = h_z = 0 limit on the supported lattices and boundary conditions. This verification is required to confirm that geometry-specific operator updates, configuration weights, and measurements are free of sampling biases or discretization artifacts.

minor comments (2)

[Abstract and methods description] The term 'smooth open boundaries' is used without a precise definition or reference to how the boundary conditions are implemented in the code; a short clarification or citation would improve readability.
[Software features section] A table listing the supported observables, their measurement procedures, and any associated computational costs would help users assess the package's capabilities.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their constructive comments and positive evaluation of the potential impact of ParaToric. We address the single major comment below and commit to revisions that strengthen the manuscript.

read point-by-point responses

Referee: [Implementation and results sections (or equivalent)] The manuscript provides no benchmarks or validation against exact diagonalization for small systems, high-temperature series expansions, or the exactly solvable h_x = h_z = 0 limit on the supported lattices and boundary conditions. This verification is required to confirm that geometry-specific operator updates, configuration weights, and measurements are free of sampling biases or discretization artifacts.

Authors: We agree that explicit validation is essential for a software implementation of a continuous-time quantum Monte Carlo algorithm, especially when extending to multiple lattices and boundary conditions. In the revised manuscript we will add a dedicated validation subsection. This will include direct comparisons of ParaToric results against exact diagonalization on small systems (e.g., 2x2 and 3x3 square lattices with periodic boundaries), verification in the exactly solvable h_x = h_z = 0 limit on all supported lattices, and consistency checks with high-temperature series expansions where analytically tractable. We will explicitly demonstrate that the geometry-specific operator updates, configuration weights, and custom observables produce unbiased results free of discretization artifacts. These additions will be placed in the Implementation and Results sections. revision: yes

Circularity Check

0 steps flagged

Software implementation of external CTQMC algorithm exhibits no circular derivations

full rationale

The paper presents ParaToric as a C++ package that implements and extends the continuous-time quantum Monte Carlo method of Wu, Deng, and Prokof'ev (an external citation) for the toric code Hamiltonian on various lattices. The abstract and description contain no original derivations, predictions, fitted parameters, or equations that reduce to the paper's own inputs by construction. Central claims concern code functionality and expandability, which rest on the cited prior algorithm rather than any self-referential chain. This is a standard software-implementation paper whose correctness is benchmarked externally; no load-bearing step collapses into a fit or self-definition.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The package rests on the correctness of the Wu-Deng-Prokof'ev CTQMC algorithm (standard in the field) and standard C++ numerical libraries. No new free parameters, ad-hoc axioms, or invented entities are introduced beyond the model definition itself.

axioms (1)

domain assumption The continuous-time quantum Monte Carlo algorithm of Wu, Deng, and Prokof'ev correctly samples the thermal ensemble of the toric code Hamiltonian.
Invoked when stating that the package implements this algorithm for the target model.

pith-pipeline@v0.9.0 · 5683 in / 1407 out tokens · 25637 ms · 2026-05-18T06:15:57.898043+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

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

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We implement and extend the continuous-time quantum Monte Carlo algorithm of Wu, Deng, and Prokof'ev on the square, triangular, honeycomb, and cubic lattices...
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Observables: anyon_count, fredenhagen_marcu, percolation_probability, staggered_imaginary_times...

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.