Magic squares: Latin, Semiclassical and Quantum
Gemma De las Cuevas, Tim Netzer, Inga Valentiner-Branth

TL;DR
This paper explores the structure of quantum magic squares, demonstrating how semiclassical ones can be purified to quantum Latin squares and analyzing the relationships between classical, semiclassical, and quantum configurations.
Contribution
It proves that semiclassical magic squares can be purified to quantum Latin squares and characterizes the semiclassical quantum Latin squares as those derived from classical Latin squares.
Findings
Semiclassical magic squares can be purified to quantum Latin squares.
The matrix convex hull of quantum Latin squares is larger than that of semiclassical ones.
Quantum Latin squares that are semiclassical are exactly those from classical Latin squares.
Abstract
Quantum magic squares were recently introduced as a 'magical' combination of quantum measurements. In contrast to quantum measurements, they cannot be purified (i.e. dilated to a quantum permutation matrix) -- only the so-called semiclassical ones can. Purifying establishes a relation to an ideal world of fundamental theoretical and practical importance; the opposite of purifying is described by the matrix convex hull. In this work, we prove that semiclassical magic squares can be purified to quantum Latin squares, which are 'magical' combinations of orthonormal bases. Conversely, we prove that the matrix convex hull of quantum Latin squares is larger than the semiclassical ones. This tension is resolved by our third result: We prove that the quantum Latin squares that are semiclassical are precisely those constructed from a classical Latin square. Our work sheds light on the internal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · graph theory and CDMA systems · Graph Labeling and Dimension Problems
