• DOI:10.4204/EPTCS.287.15
• Corpus ID: 55606917

Orthogonality for Quantum Latin Isometry Squares

@article{Musto2018OrthogonalityFQ,
  title={Orthogonality for Quantum Latin Isometry Squares},
  author={Benjamin Musto and Jamie Vicary},
  journal={Electronic Proceedings in Theoretical Computer Science},
  year={2018}
}

• Benjamin Musto, J. Vicary
• Published 11 April 2018
• Mathematics
• Electronic Proceedings in Theoretical Computer Science

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.