Science & Tech
Discover the latest science and technology news from Sputnik including the inventions and scientific breakthroughs that are shaping the world.

# Schrödinger's Cat Helps Solve 240 Years Maths Problem That Was Deemed to Have No Solution

CC0 / / Schrödinger's Cat
Subscribe
The problem was proved unsolvable via classic methods through the use of computers in the middle of the 20th century. Not only does the new method solve the theoretical maths problem, but can also have practical applications - aiding in the development of the nascent quantum computing systems.
A group of researchers from the Jagiellonian University in Poland and the Indian Institute of Technology in Madras have managed to solve the "unsolvable" maths problem known as "Euler's officer problem" using the famous Schrödinger's cat thought experiment.
In case you didn't know: Schrödinger's cat was a thought experiment designed to show peculiarities of quantum physics. According to it, a cat in a closed box with a radioactive poison can be considered both dead and alive until the box is opened in a world of quantum physics.
Euler's officer problem was first formulated by Leonhard Euler back in 1779 and is a maths puzzle: you operate an army of six regiments with each of them having six different officers of six different ranks; you must arrange these 36 officers in a 6-by-6 square while avoiding repeating either rank or regiment in any row or column.
The problem was proved to be unsolvable back in 1960 using computers, which took a brute-force approach by working through all the possible variants of arranging officers. However, a group of researchers recently published a paper in which they demonstrated a way to solve this puzzle... sort of. All you have to do is to place the officers in the world of quantum physics and add a quantum entanglement into the mix.
In the quantum world you can't really tell what regiment an officer belongs to or what rank he has. And if he is placed in a state of quantum entanglement – a physical phenomenon where groups of particles can share quantum states regardless of the distance between them – Euler's maths problem becomes solvable, according to the researchers. With the officers having neither a static regiment nor a fixed rank - and each of them entangled - the computer could find at least one arrangement of the 36 officers that would meet the terms set by Euler.
So what does the solution of this maths-physics puzzle give us in practice? Theoretically, the method used to solve this problem can be applied in quantum computing. It can serve as a rudimentary system to safeguard such computers against mistakes in calculations and preserve the data in case of an error. According to the researchers' interview with Quanta Magazine, the absolutely maximally entangled state, which is achieved as a result of arranging these "quantum officers", can be used to organise resilient data storage for quantum computers.
Newsfeed
0
To participate in the discussion