Related papers: Renormalization group decoder for a four-dimension…
We examine the performance of the single-mode GKP code and its concatenation with the toric code for a noise model of Gaussian shifts, or displacement errors. We show how one can optimize the tracking of errors in repeated noisy error…
To date, a great deal of attention has focused on characterizing the performance of quantum error correcting codes via their thresholds, the maximum correctable physical error rate for a given noise model and decoding strategy. Practical…
We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give numerical evidence for a noise threshold of 1.3% for the {4,5}-hyperbolic surface code in a phenomenological noise model (as compared to…
We analyze the properties of a 2D topological code derived by concatenating the [[4, 2, 2]] code with the toric/surface code, or alternatively by removing check operators from the 2D square-octagon or 4.8.8 color code. We show that the…
We consider a two-dimensional quantum memory of qubits on a torus which encode the extended Fibonaccistring-net code, and devise strategies for error correction when those qubits are subjected to depolarizing noise.Building on the concept…
A field theoretic renormalization group method is presented which is capable of dealing with crossover problems associated with a change in the upper critical dimension. The method leads to flow functions for the parameters and coupling…
Criticality and symmetry, studied by the renormalization groups, lie at the heart of modern physics theories of matters and complex systems. However, surveying these properties with massive experimental data is bottlenecked by the…
Multiparticle production in (2+1) dimensions is investigated. We show that in a small region around the threshold the perturbation theory becomes unapplicable due to infrared divergencies in a class of Feynman graphs with rescattering in…
Kitaev's toric code is one of the most prominent models for fault-tolerant quantum computation, currently regarded as the leading solution for connectivity constrained quantum technologies. Significant effort has been recently devoted to…
We propose an algorithm for the computational homogenization of locally periodic hyperelastic structures undergoing large deformations due to external quasi-static loading. The algorithm performs clustering of macroscopic deformations into…
The development and use of large-scale quantum computers relies on integrating quantum error-correcting (QEC) schemes into the quantum computing pipeline. A fundamental part of the QEC protocol is the decoding of the syndrome to identify a…
Quantum codes excel at correcting local noise but fail to correct leakage faults that excite qubits to states outside the computational space. Aliferis and Terhal have shown that an accuracy threshold exists for leakage faults using gadgets…
A linear error correcting code is a subspace of a finite-dimensional space over a finite field with a fixed coordinate system. Such a code is said to be locally recoverable with locality $r$ if, for every coordinate, its value at a codeword…
Matrix models of 2D quantum gravity are either exactly solvable for matter of central charge $ c\leq 1, $ or not understood. It would be useful to devise an approximate scheme which would be reasonable for the known cases and could be…
Starting from a well defined local Lagrangian, we analyze the renormalization group equations in terms of the two different arbitrary scales associated with the regularization procedure and with the physical renormalization of the bare…
We discuss the application of the method of characteristics to the renormalization-group equation for the perturbative QCD series within the electron-positron annihilation cross-section. We demonstrate how one such renormalization-group…
We propose and analyze a hierarchical quantum error correction (QEC) scheme that concatenates hypergraph product (HGP) codes with rotated surface codes, which is compatible with quantum computers with only nearest-neighbor interactions. The…
We develop a new renormalization group approach to the large-N limit of matrix models. It has been proposed that a procedure, in which a matrix model of size (N-1) \times (N-1) is obtained by integrating out one row and column of an N…
A class of two-bit bit flipping algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these algorithms operating in…
This paper argues that the ideas underlying the renormalization group technique used to characterize phase transitions in condensed matter systems could be useful for distinguishing computational complexity classes. The paper presents a…