Talks and news

The 36 officers problem of Euler: can 36 officers each belonging to one of 6 distinct regiments and ranks be arranged in a square array such no regiment or rank is repeated along a column or row is not solvable. We showed that there is a quantum solution and it is represented by the chess pieces: colors regiment and values are the ranks.

Quanta Magazine article on it: Euler's 243 year old impossible puzzle gets a quantum solution

Livescience article on the same: Centuries-old 'impossible' math problem cracked using the strange physics of Schrödinger's cat

Publication: Physical Review Letters, Editor's suggestion