Related papers: On the Wilsonian meaning of quantum error correcti…
The mechanism of describing quantum states by standard probability (tomographic one) instead of wave function or density matrix is elucidated. Quantum tomography is formulated in an abstract Hilbert space framework, by means of the identity…
We present new applications on $q$-binomials, also known as Gaussian binomial coefficients. Our main theorems determine cardinalities of certain error-correcting codes based on Varshamov-Tenengolts codes and prove a curious phenomenon…
Quantum corrections to holographic entanglement entropy require knowledge of the bulk quantum state. In this paper, we derive a novel dual prescription for the generalized entropy that allows us to interpret the leading quantum corrections…
Holonomic quantum computation exploits a quantum state's non-trivial, matrix-valued geometric phase (holonomy) to perform fault-tolerant computation. Holonomies arising from systems where the Hamiltonian traces a continuous path through…
We introduce a general class of codes which includes several well-known classes of deletion/insertion correcting codes as special cases. For example, the Helberg code, the Levenshtein code, the Varshamov--Tenengolts code, and most variants…
Based on the group structure of a unitary Lie algebra, a scheme is provided to systematically and exhaustively generate quantum error correction codes, including the additive and nonadditive codes. The syndromes in the process of…
We describe the on-shell method to deriving the Renormalization Group (RG) evolution of Wilson coefficients of high dimensional operators at one loop, which is a necessary part in the on-shell construction of the Standard Model Effective…
We present general conditions for quantum error suppression for Hamiltonian-based quantum computation using subsystem codes. This involves encoding the Hamiltonian performing the computation using an error detecting subsystem code and the…
We consider the covariant formulation of the kaon mixing in the context of the propagator method. It results important to check the possibility of a sizable effect in the vacuum regeneration of kaons. We discuss all those terms which may…
Bosonic rotation codes, introduced here, are a broad class of bosonic error-correcting codes based on phase-space rotation symmetry. We present a universal quantum computing scheme applicable to a subset of this class--number-phase…
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
The process of renormalization to eliminate divergences arising in quantum field theory is not uniquely defined; one can always perform a finite renormalization, rendering finite perturbative results ambiguous. The consequences of making…
We introduce the concept of quantum locally recoverable codes (qLRCs) with intersecting recovery sets. We derive a singleton-like bound for these codes by leveraging the additional information provided by the intersecting recovery sets.…
A structural explanation of the coupling constants in the standard model, i.e the fine structure constant and the Weinberg angle, and of the gauge fixing contributions is given in terms of symmetries and representation theory. The coupling…
I study the incorporation of renormalization group (RG) improved BFKL kernels in the Balitsky-Kovchegov (BK) equation which describes parton saturation. The RG improvement takes into account important parts of the next-to-leading and higher…
The Wilsonian renormalization group (RG) requires Euclidean signature. The conformal factor of the metric then has a wrong-sign kinetic term, which has a profound effect on its RG properties. Generically for the conformal sector, complete…
We generalize the construction of quantum error-correcting codes from GF(4)-linear codes by Calderbank et al. to p^m-state systems. Then we show how to determine the error from a syndrome. Finally we discuss a systematic construction of…
We explain an algorithm that approximately but efficiently assesses particular parity-check error-correcting codes of large, but finite, blocklength. This algorithm is based on the ``renormalization-group'' approach from physics: the idea…
A quantum error correcting code is a subspace $\mathcal{C}$ such that allowed errors acting on any state in $\mathcal{C}$ can be corrected. A quantum code for which state recovery is only required up to a logical rotation within…
We develop an alternative derivation of the renormalized expression for the one-loop soliton quantum mass corrections in (1+1)-dimensional scalar field theories. We regularize implicitly such quantity by subtracting and adding its…