Related papers: Quantum Codes and Symplectic Matroids
We establish connections between state tomography, pseudorandomness, quantum state synthesis, and circuit lower bounds. In particular, let $\mathfrak{C}$ be a family of non-uniform quantum circuits of polynomial size and suppose that there…
Recently, many good quantum codes over various finite fields $F_q$ have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly…
Motivated by the recently demonstrated ability to attach quantum dots to polymers at well defined locations, we propose a condensed phase analog of the ion trap quantum computer: a scheme for quantum computation using chemically assembled…
Stochastic matrices and positive maps in matrix algebras proved to be very important tools for analysing classical and quantum systems. In particular they represent a natural set of transformations for classical and quantum states,…
Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. The most prevalent method, stabilizer codes, has been well developed for many varieties of systems, however, largely…
Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s).$ In this paper, the trace representation of any free cyclic $\texttt{R}$-linear code of length $\ell,$ is presented, via the $q$-cyclotomic cosets modulo $\ell,$ when…
Coherence vectors and correlation matrices are important functions frequently used in physics. The numerical calculation of these functions directly from their definitions, which involves Kronecker products and matrix multiplications, may…
The quantum symmetry of a rational quantum field theory is a finite- dimensional multi-matrix algebra. Its representation category, which determines the fusion rules and braid group representations of superselection sectors, is a braided…
We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a CSS code with good correction…
Ordering permutations by containment of inversion sets yields a fascinating partial order on the symmetric group: the weak order. This partial order is, among other things, a semidistributive lattice. As a consequence, every permutation has…
This is a presentation of recent work on quantum permutation groups, complex Hadamard matrices, and the connections between them. A long list of problems is included. We include as well some conjectural statements, about matrix models.
Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…
There is a rich connection between classical error-correcting codes, Euclidean lattices, and chiral conformal field theories. Here we show that quantum error-correcting codes, those of the stabilizer type, are related to Lorentzian lattices…
We derive for a pair of operators on a symplectic space which are adjoints of each other with respect to the symplectic form (that is, they are sympletically adjoint) that, if they are bounded for some scalar product on the symplectic space…
We consider a network model, embedded on the Manhattan lattice, of a quantum localisation problem belonging to symmetry class C. This arises in the context of quasiparticle dynamics in disordered spin-singlet superconductors which are…
We provide a new branching rule from the general linear group $GL_{2n}(\mathbb{C})$ to the symplectic group $Sp_{2n}(\mathbb{C})$ by establishing a simple algorithm which gives rise to a bijection from the set of semistandard tableaux of a…
Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes.…
The Schr\"odinger cat states, constructed from Glauber coherent states and applied for description of qubits are generalized to the kaleidoscope of coherent states, related with regular n-polygon symmetry and the roots of unity. This…
Quantum synchronizable codes are quantum error correcting codes that can correct not only Pauli errors but also errors in block synchronization. The code can be constructed from two classical cyclic codes $\mathcal{C}$, $\mathcal{D}$…
Surface codes are a promising method of quantum error correction and the basis of many proposed quantum computation implementations. However, their efficient decoding is still not fully explored. Recently, approaches based on machine…