Related papers: Orthogonality for Quantum Latin Isometry Squares
With the advent of quantum computers, researchers are exploring if quantum mechanics can be leveraged to solve important problems in ways that may provide advantages not possible with conventional or classical methods. A previous work by…
Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…
A simple construction of quaternary hermitian self-orthogonal codes with parameters $[2n+1,k+1]$ and $[2n+2,k+2]$ from a given pair of self-orthogonal $[n,k]$ codes, and its link to quantum codes is considered. As an application, an optimal…
A Latin square is reduced if its first row and column are in natural order. For Latin squares of a particular order $n$ there are four possible different parities. We confirm a conjecture of Stones and Wanless by showing asymptotic equality…
Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure…
In this paper we analyze and discuss the historical and philosophical development of the notion of logical possibility focusing on its specific meaning in classical and quantum mechanics. Taking into account the logical structure of quantum…
Quantum coherence is an important quantum resource and it is intimately related to various research fields. The geometric coherence is a coherence measure both operationally and geometrically. We study the trade-off relation of geometric…
In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native…
A recent notion in theoretical physics is that not all quantum theories arise from quantising a classical system. Also, a given quantum model may possess more than just one classical limit. These facts find strong evidence in string duality…
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…
Geometric and holonomic quantum computation utilizes intrinsic geometric properties of quantum-mechanical state spaces to realize quantum logic gates. Since both geometric phases and quantum holonomies are global quantities depending only…
In the classical world one can construct two identical systems which have identical behavior and give identical measurement results. We show this to be impossible in the quantum domain. We prove that after the same quantum measurement two…
This article, showing that almost all objects in the title are asymmetric, is re-typed from a manuscript I wrote somewhere around 1980 (after the papers of Bang and Friedland on the permanent conjecture but before those of Egorychev and…
In the first part of this paper we analyze possible quantum computational capacities due to quantum queries associated with equi-partitions of pure orthogonal states. Special emphasis is given to the parity of product states and to…
Constructive and nonconstructive techniques are employed to enumerate Latin squares and related objects. It is established that there are (i) 2036029552582883134196099 main classes of Latin squares of order 11; (ii)…
It is known that $N(n)$, the maximum number of mutually orthogonal latin squares of order $n$, satisfies the lower bound $N(n) \ge n^{1/14.8}$ for large $n$. For $h\ge 2$, relatively little is known about the quantity $N(h^n)$, which…
The rigorous resource framework of quantum coherence has been set up recently and excited a wide variety of interests. Here we show that a quantum cavity optomechanical system, as an emerging platform, can behave with a certain value of…
We introduce a condition on arrays in some way maximally distinct from Latin square condition, as well as some other conditions on algebras, graphs and $0,1$-matrices. We show that these are essentially the same structures, generalising a…
In these proceedings, we review recent advances in applying quantum computing to lattice field theory. Quantum computing offers the prospect to simulate lattice field theories in parameter regimes that are largely inaccessible with the…
In this paper a construction of quantum codes from self-orthogonal algebraic geometry codes is provided. Our method is based on the CSS construction as well as on some peculiar properties of the underlying algebraic curves, named Swiss…