相关论文: Symmetric matrices and quantum codes

This work develops a geometric framework for constructing quantum error-correcting codes from weighted projective and orbifold structures, integrating algebraic geometry, divisor theory, and the CSS stabilizer formalism. Beginning with…

We study equivariant Gromov-Witten invariants and quantum cohomology in GKM theory. Building on the localization formula, we prove that the resulting expression is independent of the choice of compatible connection, and provide an…

Typical stabilizer codes aim to solve the general problem of fault-tolerance without regard for the structure of a specific system. By incorporating a broader representation-theoretic perspective, we provide a generalized framework that…

Variables adapted to the quantum dynamics of spherically symmetric models are introduced, which further simplify the spherically symmetric volume operator and allow an explicit computation of all matrix elements of the Euclidean and…

In the present paper we develop a framework in which questions of quantum ergodicity for operators acting on sections of hermitian vector bundles over Riemannian manifolds can be studied. We are particularly interested in the case of…

The correspondence between linear codes and representable matroids is well known. But a similar correspondence between quantum codes and matroids is not known. We show that representable symplectic matroids over a finite field…

We construct explicit algebraic geometry codes built from the Garcia-Stichtenoth function field tower beating the Gilbert-Varshamov bound for alphabet sizes at least 192. Messages are identied with functions in certain Riemann-Roch spaces…

This paper has been withdrawn due to errors found by authors. A correct version of this paper is published in: Tomasz M. Rusin, Wlodek Zawadzki, "Quantum theory of symmetric screening in the Hartree approximation", Phys. stat. sol. (b) 243,…

For quantum error-correcting codes to be realizable, it is important that the qubits subject to the code constraints exhibit some form of limited connectivity. The works of Bravyi & Terhal (BT) and Bravyi, Poulin & Terhal (BPT) established…

Orthogonal geometric constructions are the basis of many many quantum error-correcting codes (QEC), but strict orthogonality constraints limit design flexibility and resource efficiency. We introduce a quasi-orthogonal geometric framework…

We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code.…

We propose a covariant entropy bound in gravitational theories beyond general relativity (GR), using Wald-Jacobson-Myers entropy instead of Bekenstein-Hawking entropy. We first extend the proof of the bound known in 4-dimensional GR to…

While stabilizer tableaus have proven useful as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or algorithm analysis. We introduce a representation of stabilizer codes as…

The Gilbert-Varshamov (GV) lower bound on the maximum cardinality of a q-ary code of length n with minimum Hamming distance at least d can be obtained by application of Turan's theorem to the graph with vertex set {0,1,..,q-1}^n in which…

We prove that the natural isomorphism between GF(2^h) and GF(2)^h induces a bijection between stabiliser codes on n quqits with local dimension q=2^h and binary stabiliser codes on hn qubits. This allows us to describe these codes…

Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp…

This paper has been withdrawn by the authors, due to a flaw in the proof of Theorem 1. This preprint is superseded by quant-ph/0610027, where a correct proof can be found. Thanks to Rainer Siegmund-Schultze for spotting the error.

Recent results of the authors on quantum bounded symmetric domains and quantum Harish-Chandra modules are expounded.

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian…