Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1504.02715 · Quantum Information and Computation

Quantum Latin squares and unitary error bases

Benjamin Musto, Jamie Vicary

Published Nov 1, 2016• 8 citations
arXivHTMLPDF

Abstract

In this paper we introduce quantum Latin squares, combinatorial quantum objects which generalize classical Latin squares, and investigate their applications in quantum computer science. Our main results are on applications to unitary error bases (UEBs), basic structures in quantum information which lie at the heart of procedures such as teleportation, dense coding and error correction. We present a new method for constructing a UEB from a quantum Latin square equipped with extra data. Developing construction techniques for UEBs has been a major activity in quantum computation, with three primary methods proposed: shift-and-multiply, Hadamard, and grouptheoretic. We show that our new approach simultaneously generalizes the shift-andmultiply and Hadamard methods. Furthermore, we explicitly construct a UEB using our technique which we prove cannot be obtained from any of these existing methods.

DOI
10.26421/qic16.15-16-4

Related papers

Quantum Latin squares and unitary error bases

Jamie Vicary, Benjamin Musto

In this paper we introduce quantum Latin squares, combinatorial quantum objects which generalize classical Latin squares, and investigate their applications in quantum computer science. Our main results are on applications to unitary error bases (UEBs), basic structures in quantum information which lie at the heart of procedures such as teleportation, dense coding and error correction. We present a new method for constructing a UEB from a quantum Latin square equipped with extra data. Developing construction techniques for UEBs has been a major activity in quantum computation, with three primary methods proposed: shift-and-multiply, Hadamard, and group theoretic. We show that our new approach simultaneously generalizes the shift-and multiply and Hadamard methods. Furthermore, we explicitly construct a UEB using our technique which we prove cannot be obtained from any of these existing methods.

•Nov 1, 2016•44 citations

Quantum Latin squares and unitary error bases

MustoBenjamin, VicaryJamie

In this paper we introduce quantum Latin squares, combinatorial quantum objects which generalize classical Latin squares, and investigate their applications in quantum computer science. Our main re...

Quantum Information and Computation•Nov 1, 2016•1 citation

Quantum Latin squares and quantum functions: applications in quantum information

Benjamin Musto

A central theme of this thesis is the quantization and generalization of objects from areas of mathematics such as set theory and combinatorics with application to quantum information. We represent mathematical objects such as Latin squares or functions as string diagrams over the category of finite-dimensional Hilbert spaces obeying various diagrammatic axioms. This leads to a direct understanding of how these objects arise in quantum mechanics and gives insight into how quantum analogues can be defined. In Part I of this thesis we introduce quantum Latin squares (QLS), quantum objects which generalize the classical Latin squares from combinatorics. We present a new method for constructing a unitary error basis (UEB) from a quantum Latin square equipped with extra data, which we show simultaneously generalizes the existing shift-and-multiply and Hadamard methods. We introduce two different notions of orthogonality for QLS which we use to construct families of mutually unbiased bases and perfect tensors respectively. We also introduce a further generalization of Latin squares called quantum Latin isometry squares. We use these to produce quantum error codes and to give a new way of characterizing UEBs. In Part II we show that maximal families of mutually unbiased bases (MUBs) are characterized in all dimensions by partitioned UEBs, up to a choice of a family of Hadamards. Furthermore, we give a new construction of partitioned UEBs, and thus maximal families of MUBs, from a finite field, which is simpler and more direct than previous proposals. We introduce new tensor diagrammatic characterizations of maximal families of MUBs, partitioned UEBs, and finite fields as algebraic structures defined over Hilbert spaces. In Part III we introduce quantum functions and quantum sets, which quantize the classical notions. We show that these structures form a 2-category QSet. We extend this framework to introduce quantum graphs and quantum homomorphisms which form a 2-category QGraph. We show that these 2-categories capture several different notions of quantum morphism and noncommutative graph from various previous papers in noncommutative topology, quantum non-local games and quantum information. We later use the correspondence between our quantum graph morphisms and those from quantum non-local games to show that pairs of quantum isomorphic graphs with multiple connected components are built up of quantum isomorphisms on those components.

•Jan 1, 2019•0 citations

Exploring quantum teleportation through unitary error bases

Benjamin Musto

Unitary error bases have a great number of applications across quantum information and quantum computation, and are fundamentally linked to quantum teleportation, dense coding and quantum error correction. Werner's combinatorial construction builds a unitary error basis from a family of Hadamard matrices and a Latin square. In this dissertation, I give a new categorical axiomatisation of Latin squares, and use this to give a fully graphical presentation and proof of the correctness of Werner's construction. The categorical approach makes clear that some of the Latin square axioms are unnecessary for the construction to go through, and I propose a generalised construction scheme with the potential to create new classes of unitary error bases.

arXiv:1608.04608•Aug 16, 2016•2 citations

An Overview of Quantum Latin Squares in Quantum Information Theory

Abdul Fatah, Ian McLoughlin, Saim Ghafoor +1 more

Quantum Latin Squares have emerged as mathematical structures of interest in quantum information theory. This paper provides a comprehensive overview of quantum Latin squares. We aim to synthesize the current knowledge for the benefit of researchers in quantum information theory. We begin by establishing the theoretical foundation linking classical Latin squares with their quantum counterparts. This provides insight into their potential applications, particularly in the realm of quantum error correction. Through a detailed examination, we outline known constructions and elucidate the properties of quantum Latin squares, highlighting their role within quantum computing frameworks. We then explore the relationships of quantum Latin squares with mutually unbiased bases and unitary error bases. This underscores their importance in the construction of quantum error correcting codes using mutually orthogonal quantum Latin squares. We give significant focus to a comparative analysis between classical and quantum Latin squares, particularly in their applications to error correcting codes. The applications are analogous to the application of classical Latin squares to classical error correcting codes. This overview aims to not only compile existing research but also to inspire further exploration into Quantum Latin squares and their applications in quantum information theory.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Jul 1, 2024•0 citations

Orthogonality for Quantum Latin Isometry Squares

Benjamin Musto, Jamie Vicary

Goyeneche et al recently proposed a notion of orthogonality for quantum Latin squares, and showed that orthogonal quantum Latin squares yield quantum codes. We give a simplified characterization of orthogonality for quantum Latin squares, which we show is equivalent to the existing notion. We use this simplified characterization to give an upper bound for the number of mutually orthogonal quantum Latin squares of a given size, and to give the first examples of orthogonal quantum Latin squares that do not arise from ordinary Latin squares. We then discuss quantum Latin isometry squares, generalizations of quantum Latin squares recently introduced by Benoist and Nechita, and define a new orthogonality property for these objects, showing that it also allows the construction of quantum codes. We give a new characterization of unitary error bases using these structures.

arXiv:1804.04042•Electronic Proceedings in Theoretical Computer Science•Jan 31, 2019•19 citations
In this paper we introduce quantum Latin squares, combinatorial quantum objects which generalize classical Latin squares, and investigate their applications in quantum computer science. Our main results are on applications to unitary error bases (UEBs), basic structures in quantum information which lie at the heart of procedures such as teleportation, dense coding and error correction. We present a new method for constructing a UEB from a quantum Latin square equipped with extra data. Developing construction techniques for UEBs has been a major activity in quantum computation, with three primary methods proposed: shift-and-multiply, Hadamard, and grouptheoretic. We show that our new approach simultaneously generalizes the shift-andmultiply and Hadamard methods. Furthermore, we explicitly construct a UEB using our technique which we prove cannot be obtained from any of these existing methods.
In this paper we introduce quantum Latin squares, combinatorial quantum objects which generalize classical Latin squares, and investigate their applications in quantum computer science. Our main results are on applications to unitary error bases (UEBs), basic structures in quantum information which lie at the heart of procedures such as teleportation, dense coding and error correction. We present a new method for constructing a UEB from a quantum Latin square equipped with extra data. Developing construction techniques for UEBs has been a major activity in quantum computation, with three primary methods proposed: shift-and-multiply, Hadamard, and group theoretic. We show that our new approach simultaneously generalizes the shift-and multiply and Hadamard methods. Furthermore, we explicitly construct a UEB using our technique which we prove cannot be obtained from any of these existing methods.
A central theme of this thesis is the quantization and generalization of objects from areas of mathematics such as set theory and combinatorics with application to quantum information. We represent mathematical objects such as Latin squares or functions as string diagrams over the category of finite-dimensional Hilbert spaces obeying various diagrammatic axioms. This leads to a direct understanding of how these objects arise in quantum mechanics and gives insight into how quantum analogues can be defined. In Part I of this thesis we introduce quantum Latin squares (QLS), quantum objects which generalize the classical Latin squares from combinatorics. We present a new method for constructing a unitary error basis (UEB) from a quantum Latin square equipped with extra data, which we show simultaneously generalizes the existing shift-and-multiply and Hadamard methods. We introduce two different notions of orthogonality for QLS which we use to construct families of mutually unbiased bases and perfect tensors respectively. We also introduce a further generalization of Latin squares called quantum Latin isometry squares. We use these to produce quantum error codes and to give a new way of characterizing UEBs. In Part II we show that maximal families of mutually unbiased bases (MUBs) are characterized in all dimensions by partitioned UEBs, up to a choice of a family of Hadamards. Furthermore, we give a new construction of partitioned UEBs, and thus maximal families of MUBs, from a finite field, which is simpler and more direct than previous proposals. We introduce new tensor diagrammatic characterizations of maximal families of MUBs, partitioned UEBs, and finite fields as algebraic structures defined over Hilbert spaces. In Part III we introduce quantum functions and quantum sets, which quantize the classical notions. We show that these structures form a 2-category QSet. We extend this framework to introduce quantum graphs and quantum homomorphisms which form a 2-category QGraph. We show that these 2-categories capture several different notions of quantum morphism and noncommutative graph from various previous papers in noncommutative topology, quantum non-local games and quantum information. We later use the correspondence between our quantum graph morphisms and those from quantum non-local games to show that pairs of quantum isomorphic graphs with multiple connected components are built up of quantum isomorphisms on those components.
Unitary error bases have a great number of applications across quantum information and quantum computation, and are fundamentally linked to quantum teleportation, dense coding and quantum error correction. Werner's combinatorial construction builds a unitary error basis from a family of Hadamard matrices and a Latin square. In this dissertation, I give a new categorical axiomatisation of Latin squares, and use this to give a fully graphical presentation and proof of the correctness of Werner's construction. The categorical approach makes clear that some of the Latin square axioms are unnecessary for the construction to go through, and I propose a generalised construction scheme with the potential to create new classes of unitary error bases.
Quantum Latin Squares have emerged as mathematical structures of interest in quantum information theory. This paper provides a comprehensive overview of quantum Latin squares. We aim to synthesize the current knowledge for the benefit of researchers in quantum information theory. We begin by establishing the theoretical foundation linking classical Latin squares with their quantum counterparts. This provides insight into their potential applications, particularly in the realm of quantum error correction. Through a detailed examination, we outline known constructions and elucidate the properties of quantum Latin squares, highlighting their role within quantum computing frameworks. We then explore the relationships of quantum Latin squares with mutually unbiased bases and unitary error bases. This underscores their importance in the construction of quantum error correcting codes using mutually orthogonal quantum Latin squares. We give significant focus to a comparative analysis between classical and quantum Latin squares, particularly in their applications to error correcting codes. The applications are analogous to the application of classical Latin squares to classical error correcting codes. This overview aims to not only compile existing research but also to inspire further exploration into Quantum Latin squares and their applications in quantum information theory.
Goyeneche et al recently proposed a notion of orthogonality for quantum Latin squares, and showed that orthogonal quantum Latin squares yield quantum codes. We give a simplified characterization of orthogonality for quantum Latin squares, which we show is equivalent to the existing notion. We use this simplified characterization to give an upper bound for the number of mutually orthogonal quantum Latin squares of a given size, and to give the first examples of orthogonal quantum Latin squares that do not arise from ordinary Latin squares. We then discuss quantum Latin isometry squares, generalizations of quantum Latin squares recently introduced by Benoist and Nechita, and define a new orthogonality property for these objects, showing that it also allows the construction of quantum codes. We give a new characterization of unitary error bases using these structures.