arXiv subjects

Julio C. Magdalena de la Fuente

Publications and source records attributed to Julio C. Magdalena de la Fuente.

9 recordsLinked to original sources

arXiv2026

Efficiently estimating failure rates of fault-tolerant logical non-Clifford blocks

Useful quantum computation requires the fault-tolerant implementations of a universal gate set which are generically not efficiently simulable. We devise an algebraic framework that allows for efficient sampling from the measurement distribution of fault-tolerant circuits that implement diagonal logic gates in the third level of the Clifford hierarchy. Upon successful sampling we also provide sufficient conditions for decoding success. The resulting estimate for the logical failure rate is an overestimate, which becomes more accurate for blocks that are fault tolerant against arbitrary local errors. The non-Clifford simulation overhead is independent of the number of logical qubits, making the method particularly attractive for large-scale simulations. The framework is based on viewing the non-Clifford gates in the circuit as a cohomology invariant of an underlying spacetime fault complex. The method can also be interfaced with Clifford simulators to simulate larger fault-tolerant circuits and algorithmic subroutines.

quant-ph↗

arXiv2026

Planar fault-tolerant circuits for non-Clifford gates on the 2D color code

We introduce a family of scalable planar fault-tolerant circuits that implement logical non-Clifford operations on a 2D color code, such as a logical $T$ gate or a logical non-Pauli measurement that prepares a magic $|T\rangle$ state. The circuits are relatively simple, consisting only of physical $T$ gates, $CX$ gates, and few-qubit measurements. They can be implemented with an array of qubits on a 2D chip with nearest-neighbor couplings, and no wire crossings. The construction is based on a spacetime path integral representation of a non-Abelian 2+1D topological phase, which is related to the 3D color code. We turn the path integral into a circuit by expressing it as a spacetime $ZX$ tensor network, and then traversing it in some chosen time direction. We describe in detail how fault tolerance is achieved using a "just-in-time" decoding strategy, for which we repurpose and extend state-of-the-art color-code matching decoders.

quant-ph↗

arXiv2026

High-threshold decoding of non-Pauli codes for 2D universality

Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited connectivity. In this work, we explore a non-Pauli stabilizer code that can be used to complete a universal gate set on topological toric and surface codes in strictly two dimensions. Fault-tolerant syndrome extraction for the non-Pauli code requires mid-circuit $X$ corrections, a key difference to conventional Pauli codes. We construct and benchmark a just-in-time (JIT) matching decoder to reliably decide these corrections. Under a phenomenological error model with equally likely physical and measurement errors, we find a high threshold of $\approx 2.5\,\%$, close to the $\approx 2.9\,\%$ of a decoder with access to the full syndrome history. We also perform a finite-size scaling analysis to estimate how the logical error rate scales below threshold and verify an exponential suppression in both physical error rate and in the system size. A second global decoding step for $Z$ errors is required and the non-Clifford gates in the circuit reduce the threshold from $\approx 2.9\,\%$ to $\approx 1.8\,\%$ with a naive decoder. We show how $Z$ decoding can be improved using knowledge of the $X$ corrections, pushing the threshold to $\approx 2.2\,\%$. Our results suggest non-Clifford logic in 2D codes could perform comparably to 2D quantum memory. Our formalism for efficient benchmarking and decoding directly generalizes to a broader family of CSS codes whose $X$ stabilizers are twisted by diagonal Clifford operators, and spacetime versions thereof, defined by CSS-like circuits enriched by $CCZ$, $CS$, and $T$ gates.

quant-ph↗

arXiv2026

Topological stabilizer models on continuous variables

We construct a family of two-dimensional topological stabilizer codes on continuous variable (CV) degrees of freedom, which generalize homological rotor codes and the toric-GKP code. Our topological codes are built using the concept of boson condensation -- we start from a parent stabilizer code based on an $\mathbb{R}$ gauge theory and condense various bosonic excitations. This produces a large class of topological CV stabilizer codes, including ones that are characterized by the anyon theories of $U(1)_{2n}\times U(1)_{-2m}$ Chern-Simons theories, for arbitrary pairs of positive integers $(n,m)$. Most notably, this includes anyon theories that are non-chiral and nevertheless do not admit a gapped boundary. It is widely believed that such anyon theories cannot be realized by any stabilizer model on finite-dimensional systems. We conjecture that these CV codes go beyond codes obtained from concatenating a topological qudit code with a local encoding into CVs, and thus, constitute the first example of topological codes that are intrinsic to CV systems. Moreover, we study the Hamiltonians associated to the topological CV stabilizer codes and show that, although they have a gapless spectrum, they can become gapped with the addition of a quadratic perturbation. We show that similar methods can be used to construct a gapped Hamiltonian whose anyon theory agrees with a $U(1)_2$ Chern-Simons theory. Our work initiates the study of scalable stabilizer codes that are intrinsic to CV systems and highlights how error-correcting codes can be used to design and analyze many-body systems of CVs that model lattice gauge theories.

quant-ph↗

arXiv2025

Universal fault tolerant quantum computation in 2D without getting tied in knots

We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose codespace is stabilized by Clifford operators. We formulate a path integral framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits. We also show an equivalence between our approach and prior proposals where a 2D array of qubits reproduces the action of a transversal gate in a 3D stabilizer code over time, thus, establishing a new connection between 3D codes and 2D non-Abelian topological phases. We prove a threshold theorem for our protocols under local stochastic circuit noise using a just-in-time decoder to correct the non-Abelian code.

quant-ph↗

arXiv2025

XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime

Analyzing and developing new quantum error-correcting schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols constitutes an important cornerstone. In this work, we present a graphical formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We showcase the formalism on new Floquet codes derived from topological subsystem codes, which we call XYZ ruby codes. Based on the projective symmetries of the building blocks of the tensor network we develop a framework of Pauli flows. Pauli flows allow for a graphical understanding of all quantities entering an error correction analysis of a circuit, including different types of QEC experiments, such as memory and stability experiments. We lay out how to derive a well-defined decoding problem from the tensor network representation of a protocol and its Pauli flows alone, independent of any stabilizer code or fixed circuit. Importantly, this framework applies to all Clifford protocols and encompasses both measurement- and circuit-based approaches to fault tolerance. We apply our method to our new family of dynamical codes which are in the same topological phase as the 2+1d color code, making them a promising candidate for low-overhead logical gates. In contrast to its static counterpart, the dynamical protocol applies a Z3 automorphism to the logical Pauli group every three timesteps. We highlight some of its topological properties and comment on the anyon physics behind a planar layout. Lastly, we benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments and find competitive circuit-level noise thresholds of 0.18%, comparable with other Floquet codes and 2+1d color codes.

quant-ph↗

arXiv2025

Bulk-to-boundary anyon fusion from microscopic models

Topological quantum error correction based on the manipulation of the anyonic defects constitutes one of the most promising frameworks towards realizing fault-tolerant quantum devices. Hence, it is crucial to understand how these defects interact with external defects such as boundaries or domain walls. Motivated by this line of thought, in this work, we study the fusion events between anyons in the bulk and at the boundary in fixed-point models of 2+1-dimensional non-chiral topological order defined by arbitrary fusion categories. Our construction uses generalized tube algebra techniques to construct a bi-representation of bulk and boundary defects. We explicitly derive a formula to calculate the fusion multiplicities of a bulk-to-boundary fusion event for twisted quantum double models and calculate some exemplary fusion events for Abelian models and the (twisted) quantum double model of S3, the simplest non-Abelian group-theoretical model. Moreover, we use the folding trick to study the anyonic behavior at non-trivial domain walls between twisted S3 and twisted Z2 as well as Z3 models. A recurring theme in our construction is an isomorphism relating twisted cohomology groups to untwisted ones. The results of this work can directly be applied to study logical operators in two-dimensional topological error correcting codes with boundaries described by a twisted gauge theory of a finite group.

quant-ph↗

arXiv2024

Dynamical weight reduction of Pauli measurements

Many routines that one might want to run on a quantum computer can benefit from adaptive circuits, relying on mid-circuit measurements and feed-forward operations. Any such measurement has to be compiled into a sequence of elementary gates involving only a small number of qubits. In this work, we formalize dynamical weight reduction (DWR) schemes in which a high-weight Pauli measurement is decomposed into a sequence of measurements of smaller weight at the cost of adding additional auxiliary qubits. We first present our main method, deforming a ZX diagram that represents the measurement we want to compile. We then construct a general recipe that constructs a DWR on a given connectivity whenever the underlying connectivity graph fulfills certain necessary conditions. Further, we construct a family of DWR schemes using a given number of auxiliary qubits with indications that the schemes we present are optimal in terms of spacetime resource overheads needed for a DWR. We highlight three examples that achieve a constant time or a constant space overhead, respectively. Finally, we discuss different trade-offs of space and time overhead and how they might be chosen differently on different levels of abstraction within a (fault-tolerant) quantum computation. This work showcases the flexibility in compiling a measurement circuit in terms of lower-weight measurements using deformations of ZX diagrams and can find applications in quantum error correction, quantum simulation as well as near-term quantum computing tasks where the quality of a computation highly depends on the physical implementation of a given logical operation.

quant-ph↗

arXiv2024

Anyon condensation and the color code

The manipulation of topologically-ordered phases of matter to encode and process quantum information forms the cornerstone of many approaches to fault-tolerant quantum computing. Here we demonstrate that fault-tolerant logical operations in these approaches can be interpreted as instances of anyon condensation. We present a constructive theory for anyon condensation and, in tandem, illustrate our theory explicitly using the color-code model. We show that different condensation processes are associated with a general class of domain walls, which can exist in both space- and time-like directions. This class includes semi-transparent domain walls that condense certain subsets of anyons. We use our theory to classify topological objects and design novel fault-tolerant logic gates for the color code. As a final example, we also argue that dynamical `Floquet codes' can be viewed as a series of condensation operations. We propose a general construction for realising planar dynamically driven codes based on condensation operations on the color code. We use our construction to introduce a new Calderbank-Shor Steane-type Floquet code that we call the Floquet color code.

quant-ph↗