9 $\times$ 4 = 6 $\times$ 6: Understanding the quantum solution to the Euler's problem of 36 officers

• URL: http://arxiv.org/abs/2204.06800v2
• Date: Fri, 22 Jul 2022 11:27:50 GMT
• Title: 9 $\times$ 4 = 6 $\times$ 6: Understanding the quantum solution to the Euler's problem of 36 officers
• Authors: Karol \.Zyczkowski, Wojciech Bruzda, Grzegorz Rajchel-Mieldzio\'c, Adam Burchardt, Suhail Ahmad Rather, Arul Lakshminarayan
• Abstract summary: famous problem of Euler concerns an arrangement of $36$ officers from six different regiments in a $6 times 6$ square array. In recent work, we constructed a solution to a quantum version of this problem assuming that the officers correspond to quantum states and can be entangled.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The famous combinatorial problem of Euler concerns an arrangement of $36$ officers from six different regiments in a $6 \times 6$ square array. Each regiment consists of six officers each belonging to one of six ranks. The problem, originating from Saint Petersburg, requires that each row and each column of the array contains only one officer of a given rank and given regiment. Euler observed that such a configuration does not exist. In recent work, we constructed a solution to a quantum version of this problem assuming that the officers correspond to quantum states and can be entangled. In this paper, we explain the solution which is based on a partition of 36 officers into nine groups, each with four elements. The corresponding quantum states are locally equivalent to maximally entangled two-qubit states, hence each officer is entangled with at most three out of his $35$ colleagues. The entire quantum combinatorial design involves $9$ Bell bases in nine complementary $4$-dimensional subspaces.

Related papers

• A QUBO Formulation for the Generalized LinkedIn Queens Game [49.1574468325115]
  We present a QUBO formulation designed to solve a series of generalisations of the LinkedIn queens game. We adapt this formulation for several particular cases of the problem by trying to optimise the number of variables and interactions. We also present two new types of problems, the Coloured Chess Piece Problem and the Max Chess Pieces Problem, with their corresponding QUBO formulations.
  arXiv  Detail & Related papers  (2024-10-08T23:54:54Z)
• Two-Unitary Complex Hadamard Matrices of Order $36$ [0.0]
  A family of two-unitary complex Hadamard matrices (CHM) stemming from a particular matrix, of size $36$ is constructed. Every matrix in this orbit remains unitary after operations of partial transpose and reshuffling. It provides a novel solution to the quantum version of the Euler problem, in which each field of the Graeco-Latin square of size six contains a symmetric superposition of all $36$ officers.
  arXiv  Detail & Related papers  (2024-01-03T11:10:00Z)
• QUBO Resolution of the Job Reassignment Problem [44.99833362998488]
  We present a subproblemation scheme for the (Job Reassignment Problem) The cost function of the scheme is described via a QUBO hamiltonian to allow implementation in both gate-based and annealing quantum computers.
  arXiv  Detail & Related papers  (2023-09-28T14:37:23Z)
• Constructions of $k$-uniform states in heterogeneous systems [65.63939256159891]
  We present two general methods to construct $k$-uniform states in the heterogeneous systems for general $k$. We can produce many new $k$-uniform states such that the local dimension of each subsystem can be a prime power.
  arXiv  Detail & Related papers  (2023-05-22T06:58:16Z)
• Quantum $k$-uniform states from quantum orthogonal arrays [0.0]
  We give infinite classes of 2-uniform states of $N$ systems with dimension of prime power $dgeq 2$ for arbitrary $Ngeq 5$. We also give 3-uniform states of $N$-qubit systems for arbitrary $Ngeq 6$ and $Nneq 7,8,9,11$.
  arXiv  Detail & Related papers  (2023-03-27T08:43:35Z)
• Absolutely maximally entangled state equivalence and the construction of infinite quantum solutions to the problem of 36 officers of Euler [0.0]
  We show that there is truly only em one AME state of four qutrits up to local unitary equivalence. For larger local dimensions, the number of local unitary classes of AME states is shown to be infinite. Based on this, an infinity of quantum solutions are constructed and we prove that these are not equivalent.
  arXiv  Detail & Related papers  (2022-12-13T17:16:17Z)
• Quantum version of the Euler's problem: a geometric perspective [0.0]
  We analyze the recently found solution to the quantum version of the Euler's problem from a geometric point of view. Existence of a quantum Graeco-Latin square of size six, equivalent to a maximally entangled state of four subsystems with d=6 levels each, implies that three copies of the manifold U(36)/U(1) of maximally entangled states of the $36times 36$ system, embedded in the complex projective space $CP36times 36 -1$, do intersect simultaneously at a certain point.
  arXiv  Detail & Related papers  (2022-12-07T19:01:35Z)
• Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies [68.93512627479197]
  We study quantum Ordered Binary Decision Diagrams($OBDD$) model. We prove lower bounds and upper bounds for OBDD with arbitrary order of input variables. We extend hierarchy for read$k$-times Ordered Binary Decision Diagrams ($k$-OBDD$) of width.
  arXiv  Detail & Related papers  (2022-04-22T12:37:56Z)
• On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids [63.75363908696257]
  The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$. This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
  arXiv  Detail & Related papers  (2021-06-11T09:43:09Z)
• Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem [0.0]
  We find an example of the long-elusive Absolutely Maximally Entangled state AME$(4,6)$ of four subsystems with six levels each. This state deserves the appellation golden AME state as the golden ratio appears prominently in its elements.
  arXiv  Detail & Related papers  (2021-04-11T22:12:58Z)
• Tight Quantum Lower Bound for Approximate Counting with Quantum States [49.6558487240078]
  We prove tight lower bounds for the following variant of the counting problem considered by Aaronson, Kothari, Kretschmer, and Thaler ( 2020) The task is to distinguish whether an input set $xsubseteq [n]$ has size either $k$ or $k'=(1+varepsilon)k$.
  arXiv  Detail & Related papers  (2020-02-17T10:53:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.