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

@article{Rather2022ThirtysixEO,
  title={Thirty-six Entangled Officers of Euler: Quantum Solution to a Classically Impossible Problem.},
  author={Suhail Ahmad Rather and Adam Burchardt and Wojciech T. Bruzda and Grzegorz Rajchel-Mieldzio'c and Arul Lakshminarayan and Karol Życzkowski},
  journal={Physical review letters},
  year={2022},
  volume={128 8},
  pages={
          080507
        }
}
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 are entangled, and construct orthogonal quantum Latin squares of this size. As a consequence, we find an example of the long-elusive Absolutely Maximally Entangled state AME(4,6) of four subsystems with six levels each, equivalently a 2-unitary matrix of size 36, which maximizes the entangling… 

Figures from this paper

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
9 $\times$ 4 = 6 $\times$ 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
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.
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
Remarks on the construction and the ergodicity properties of dual unitary quantum circuits (with an Appendix by Roland Bacher and Denis Serre)
We consider one dimensional quantum circuits of the brickwork type, where the fundamental quantum gate is dual unitary. Such models are solvable: the dynamical correlation functions of the infinite
Fully non-positive-partial-transpose genuinely entangled subspaces
TLDR
This work provides a construction of multipartite subspaces that are not only genuinely entangled but also fully non-positive-partial-transpose (NPT) in the sense that any mixed state supported on them has non- positive partial transpose across any bipartition.
A Quantum Solution to an 18th-Century Puzzle
A sudoku-style mathematical puzzle that is known to have no classical solution has been found to be soluble if the objects being arrayed in a square grid show quantum behavior [1]. The problem, posed

References

SHOWING 1-10 OF 47 REFERENCES
Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
TLDR
With the help of the weight enumerator machinery known from quantum error correction and the generalized shadow inequalities, new bounds are obtained on the existence of AME states in dimensions larger than two and the quantum MacWilliams identity is derived in the Bloch representation.
Quantum error-correction codes and absolutely maximally entangled states
TLDR
In this network, it is shown how corrections arise to the Ryu-Takayanagi formula in the case of entangled input state, and that the bound on the entanglement entropy of the boundary state is saturated for absolutely maximally entangled input states.
Absolutely maximally entangled states, quantum-maximum-distance-separable codes, and quantum repeaters
TLDR
A generic reduction-friendly form is introduced for the generator set of the stabilizer representation of an AME state, from which the stabilized form for children codes, all QMDS, can be obtained.
Absolute maximal entanglement and quantum secret sharing
We study the existence of absolutely maximally entangled (AME) states in quantum mechanics and its applications to quantum information. AME states are characterized by being maximally entangled for
Entangling power of permutations
The notion of entangling power of unitary matrices was introduced by Zanardi et al., [Phys. Rev. A 62, 030301 (2000)]. We study the entangling power of permutations, given in terms of a combinatorial
Quantum Codes of Maximal Distance and Highly Entangled Subspaces
TLDR
New bounds on the existence of general quantum maximum distance separable codes (QMDS): the length n of all QMDS codes with local dimension D and distance d≥3 is bounded by n≤D2+d−2 and the quantum MDS conjecture in the special case of distance-three codes is confirmed.
Quantum thermalization through entanglement in an isolated many-body system
TLDR
Microscopy of an evolving quantum system indicates that the full quantum state remains pure, whereas thermalization occurs on a local scale, whereas entanglement creates local entropy that validates the use of statistical physics for local observables.
Absolutely maximally entangled states, combinatorial designs, and multiunitary matrices
Absolutely Maximally Entangled (AME) states are those multipartite quantum states that carry absolute maximum entanglement in all possible partitions. AME states are known to play a relevant role in
Multipartite entanglement
First, we show how the quantum circuits for generating and me asuring multi-party entanglement of qubits can be translated to continuous quan tum variables. We derive sufficient inseparability
Nonbinary quantum codes
  • E. Rains
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1999
TLDR
This work considers codes derived from finite symplectic geometry assumed to have additional global symmetries, and gets analogs of quadratic residue codes, including a single-error-correcting code encoding one letter in five, for any alphabet size.
...
1
2
3
4
5
...