Orthogonality for Quantum Latin Isometry Squares

  title={Orthogonality for Quantum Latin Isometry Squares},
  author={Benjamin Musto and Jamie Vicary},
  journal={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… 

Quantum combinatorial designs and k-uniform states

Goyeneche et al [2018 Phys. Rev. A 97 062326] introduced several classes of quantum combinatorial designs, namely quantum Latin squares, quantum Latin cubes, and the notion of orthogonality on them.

Thirty-six Entangled Officers of Euler: Quantum Solution to a Classically Impossible Problem.

The negative solution to the famous problem of 36 officers of Euler implies that there are no two orthogonal Latin squares of order six. We show that the problem has a solution, provided the officers

Construction and Local Equivalence of Dual-Unitary Operators: From Dynamical Maps to Quantum Combinatorial Designs

While quantum circuits built from two-particle dual-unitary (maximally entangled) operators serve as minimal models of typically nonintegrable many-body systems, the construction and characterization

Joint measurability meets Birkhoff-von Neumann's theorem

Quantum measurements can be interpreted as a generalisation of probability vectors, in which non-negative real numbers are replaced by positive semi-definite operators. We extrapolate this analogy to

On classifying absolutely maximally entangled states and the infinitude of inequivalent quantum solutions to the problem of 36 officers of Euler

Absolutely maximally entangled (AME) states are genuinely entangled multipartite pure states of N particles, each of local dimension d , with maximal entanglement across any bipartition. In this work

Five open problems in quantum information

Five selected problems in the theory of quantum information are presented and finding a correct answer to any of them will be rewarded by the Golden KCIK Award established by the National Quantum Information Centre (KCIK) in Poland.

9 × 4 = 6 × 6: Understanding the Quantum Solution to Euler’s Problem of 36 Officers

The famous combinatorial problem of Euler concerns an arrangement of 36 officers from six different regiments in a 6×6 square array. Each regiment consists of six officers each belonging to one of

9 × 4 = 6 × 6 : Understanding the quantum solution to the Euler ’ s problem of 36 officers

. The famous combinatorial problem of Euler concerns an arrangement of 36 officers from six different regiments in a 6 × 6 square array. Each regiment consists of six officers each belonging to one of six

Five open problems in theory of quantum information

Paweł Horodecki, 2, 3 Łukasz Rudnicki, 4, 3, ∗ and Karol Życzkowski 4, 3 International Centre for Theory of Quantum Technologies (ICTQT), University of Gdańsk, 80-308 Gdańsk, Poland Faculty of

Genuinely quantum SudoQ and its cardinality

Jerzy Paczos,1 Marcin Wierzbiński,2 Grzegorz Rajchel-Mieldzioć,3 Adam Burchardt,4 and Karol Życzkowski3, 4 Faculty of Physics, University of Warsaw, ul. Pasteura 5, 02-093 Warszawa, Poland Faculty of



Entanglement and quantum combinatorial designs

We introduce the notion of quantum orthogonal arrays as a generalization of orthogonal arrays. These quantum combinatorial designs naturally induce the concepts of quantum Latin squares, cubes,

Constructing Mutually Unbiased Bases from Quantum Latin Squares

It is shown how a pair of mutually unbiased maximally entangled bases can be constructed in square dimension from orthogonal quantum Latin squares, and how this construction is strictly more general.

A compositional approach to quantum functions

We introduce a notion of quantum function, and develop a compositional framework for finite quantum set theory based on a 2-category of quantum sets and quantum functions. We use this framework to

The Morita Theory of Quantum Graph Isomorphisms

We classify instances of quantum pseudo-telepathy in the graph isomorphism game, exploiting the recently discovered connection between quantum information and the theory of quantum automorphism

All teleportation and dense coding schemes

We establish a one-to-one correspondence between (1) quantum teleportation schemes, (2) dense coding schemes, (3) orthonormal bases of maximally entangled vectors, (4) orthonormal bases of unitary

Theory of quantum error-correcting codes

A general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions is developed and necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction are obtained.

Quantum and non-signalling graph isomorphisms

Non-binary unitary error bases and quantum codes

Error operator bases for systems of any dimension are defined and natural generalizations of the bit-flip/ sign-change error basis for qubits are given. These bases allow generalizing the

The Quantum Monad on Relational Structures

It is shown how quantum strategies for homomorphism games between relational structures can be viewed as Kleisli morphisms for a quantum monad on the (classical) category of relational structures and homomorphisms.