相关论文: Quantum self-dual codes and symmetric matrices

This is the third in a sequence of papers in which we construct a quantum version of the Kirwan map from the equivariant quantum cohomology of a smooth polarized complex projective variety with the action of a connected complex reductive…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

Decomposition of (finite-dimensional) operators in terms of orthogonal bases of matrices has been a standard method in quantum physics for decades. In recent years, it has become increasingly popular because of various methodologies applied…

We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, and (iii) a certain random variable on the…

One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes. In the past 36 years there have been hundreds of papers written about generalizations and applications of this…

The CSS code construction is a powerful framework used to express features of a quantum code in terms of a pair of underlying classical codes. Its subsystem extension allows for similar expressions, but the general case has not been fully…

We show how procedures which can correct phase and amplitude errors can be directly applied to correct errors due to quantum entanglement. We specify general criteria for quantum error correction, introduce quantum versions of the Hamming…

Four circulant codes form a special class of $2$-generator, index $4$, quasi-cyclic codes. Under some conditions on their generator matrices they can be shown to be self-dual. Artin primitive root conjecture shows the existence of an…

Hopping cyclic codes (HCCs) are (non-linear) cyclic codes with the additional property that the $n$ cyclic shifts of every given codeword are all distinct, where $n$ is the code length. Constant weight binary hopping cyclic codes are also…

One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers.…

A definition of quantum singularity for the case of static spacetimes has recently been extended to conformally static spacetimes. Here the theory behind quantum singularities in conformally static spacetimes is reviewed, and then applied…

The asymptotic safety program assumes that quantum gravity becomes renormalizable through ultraviolet fixed points in metric-based couplings. We demonstrate that this approach {encounters fundamental symmetry violations} across multiple…

The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on the…

We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere…

The canonical approach to Riemannian quantum gravity is reviewed with reference to local supersymmetry, to the classical boundary-value problem arising from the Hartle-Hawking quantum state, and particularly for (anti-)self-dual geometries.…

Let $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ be the sets of quadratic forms and symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$, respectively. The orbits of $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ under a…

Two-level quantum systems, qubits, are not the only basis for quantum computation. Advantages exist in using qudits, d-level quantum systems, as the basic carrier of quantum information. We show that color codes, a class of topological…

The article has two parts. The first part is devoted to proving a singular version of the logarithmic Kodaira-Akizuki-Nakano vanishing theorem of Esnault and Viehweg. This is then used to prove other vanishing theorems. In the second part…

We study general maps from the space of rational CFTs with a fixed chiral algebra and associated Chern-Simons (CS) theories to the space of qudit stabilizer codes with a fixed generalized Pauli group. We consider certain natural constraints…

This paper has been withdrawn. See quant-ph/9806031 for a discussion.