Related papers: Orthogonality for Quantum Latin Isometry Squares
We provide a new quantum algorithm that efficiently determines the quality of a least-squares fit over an exponentially large data set by building upon an algorithm for solving systems of linear equations efficiently (Harrow et al., Phys.…
Additive codes and some nonadditive codes use the single and multiple invariant subspaces of the stabilizer G, respectively, to construct quantum codes, so the selection of the invariant subspaces is a key problem. In this paper, I provide…
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…
The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are…
We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat…
We introduce homothetic-BCH codes. These are a family of $q^2$-ary classical codes $\mathcal{C}$ of length $\lambda n_1$, where $\lambda$ and $n_1$ are suitable positive integers such that the punctured code $\mathcal{B}$ of $\mathcal{C}$…
An intercalate in a Latin square is a $2\times2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n\times n$ Latin square. We prove that asymptotically almost surely…
We describe geometrically the classical and quantum inhomogeneous groups $G_0=(SL(2, \BbbC)\triangleright \BbbC^2)$ and $G_1=(SL(2, \BbbC)\triangleright \BbbC^2)\triangleright \BbbC$ by studying explicitly their shape algebras as a spaces…
The no-cloning theorem leads to information-theoretic security in various quantum cryptographic protocols. However, this security typically derives from a possibly weaker property that classical information encoded in certain quantum states…
Several upper bounds on the size of quantum codes are derived using the linear programming approach. These bounds are strengthened for the linear quantum codes.
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical…
We prove that, for all even $n\geq10$, there exists a latin square of order $n$ with at least one transversal, yet all transversals coincide on $ \big\lfloor n/6 \big\rfloor$ entries. These latin squares have at least $ 19 n^2/36 + O(n)$…
Representation of the quantum measurement with the help of non-orthogonal decomposition of unit is presented in the paper for the first time. Methods for solution of the quantum detection and measurement problems based on the suggested…
Ever since E. T. Parker constructed an orthogonal pair of $10\times10$ Latin squares in 1959, an orthogonal triple of $10\times10$ Latin squares has been one of the most sought-after combinatorial designs. Despite extensive work, the…
Do you want to know what an anti-chiece Latin square is? Or what a non-consecutive toroidal modular Latin square is? We invented a ton of new types of Latin squares, some inspired by existing Sudoku variations. We can't wait to introduce…
Orthogonal neural networks have recently been introduced as a new type of neural networks imposing orthogonality on the weight matrices. They could achieve higher accuracy and avoid evanescent or explosive gradients for deep architectures.…
The use of complex geometry allows us to obtain a consistent formulation of octonionic quantum mechanics (OQM). In our octonionic formulation we solve the hermiticity problem and define an appropriate momentum operator within OQM. The…
We present a formulation of quantum mechanics based on orthogonal polynomials. The wavefunction is expanded over a complete set of square integrable basis in configuration space where the expansion coefficients are orthogonal polynomials in…
For integers $n>2$ and $k>0$, an $(n\times n)/k$ semi-Latin square is an $n\times n$ array of $k$-subsets (called blocks) of an $nk$-set (of treatments), such that each treatment occurs once in each row and once in each column of the array.…
It has long been recognized that certain quantum correlations are incompatible with particular assumption about classical causal structure. Given a causal structure of unknown classicality, the presence of such correlations certifies the…