Benchmarking neutral atom-based quantum processors at scale
This paper introduces scalable, application-level benchmarks using the Quantum Adiabatic Algorithm and QAOA to evaluate neutral atom quantum processors on maximal independent set problems, demonstrating that Quera's Aquila outperforms Pasqal's Fresnel on current hardware while providing a framework for assessing future large-scale devices.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Imagine a world where computers don't just crunch numbers but dance with the very fabric of reality. This is the realm of quantum computing, a field where tiny particles like atoms act as the brain's neurons. Unlike your laptop, which uses bits that are either a 0 or a 1, these quantum machines use "qubits" that can be 0, 1, or a magical mix of both at the same time. One promising way to build these machines is by trapping individual atoms in invisible cages made of laser light, called optical tweezers. These atoms are like dancers on a stage; if they get too close, they interact in a special way called the "Rydberg blockade," where they refuse to be excited at the same time. Scientists use this rule to solve incredibly hard puzzles, like finding the best way to arrange a group of people so no two friends are sitting next to each other. But here's the catch: these quantum dancers are fragile. Noise from the environment can make them stumble, and as we build bigger stages with more atoms, it becomes harder to tell if the machine is actually getting smarter or just getting louder. That's why we need a way to test them fairly, not just by looking at their internal parts, but by seeing how well they solve real-world problems.
This paper is like a giant, fair-play sports tournament for two of the most advanced quantum computers on the planet: one built by QuEra (called Aquila) and one by Pasqal (called Fresnel). The researchers wanted to see which machine is better at solving a specific type of puzzle known as the "Maximal Independent Set" (MIS). Imagine you have a map of a city with many intersections (dots) and roads connecting them (lines). The goal is to pick the largest possible group of intersections such that no two picked intersections are directly connected by a road. It sounds simple, but as the city grows, the number of possible combinations explodes, making it a nightmare for regular computers. The researchers used two different "strategies" to solve this on the quantum machines. The first is the Quantum Adiabatic Algorithm (QAA), which is like slowly guiding a marble down a winding hill; if you go slow enough, it naturally rolls into the deepest valley, which represents the best solution. The second is the Quantum Approximate Optimization Algorithm (QAOA), which is more like a game of "hot and cold" where the computer tries different settings, learns from the results, and tweaks its approach to find the best spot.
The team tested these machines on problems ranging from small setups with 11 atoms all the way up to massive challenges with 102 atoms for Aquila and 85 for Fresnel. They didn't just look at whether the machines got the perfect answer; they looked at how often they found valid answers (solutions that actually follow the rules) and how close those answers were to the best possible one. The results showed a clear trend: as the puzzles got bigger, both machines found it harder to get the perfect solution, which is expected because the problems are getting harder and the machines are noisier. However, Aquila generally performed better than Fresnel, especially when the puzzles got really large. For instance, on an 85-atom problem, Aquila found valid solutions about 22.1% of the time, while Fresnel only managed 4.6%. Interestingly, the researchers found that the QAOA strategy didn't always beat the slower, steadier QAA strategy, suggesting that sometimes a gentle, slow approach works better than a fast, complex one on these specific machines.
The authors also created a massive library of new puzzles, scaling up to 1,000 atoms, which will serve as a standard test for future quantum computers as they are built. They are careful to note that this test doesn't tell us exactly why a machine failed (like whether it was a broken laser or a bad algorithm); instead, it gives a "scorecard" of how well the whole system works together in real life. It's like judging a car not by measuring every bolt, but by seeing how fast and safely it drives around a track. The paper concludes that while neither machine has "solved" the problem of noise yet, Aquila currently holds the lead in handling these large-scale, native optimization tasks. This benchmark provides a common language for scientists to compare different quantum technologies, ensuring that as we build bigger and more powerful machines, we can truly measure if they are getting better at doing the jobs we actually need them to do.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.