Mathematical puzzle thought to be insoluble for centuries is solved utilizing the peculiar physics of Schrödinger's cat

pixabay.com

The arithmetic puzzle is a lot like a supercharged version of Sudoku.

According to a new study, a 243-year-old arithmetic issue can only be solved through quantum entanglement.

The arithmetic puzzle is a lot like a supercharged version of Sudoku. Leonhard Euler, a German mathematician who initially proposed the topic in 1779, is the author of Euler's officer problem. Here's the jigsaw: Six regiments make up your army, and you're in charge. There are a total of six different ranks of officers in each regiment. Ranks and regiments may not be repeated inside a single row or column in a 6-by-6 grid.

Euler could not come up with a solution, and subsequent calculations confirmed this. An article published in the Canadian Journal of Mathematics in 1960 showed that 6 was the lone number over two without any such arrangement.

Euler's dilemma has been solved in a new way by scholars. You may organize six regiments of six officers of six ranks in a grid without repeating any rank or regiment more than once if the officers are in a quantum entanglement state, according to a study published in the public database arXiv.

An article published in Physical Review Letters takes advantage of the fact that quantum objects can exist in numerous states until they are measured. In Schrödinger's cat thought experiment, a cat is dead and alive in a box containing radioactive poison until the box is opened.) entangled.

Officers have a fixed regiment and rank in Euler's problem. Some of them could be lieutenants in the Red Regiment and Captains in the Blue Regiment, for example. Color is occasionally used to make the regiments easier to spot on the grids.)

Nevertheless, a quantum officer may serve in multiple regiments or ranks at the same time. Single officers can be Red Regiment first lieutenants, Blue Regiment captains, Green Regiment majors or colonels. (Or any other combination, theoretically.)

With this identity swap, the officers on the grid will need to be entangled quantum mechanically to solve Euler's issue. In entanglement, one object's state influences another's state. Officer No. 2 must be a major in the Green Regiment if Officer No. 1 is a first lieutenant in the Red Regiment.

Adam Burchardt, a postdoctoral researcher at Jagiellonian University in Poland, headed a team of researchers who used brute force computer power to verify that saturating the grid with quantum cops made the solution achievable. As co-author Suhail Rather of the Indian Institute of Technology Madras revealed to Quanta Magazine, the entanglement has its pattern. Officers are only linked to their immediate superiors or inferiors in rank, and regiments are only linked to other regiments of the same rank.

According to Quanta Magazine, the findings could have significant implications for quantum data storage. Quantum computing can use entangled states to assure data security even in error, a technique known as quantum error correction. When the researchers intertangled 36 quantum cops, they discovered what is known as an "absolutely maximally entangled" state. Quantum computing's resilient data storage may benefit from such states.

Quanta Magazine has the full story of how they solved the seemingly insurmountable obstacle.

Reference : https://www.livescience.com/math-puzzle-quantum-solution

Image source :