arXiv subjects

Linnea Grans-Samuelsson

Publications and source records attributed to Linnea Grans-Samuelsson.

12 recordsLinked to original sources

arXiv2026

Resource-adaptive distributed fault tolerance with very noisy Bell pairs

Distributed architectures have been proposed as a pathway to large-scale quantum computers. Combined with the need for fault-tolerance, such architectures require distributed quantum error correction (DQEC) and distributed logical gates. An important challenge is how to realize DQEC primitives in the setting where interaction between modules is restricted to shared Bell pairs that are significantly noisier than on-chip operations. We extend the framework known as fault tolerance by construction to this setting, deriving different strategies for handling the additional noise. Through fault-improvement we recover conventional entanglement distillation, and also find more dynamical protocols that enable space-time trade-offs. We show that integrated decoding halves the required distillation code distance compared to entanglement distillation implemented using separate decoding, thus requiring significantly fewer Bell pairs. As a main focus of the work, we synthesize efficient circuits for an important primitive in distributed fault tolerance: distributed stabilizer measurements. These circuits can be adapted to resource constraints, e.g. on the Bell pair generation rate or the space available for on-chip auxiliary qubits. Noting that full local fault-tolerance is not always needed to preserve the correct scaling of logical error rates, we further optimize the circuits depending on the surrounding context. We consider in particular the surface code and the color code, both as distributed memories and in the case of lattice surgery across separate modules. Here, robustness to certain hook and readout errors reduces the number of required Bell pairs even further, compared to the context-free setting. We numerically benchmark the resulting implementations under circuit level noise with additional interconnect noise.

quant-ph↗

arXiv2026

Preserving MWPM-Decodability in Fault-Equivalent Rewrites

Decoding a quantum error correction code is generally NP-hard, but corrections must be applied at a high frequency to suppress noise successfully. Matchable codes, like the surface code, exhibit a special structure that makes it possible to efficiently, approximately solve the decoding problem through minimum-weight perfect matching (MWPM). However, this efficiency-enabling property can be lost when constructing implementations for fault-tolerant gadgets such as syndrome-extraction circuits or logical operations. In this work, we take a circuit-centric perspective to formalise how the decoding problem changes when applying ZX rewrites to a ZX diagram with a given detector basis. We demonstrate a set of rewrites that preserve MWPM-decodability of circuits and show that these matchability-preserving rewrites can be used to fault-tolerantly extract quantum circuits from phase-free ZX diagrams. In particular, this allows us to build efficiently decodable, fault-tolerant syndrome-extraction circuits for matchable codes.

quant-ph↗

arXiv2025

A partition function framework for estimating logical error curves in stabilizer codes

Based on the mapping between stabilizer quantum error correcting codes and disordered statistical mechanics models, we define a ratio of partition functions that measures the success probability for maximum partition function decoding, which at the Nishimori temperature corresponds to maximum likelihood (ML) decoding. We show that this ratio differs from the similarly defined order probability and describe the decoding strategy whose success rate is described by the order probability. We refer to the latter as a probabilistic partition function decoding and show that it is the strategy that at zero temperature corresponds to maximum probability (MP) decoding. Based on the difference between the two decoders, we discuss the possibility of a maximum partition function decodability boundary outside the order-disorder phase boundary. At zero temperature, the difference between the two ratios measures to what degree MP decoding can be improved by accounting for degeneracy among maximum probability errors, through methods such as ensembling. We consider in detail the example of the toric code under bitflip noise, which maps to the Random Bond Ising Model. We demonstrate that estimation of logical performance through decoding probability and order probability is more sample efficient than estimation by counting failures of the corresponding decoders, especially in the regime of low noise. We consider both uniform noise and noise where qubits are given individual error rates. The latter noise model lifts the degeneracy among maximum probability errors, but we show that ensembling remains useful as long as it also samples less probable errors. We also consider, in less detail, the color code under bitflip and depolarizing noise.

quant-ph↗

arXiv2024

A fault-tolerant pairwise measurement-based code on eight qubits

We construct a pairwise measurement-based code on eight qubits that is error correcting for circuit noise, with fault distance 3. The code can be implemented on a subset of a rectangular array of qubits with nearest neighbor connectivity of pairwise Pauli measurements, with a syndrome extraction circuit of depth 28. We describe fault-tolerant logical operations on patches of this eight-qubit code that generate the full Clifford group. We estimate the performance under circuit noise both during logical idle and during a logical two-qubit measurement. We estimate the pseudo-threshold to be between $10^{-5}$ and $2\times 10^{-4}$, depending on the amount of noise on idle physical qubits. The use of post-selection in addition to error correction (correcting all degree one faults and rejecting a subset of the higher degree faults) can improve the pseudo-threshold by up to an order of magnitude.

quant-ph↗

arXiv2024

Integrable RG Flows on Topological Defect Lines in 2D Conformal Field Theories

Topological defect lines (TDLs) in two-dimensional conformal field theories (CFTs) are standard examples of generalized symmetries in quantum field theory. Integrable lattice incarnations of these TDLs, such as those provided by spin/anyonic chains, provide a crucial playground to investigate their properties, both analytically and numerically. Here, a family of parameter-dependent integrable lattice models is presented, which realize different TDLs in a given CFT as the parameter is varied. These models are based on the general quantum-inverse scattering construction, and involve inhomogeneities of the spectral parameter. Both defect hamiltonians and (defect) line operators are obtained in closed form. By varying the inhomogeneities, renormalization group flows between different TDLs (such as the Verlinde lines associated with the Virasoro primaries $(1,s)$ and $(s,1)$ in diagonal minimal CFTs) are then studied using different aspects of the Bethe-ansatz as well as ab-initio numerical techniques. Relationships with the anisotropic Kondo model as well as its non-Hermitian version are briefly discussed

hep-th↗

arXiv2024

Improved Pairwise Measurement-Based Surface Code

We devise a new realization of the surface code on a rectangular lattice of qubits utilizing single-qubit and nearest-neighbor two-qubit Pauli measurements and three auxiliary qubits per plaquette. This realization gains substantial advantages over prior pairwise measurement-based realizations of the surface code. It has a short operation period of 4 steps and our performance analysis for a standard circuit noise model yields a high fault-tolerance threshold of approximately $0.66\% $. The syndrome extraction circuits avoid bidirectional hook errors, so we can achieve full code distance by choosing appropriate boundary conditions. We also construct variants of the syndrome extraction circuits that entirely prevent hook errors, at the cost of larger circuit depth. This achieves full distance regardless of boundary conditions, with only a modest decrease in the threshold. Furthermore, we propose an efficient strategy for dealing with dead components (qubits and measurements) in our surface code realization, which can be adopted more generally for other surface code realizations. This new surface code realization is highly optimized for Majorana-based hardware, accounting for constraints imposed by layouts and the implementation of measurements, making it competitive with the recently proposed Floquet codes.

quant-ph↗

arXiv2023

Lattice Realizations of Topological Defects in the critical (1+1)-d Three-State Potts Model

Topological/perfectly-transmissive defects play a fundamental role in the analysis of the symmetries of two dimensional conformal field theories (CFTs). In the present work, spin chain regularizations for these defects are proposed and analyzed in the case of the three-state Potts CFT. In particular, lattice versions for all the primitive defects are presented, with the remaining defects obtained from the fusion of the primitive ones. The defects are obtained by introducing modified interactions around two given sites of an otherwise homogeneous spin chain with periodic boundary condition. The various primitive defects are topological on the lattice except for one, which is topological only in the scaling limit. The lattice models are analyzed using a combination of exact diagonalization and density matrix renormalization group techniques. Low-lying energy spectra for different defect Hamiltonians as well as entanglement entropy of blocks located symmetrically around the defects are computed. The latter provides a convenient way to compute the $g$-function which characterizes various defects. Finally, the eigenvalues of the line operators in the "crossed channel'' and fusion of different defect lines are also analyzed. The results are all in agreement with expectations from conformal field theory.

hep-th↗

arXiv2023

From combinatorial maps to correlation functions in loop models

In two-dimensional statistical physics, correlation functions of the O(N) and Potts models may be written as sums over configurations of non-intersecting loops. We define sums associated to a large class of combinatorial maps (also known as ribbon graphs). We allow disconnected maps, but not maps that include monogons. Given a map with n vertices, we obtain a function of the moduli of the corresponding punctured Riemann surface. Due to the map's combinatorial (rather than topological) nature, that function is single-valued, and we call it an n-point correlation function. We conjecture that in the critical limit, such functions form a basis of solutions of certain conformal bootstrap equations. They include all correlation functions of the O(N) and Potts models, and correlation functions that do not belong to any known model. We test the conjecture by counting solutions of crossing symmetry for four-point functions on the sphere.

hep-th↗

arXiv2022

Global symmetry and conformal bootstrap in the two-dimensional $O(n)$ model

We define the two-dimensional $O(n)$ conformal field theory as a theory that includes the critical dilute and dense $O(n)$ models as special cases, and depends analytically on the central charge. For generic values of $n\in\mathbb{C}$, we write a conjecture for the decomposition of the spectrum into irreducible representations of $O(n)$. We then explain how to numerically bootstrap arbitrary four-point functions of primary fields in the presence of the global $O(n)$ symmetry. We determine the needed conformal blocks, including logarithmic blocks, including in singular cases. We argue that $O(n)$ representation theory provides upper bounds on the number of solutions of crossing symmetry for any given four-point function. We study some of the simplest correlation functions in detail, and determine a few fusion rules. We count the solutions of crossing symmetry for the $30$ simplest four-point functions. The number of solutions varies from $2$ to $6$, and saturates the bound from $O(n)$ representation theory in $21$ out of $30$ cases.

hep-th↗

arXiv2021

The action of the Virasoro algebra in quantum spin chains. I. The non-rational case

We investigate the action of discretized Virasoro generators, built out of generators of the lattice Temperley-Lieb algebra ("Koo-Saleur generators"[arXiv:hep-th/9312156]), in the critical XXZ quantum spin chain. We explore the structure of the continuum-limit Virasoro modules at generic central charge for the XXZ vertex model, paralleling [arXiv:2007.11539] for the loop model. We find again indecomposable modules, but this time not logarithmic ones. The limit of the Temperley-Lieb modules $\mathcal{W}_{j,1}$ for $j\neq 0$ contains pairs of "conjugate states" with conformal weights $(h_{r,s},h_{r,-s})$ and $(h_{r,-s},h_{r,s})$ that give rise to dual structures: Verma or co-Verma modules. The limit of $\mathcal{W}_{0,\mathfrak{q}^{\pm2}}$ contains diagonal fields $(h_{r,1},h_{r,1})$ and gives rise to either only Verma or only co-Verma modules, depending on the sign of the exponent in $\mathfrak{q}^{\pm 2}$. In order to obtain matrix elements of Koo-Saleur generators at large system size $N$ we use Bethe ansatz and Quantum Inverse Scattering methods, computing the form factors for relevant combinations of three neighbouring spin operators. Relations between form factors ensure that the above duality exists already at the lattice level. We also study in which sense Koo-Saleur generators converge to Virasoro generators. We consider convergence in the weak sense, investigating whether the commutator of limits is the same as the limit of the commutator? We find that it coincides only up to the central term. As a side result we compute the ground-state expectation value of two neighbouring Temperley-Lieb generators in the XXZ spin chain.

hep-th↗

arXiv2021

The action of the Virasoro algebra in the two-dimensional Potts and loop models at generic $Q$

The spectrum of conformal weights for the CFT describing the two-dimensional critical $Q$-state Potts model (or its close cousin, the dense loop model) has been known for more than 30 years. However, the exact nature of the corresponding $\hbox{Vir}\otimes\overline{\hbox{Vir}}$ representations has remained unknown up to now. Here, we solve the problem for generic values of $Q$. This is achieved by a mixture of different techniques: a careful study of "Koo--Saleur generators" [arXiv:hep-th/9312156], combined with measurements of four-point amplitudes, on the numerical side, and OPEs and the four-point amplitudes recently determined using the "interchiral conformal bootstrap" in [arXiv:2005.07258] on the analytical side. We find that null-descendants of diagonal fields having weights $(h_{r,1},h_{r,1})$ (with $r\in \mathbb{N}^*$) are truly zero, so these fields come with simple $\hbox{Vir}\otimes\overline{\hbox{Vir}}$ ("Kac") modules. Meanwhile, fields with weights $(h_{r,s},h_{r,-s})$ and $(h_{r,-s},h_{r,s})$ (with $r,s\in\mathbb{N}^*$) come in indecomposable but not fully reducible representations mixing four simple $\hbox{Vir}\otimes\overline{\hbox{Vir}}$ modules with a familiar "diamond" shape. The "top" and "bottom" fields in these diamonds have weights $(h_{r,-s},h_{r,-s})$, and form a two-dimensional Jordan cell for $L_0$ and $\bar{L}_0$. This establishes, among other things, that the Potts-model CFT is logarithmic for $Q$ generic. Unlike the case of non-generic (root of unity) values of $Q$, these indecomposable structures are not present in finite size, but we can nevertheless show from the numerical study of the lattice model how the rank-two Jordan cells build up in the infinite-size limit.

hep-th↗

arXiv2020

Four-point geometrical correlation functions in the two-dimensional $Q$-state Potts model: connections with the RSOS models

The "bootstrap determination" of the geometrical correlation functions in the two-dimensional Potts model proposed in a paper [arXiv:1607.07224] was later shown in [arXiv:1809.02191] to be incorrect, the actual spectrum of the model being considerably more complex than initially conjectured. We provide in this paper a geometrical interpretation of the four-point functions built in [arXiv:1607.07224], and explain why the results obtained by these authors, albeit incorrect, appeared so close to those of their numerical simulations of the Potts model. Our strategy is based on a cluster expansion of correlation functions in RSOS minimal models, and a subsequent numerical and algebraic analysis of the corresponding $s$-channel spectrum, in full analogy with our early work on the Potts model [arXiv:1809.02191]. Remarkable properties of the lattice amplitudes are uncovered, which explain in particular the truncation of the spectrum of [arXiv:1809.02191] to the much simpler one of the RSOS models, and which will be used in a forthcoming paper to finally determine the geometric four-point functions of the Potts model itself.

hep-th↗