Scientists proved quantum supremacy using a simple odd-cycle coloring game. With two entangled atoms, they achieved a 97.8% success rate, outperforming classical computers' 83.3%. The experiment shows quantum computers' superior problem-solving abilities, using entanglement to share information instantly—demonstrating speed and power with fewer resources than past quantum supremacy tests.
Copyright infringement not intended
Scientists show quantum supremacy through a simple yet powerful odd-cycle coloring game.
Scientists from Oxford University and Universidad de Sevilla proved that quantum computers can beat regular (classical) computers at a simple game. This is called "quantum supremacy".
It means that a quantum computer can solve a problem faster or better than any classical computer. It proves quantum computers are more powerful for certain tasks.
In the recent study, researchers achieved quantum supremacy using just two entangled particles, which is much simpler than earlier methods like Google’s Sycamore processor.
The game involves coloring points on a circle with two colors; red and blue. The goal is to make sure no two bordering points have the same color. However, if the circle has an odd number of points, it is mathematically impossible to do this perfectly.
Scientists turned this into a test where two players, Alice and Bob, answer questions about the colors without talking to each other. They win if their answers follow the rules: same colors for the same points and different colors for adjacent points.
Classical computers could only win about 83.3% of the time for a circle with three points. Players had to agree on a coloring pattern beforehand, but it wasn’t perfect because the task is mathematically impossible.
Quantum computers crushed classical performance. Using two entangled atoms, the researchers achieved a success rate of 97.8%. Entanglement allowed Alice and Bob to share information instantly, even though they couldn’t communicate directly. This gave them a huge advantage over classical systems.
|
How fast are quantum computers? For example, there are 1 million possible meeting points. A classical computer might take up to 1 million steps to find the correct one. But a quantum computer using Grover’s algorithm would only need about 1,000 steps. |
Source:
|
PRACTICE QUESTION Q. "Data is the new oil, but it needs refinement." Analyze how data-driven technologies can revolutionize economic planning and policy-making in India. 250 words |
© 2025 iasgyan. All right reserved
