Related papers: Poincar\'e Duality and Multiplicative Structures o…

We introduce a class of 3D color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) color codes into stacked codes and back. The stacked code allows…

The topological framework of circuit topology has recently been introduced to complement knot theory and to help in understanding the physics of molecular folding. Naturally evolved linear molecular chains, such as proteins and nucleic…

Let $T$ be the circle group and let $LT$ be its loop group. We formulate and investigate several topological aspects of the $LT$-equivariant index theory for proper $LT$-spaces, where proper $LT$-spaces are infinite-dimensional manifolds…

Multi-loop scattering amplitudes constitute a serious bottleneck in current high-energy physics computations. Obtaining new integrand level representations with smooth behaviour is crucial for solving this issue, and surpassing the…

Scalable modern-time fault-tolerant quantum computation and quantum communication in a network employ a large number of physical qubits. For example, IBM is reported to have made a 127-qubit quantum computer. Unlike classical computation,…

The "quantum duality principle" states that the quantization of a Lie bialgebra - via a quantum universal enveloping algebra (QUEA) - provides also a quantization of the dual Lie bialgebra (through its associated formal Poisson group) - via…

The Loop-Tree Duality (LTD) is a novel perturbative method in QFT that establishes a relation between loop-level and tree-level scattering amplitudes. This is achieved by directly applying the Residue Theorem to the loop-energy-integration.…

Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…

Fault-tolerant logical entangling gates are essential for scalable quantum computing, but are limited by the error rates and overheads of physical two-qubit gates and measurements. To address this limitation, we introduce phantom…

We compare the sheaf-theoretic and singular chain versions of Poincare duality for intersection homology, showing that they are isomorphic via naturally defined maps. Similarly, we demonstrate the existence of canonical isomorphisms between…

Motivated by their central role in fault-tolerant quantum computation, we study the sets of gates of the third-level of the Clifford hierarchy and their distinguished subsets of `nearly diagonal' semi-Clifford gates. The Clifford hierarchy…

Quantum error correction (QEC) is crucial for realizing scalable quantum technologies, and topological quantum error correction (TQEC) has emerged as the most experimentally advanced paradigm of QEC. Existing homological and topological…

We describe the E-infinity algebra structure on the complex of singular cochains of a topological space, in the context of sheaf theory. As a first application, for any algebraic variety we define a weight filtration compatible with its…

Classification of quantum spinor fields according to quantum bilinear covariants is introduced in a context of quantum Clifford algebras on Minkowski spacetime. Once the bilinear covariants are expressed in terms of algebraic spinor fields,…

A notion of Poincar\'e series was introduced by A.Campillo et al. It was developed by Delgado and Gusein-Zade for a multi-index filtration corresponding to the sequence of blow-ups. The present paper suggests the way to generalize the…

Large-scale quantum computation requires to be performed in the fault-tolerant manner. One crucial challenge of fault-tolerant quantum computing (FTQC) is reducing the overhead of implementing logical gates. Recently work proposed…

Inclusive deep inelastic scattering factorization combines two features that are often treated separately: an asymptotic reconstruction of the current-current matrix element from hard and long-distance data, and an invariance under finite…

We present the bicycle architecture, a modular quantum computing framework based on high-rate, low-overhead quantum LDPC codes identified in prior work. For two specific bivariate bicycle codes with distances 12 and 18, we construct…

We investigate the coboundary expansion property of tensor product codes, known as product expansion, which plays an important role in recent constructions of good quantum LDPC codes and classical locally testable codes. Prior research has…

Existence of quantum low-density parity-check (LDPC) codes whose minimal distance scales linearly with the number of qubits is a major open problem in quantum information. Its practical interest stems from the need to protect information in…