Related papers: Renormalization group decoder for a four-dimension…
The constraint of a progressive decrease in residual renormalization scale dependence with increasing loop order is developed as a method for obtaining bounds on unknown higher-order perturbative corrections to renormalization-group…
The Density Matrix Renormalization Group (DMRG) method with periodic boundary conditions is introduced for two dimensional classical spin models. It is shown that this method is more suitable for derivation of the properties of infinite 2D…
The recent years have seen a growing interest in quantum codes in three dimensions (3D). One of the earliest proposed 3D quantum codes is the 3D toric code. It has been shown that 3D color codes can be mapped to 3D toric codes. The 3D toric…
With the advent of noisy intermediate-scale quantum (NISQ) devices, practical quantum computing has seemingly come into reach. However, to go beyond proof-of-principle calculations, the current processing architectures will need to scale up…
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…
Toric codes are error-correcting codes that are derived from toric varieties, which hold a unique correspondence to integral convex polytopes. In this paper, we focus on integral convex polytopes $P \subseteq \mathbb{R}^2$ and the toric…
We start by discussing some theoretical issues of renormalization group transformations and Monte Carlo renormalization group technique. A method to compute the anomalous dimension is proposed and investigated. As an application, we find…
We present a performant and rigorous algorithm for certifying that a matrix is close to being a projection onto an irreducible subspace of a given group representation. This addresses a problem arising when one seeks solutions to…
The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet…
We have developed a very efficient numerical algorithm of the strong disorder renormalization group method to study the critical behaviour of the random transverse-field Ising model, which is a prototype of random quantum magnets. With this…
We consider the break-up of invariant tori in Hamiltonian systems with two degrees of freedom with a frequency which belongs to a cubic field. We define and construct renormalization-group transformations in order to determine the threshold…
We study analytically and numerically decoding properties of finite rate hypergraph-product quantum LDPC codes obtained from random (3,4)-regular Gallager codes, with a simple model of independent X and Z errors. Several non-trival lower…
We propose a scalable decoding framework for correcting correlated hook errors in stabilizer measurement circuits. Traditional circuit-level decoding attempts to estimate the precise location of faults by constructing an extended Tanner…
Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators,…
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…
Tailored topological stabilizer codes in two dimensions have been shown to exhibit high storage threshold error rates and improved subthreshold performance under biased Pauli noise. Three-dimensional (3D) topological codes can allow for…
In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic,…
A novel algorithm for designing optimized orthonormal transform-matrix codebooks for adaptive transform coding of a non-stationary vector process is proposed. This algorithm relies on a block-wise stationary model of a non-stationary…
We give new constructions of two classes of algebraic code families which are efficiently list decodable with small output list size from a fraction $1-R-\epsilon$ of adversarial errors where $R$ is the rate of the code, for any desired…
Toric codes are a class of $m$-dimensional cyclic codes introduced recently by J. Hansen. They may be defined as evaluation codes obtained from monomials corresponding to integer lattice points in an integral convex polytope $P \subseteq…