Related papers: Quantum codes from a new construction of self-orth…
We utilize the symmetry groups of regular tessellations on two-dimensional surfaces of different constant curvatures, including spheres, Euclidean planes and hyperbolic planes, to encode a qubit or qudit into the physical degrees of freedom…
We show how to construct a compact quantum metric space from a proper continuous length function on an \'etale groupoid with compact unit space, where the unit space additionally has the structure of a compact metric space. Using compactly…
In this paper we introduce a new quantum algebra which specializes to the $2$-toroidal Lie algebra of type $A_1$. We prove that this quantum toroidal algebra has a natural triangular decomposition, a (topological) Hopf algebra structure and…
A theory of principal bundles possessing quantum structure groups and classical base manifolds is presented. Structural analysis of such quantum principal bundles is performed. A differential calculus is constructed, combining differential…
Let $R$ be the finite chain ring $\mathbb{F}_{p^{2m}}+{u}\mathbb{F}_{p^{2m}}$, where $\mathbb{F}_{p^{2m}}$ is the finite field with $p^{2m}$ elements, $p$ is a prime, $m$ is a non-negative integer and ${u}^{2}=0.$ In this paper, we firstly…
We construct toric codes on various high-dimensional manifolds. Assuming a conjecture in geometry we find families of quantum CSS stabilizer codes on $N$ qubits with logarithmic weight stabilizers and distance $N^{1-\epsilon}$ for any…
Quantum Latin squares are a generalization of classical Latin squares in quantum field and have wide applications in unitary error bases, mutually unbiased bases, $k$-uniform states and quantum error correcting codes. In this paper, we put…
Paths in an appropriate geometry are usually used as trajectories of test particles in geometric theories of gravity. It is shown that non-symmetric geometries possess some interesting quantum features. Without carrying out any quantization…
On logarithmic paper some real algebraic curves look like smoothed broken lines. Moreover, the broken lines can be obtained as limits of those curves. The corresponding deformation can be viewed as a quantization, in which the broken line…
We introduce twisted unitary $t$-groups, a generalization of unitary $t$-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that…
In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…
We present a construction scheme for quantum error correcting codes. The basic ingredients are a graph and a finite abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph…
We use mirror symmetry, quantum geometry and modularity properties of elliptic curves to calculate the refined free energies in the Nekrasov-Shatashvili limit on non-compact toric Calabi-Yau manifolds, based on del Pezzo surfaces. Quantum…
The design and performance of computer vision algorithms are greatly influenced by the hardware on which they are implemented. CPUs, multi-core CPUs, FPGAs and GPUs have inspired new algorithms and enabled existing ideas to be realized.…
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…
We create a variety of new quantum algorithms that use Grover's algorithm and similar techniques to give polynomial speedups over their classical counterparts. We begin by introducing a set of tools that carefully minimize the impact of…
In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. The design of good curves for this purpose relies on geometrical properties of spherical codes and projections of…
Quantum algorithms have the potential to provide exponential speedups over some of the best known classical algorithms. These speedups may enable quantum devices to solve currently intractable problems such as those in the fields of…
A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it…
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…