Related papers: Orthogonality for Quantum Latin Isometry Squares
A latin square of order $n$ is an $n\times n$ array of $n$ symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of $n$ entries such that no two entries share the same row, column…
Multi-twisted (MT) codes were introduced as a generalization of quasi-twisted (QT) codes. QT codes have been known to contain many good codes. In this work, we show that codes with good parameters and desirable properties can be obtained…
In order to use quantum devices for computations, it is necessary to understand the intricacies of the theoretical description. To this end, we provide several novel constructions useful for the comprehension of quantum mechanics from the…
We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both…
The characterization of the quantum ensemble is a fundamental issue in quantum information theory and foundations. The ensemble is also useful for various quantum information processing. To characterize the quantum ensemble, in this…
Designing quantum error correcting codes that promise a high error threshold, low resource overhead and efficient decoding algorithms is crucial to achieve large-scale fault-tolerant quantum computation. The concatenated quantum Hamming…
Latin tableaux are a generalization of Latin squares, which first appeared in the early 2000's in a paper of Chow, Fan, Goemans, and Vondr\'{a}k. Here, we extend the notion of isotopy, a permutation group action, from Latin squares to Latin…
We find that the m-separability and k-partite entanglement of a multipartite quantum system is correlated with quantum coherence of the same with respect to complete orthonormal bases, distinguishable under local operations and classical…
For the first time it is shown that the logic of quantum mechanics can be derived from Classical Physics. An orthomodular lattice of propositions, characteristic of quantum logic, is constructed for manifolds in Einstein's theory of general…
We study geometric consistency relations between angles on 3-dimensional (3D) circular quadrilateral lattices -- lattices whose faces are planar quadrilaterals inscribable into a circle. We show that these relations generate canonical…
Quantum coherence, nonlocality, and contextuality are key resources for quantum advantage in metrology, communication, and computation. We introduce a graph-based approach to derive classicality inequalities that bound local,…
Quantum machine learning techniques have been proposed as a way to potentially enhance performance in machine learning applications. In this paper, we introduce two new quantum methods for neural networks. The first one is a quantum…
Quantum computation is the suitable orthogonal encoding of possibly holistic functional properties into state vectors, followed by a projective measurement.
It is well known that quantum codes can be constructed through classical symplectic self-orthogonal codes. In this paper, we give a kind of Gilbert-Varshamov bound for symplectic self-orthogonal codes first and then obtain the…
In this paper, we study the construction of quantum codes by applying Steane-enlargement to codes from the Hermitian curve. We cover Steane-enlargement of both usual one-point Hermitian codes and of order bound improved Hermitian codes. In…
We use a greedy probabilistic method to prove that for every $\epsilon > 0$, every $m\times n$ Latin rectangle on $n$ symbols has an orthogonal mate, where $m=(1-\epsilon)n$. That is, we show the existence of a second Latin rectangle such…
Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits…
We study the geometric measure of quantum coherence recently proposed in [Phys. Rev. Lett. 115, 020403 (2015)]. Both lower and upper bounds of this measure are provided. These bounds are shown to be tight for a class of important coherent…
Quantum coherence with respect to orthonormal bases has been studied extensively in the past few years. Recently, Bischof, et al. [Phys. Rev. Lett. 123, 110402 (2019)] generalized it to the case of general positive operator-valued measure…
We introduce a new quantum decoder based on a variant of the pretty good measurement, but defined via an alternative matrix quotient. We use this decoder to show new lower bounds on the error exponent both in the one-shot and asymptotic…