Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE)

Solving Maximum Independent Set Problem Using Analog Neutral Atom Quantum Computers

Jehn‐Ruey Jiang, Qiao-Yi Lin

Published Oct 27, 2023• 2 citations
Publisher

Abstract

We used an analog neutral atom quantum computer, known as Aquila to solve the maximum independent set problem for a given graph through the Rydberg blockade effect. Aquila, developed by QuEra, is a 256-qubit analog quantum computer designed to operate at room temperature, employing neutral rubidium-87 atoms as its basis for qubit construction. It offers the flexibility to design qubit topologies and dynamically control the physical properties of individual qubits to simulate various quantum systems. By accessing Aquila through the Amazon Braket service, experiments are conducted to determine the maximum independent sets of various king’s graphs. The experimental results were analyzed. Suggestions were given for future research directions in the field of analog neutral atom quantum computers.

DOI
10.1109/ecice59523.2023.10383156

Related papers

Aquila: QuEra's 256-qubit neutral-atom quantum computer

Jonathan Wurtz, Alexei Bylinskii, Boris Braverman +10 more

The neutral-atom quantum computer "Aquila" is QuEra's latest device available through the Braket cloud service on Amazon Web Services (AWS). Aquila is a "field-programmable qubit array" (FPQA) operated as an analog Hamiltonian simulator on a user-configurable architecture, executing programmable coherent quantum dynamics on up to 256 neutral-atom qubits. This whitepaper serves as an overview of Aquila and its capabilities: how it works under the hood, key performance benchmarks, and examples that demonstrate some quintessential applications. This includes an overview of neutral-atom quantum computing, as well as five examples of increasing complexity from single-qubit dynamics to combinatorial optimization, implemented on Aquila. This whitepaper is intended for readers who are interested in learning more about neutral-atom quantum computing, as a guide for those who are ready to start using Aquila, and as a reference point for its performance as an analog quantum computer.

arXiv:2306.11727•Jun 20, 2023•203 citations

Engineering Quantum States with Neutral Atoms

J. T. Balewski, Milan Kornjača, Katherine Klymko +5 more

Aquila, an analog quantum simulation platform developed by QuEra Computing, supports control of the position and coherent evolution of up to 256 neutral atoms. This study details novel experimental protocols designed for analog quantum simulators that generate Bell state entanglement far away from the blockade regime, construct a Z2 state with a defect induced by an ancilla, and optimize the driving fields schedule to prepare excited states with enhanced fidelity. We additionally evaluate the effectiveness of readout error mitigation techniques in improving the fidelity of measurement results. All experiments were executed on Aquila from QuEra and facilitated by the AWS Braket interface. Our experimental results closely align with theoretical predictions and numerical simulations. The insights gained from this study showcase Aquila's capabilities in handling complex quantum simulations and computations, and also pave the way for new avenues of research in quantum information processing and physics that employ programmable analog hardware platforms.

arXiv:2404.04411•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•8 citations

Hardness-dependent quantum adiabatic schedules for the maximum-independent-set problem

Sébastien Perseguers

We propose a numerical approach to design highly efficient adiabatic schedules for analog quantum computing, focusing on the maximum-independent-set problem and neutral atom platforms. On the basis of a representative dataset of small graphs, we present numerical evidence that the optimum schedules depend principally on the hardness of the problem rather than on its size. These schedules perform better than the benchmark protocols and admit a straightforward implementation in the hardware. This allows us to extrapolate the results to larger graphs and to successfully solve moderately hard problems using QuEra’s 256-qubit Aquila computer. We believe that extending our approach to hybrid algorithms could be the key to solving the hardest instances with the current technology, making yet another step toward real-world applications.

arXiv:2410.08995•Physical Review Applied•Jun 10, 2025•6 citations

Quantum optimization of maximum independent set using Rydberg atom arrays

Sepehr Ebadi, Alexander Keesling, Madelyn Cain +21 more

Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum algorithms for solving the maximum independent set problem. We use a hardware-efficient encoding associated with Rydberg blockade, realize closed-loop optimization to test several variational algorithms, and subsequently apply them to systematically explore a class of graphs with programmable connectivity. We find that the problem hardness is controlled by the solution degeneracy and number of local minima, and we experimentally benchmark the quantum algorithm's performance against classical simulated annealing. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions in the deep circuit regime and analyze its origins.

arXiv:2202.09372•Science•May 5, 2022•512 citations

PaQit: Energy-Runtime-Fidelity Co-Optimization for Neutral Atom Quantum Computers

Jason Ludmir, Tirthak Patel

Neutral-atom quantum computers provide a scalable platform for large-scale quantum computation due to their all-optical control, room-temperature operation, and flexible lattice geometry. Although the favorable energy characteristics of these systems are well recognized, the relationship between system-level energy consumption, runtime, and computational fidelity remains poorly understood, limiting practical scheduling decisions. In this work, we develop a hardware-grounded analytical model that captures how energy and runtime scale with qubit utilization in neutral-atom systems. We introduce PaQit, a fidelity-aware qubit packing framework that integrates device-level Rydberg interaction physics with system-level scheduling to jointly optimize energy, runtime, and fidelity. By translating fidelity targets into packing decisions, PaQit identifies operating regimes that maximize parallelism while respecting interaction-driven crosstalk constraints. We validate the analytical framework using simulations of QuEra's analog Aquila system and digital Gemini system, as well as real hardware executions, demonstrating close agreement between the predicted trends and observed system behavior.

quant-pharXiv:2608.02815•Aug 5, 2026•0 citations

Neutral-Atom-based Quantum Optimization for Resource Allocation in NOMA Networks

Patatchona Keyela, Remon A. Polus, Soumaya Cherkaoui +1 more

In wireless communication networks, many resource optimization problems are nondeterministic polynomial-time hard (NP-hard) due to their combinatorial nature and high computational complexity. Recently, neutral-atom-based quantum computing has emerged as a promising platform for efficiently solving such problems by leveraging quantum superposition and entanglement. However, its application to wireless communication optimization problems remains largely unexplored. In this paper, we investigate the use of neutral-atom quantum platforms to solve the maximum access problem (MAP), formulated as a mixed-integer programming task that jointly considers admission control, user clustering, channel assignment, and power allocation in a non-orthogonal multiple access (NOMA)-enabled uplink network. To reduce the computational burden, the MAP is equivalently reformulated as a maximum independent set (MIS) problem in graph theory. This reformulation enables the use of the neutral atom platform based on Rydberg atom arrays, where the MIS problem is naturally encoded into the physical geometry and blockade constraints of the quantum system. Numerical results demonstrate the feasibility and potential of this approach for addressing large-scale wireless resource optimization problems.

arXiv:2609.26556•Sep 22, 2026•0 citations
We used an analog neutral atom quantum computer, known as Aquila to solve the maximum independent set problem for a given graph through the Rydberg blockade effect. Aquila, developed by QuEra, is a 256-qubit analog quantum computer designed to operate at room temperature, employing neutral rubidium-87 atoms as its basis for qubit construction. It offers the flexibility to design qubit topologies and dynamically control the physical properties of individual qubits to simulate various quantum systems. By accessing Aquila through the Amazon Braket service, experiments are conducted to determine the maximum independent sets of various king’s graphs. The experimental results were analyzed. Suggestions were given for future research directions in the field of analog neutral atom quantum computers.
The neutral-atom quantum computer "Aquila" is QuEra's latest device available through the Braket cloud service on Amazon Web Services (AWS). Aquila is a "field-programmable qubit array" (FPQA) operated as an analog Hamiltonian simulator on a user-configurable architecture, executing programmable coherent quantum dynamics on up to 256 neutral-atom qubits. This whitepaper serves as an overview of Aquila and its capabilities: how it works under the hood, key performance benchmarks, and examples that demonstrate some quintessential applications. This includes an overview of neutral-atom quantum computing, as well as five examples of increasing complexity from single-qubit dynamics to combinatorial optimization, implemented on Aquila. This whitepaper is intended for readers who are interested in learning more about neutral-atom quantum computing, as a guide for those who are ready to start using Aquila, and as a reference point for its performance as an analog quantum computer.
Aquila, an analog quantum simulation platform developed by QuEra Computing, supports control of the position and coherent evolution of up to 256 neutral atoms. This study details novel experimental protocols designed for analog quantum simulators that generate Bell state entanglement far away from the blockade regime, construct a Z2 state with a defect induced by an ancilla, and optimize the driving fields schedule to prepare excited states with enhanced fidelity. We additionally evaluate the effectiveness of readout error mitigation techniques in improving the fidelity of measurement results. All experiments were executed on Aquila from QuEra and facilitated by the AWS Braket interface. Our experimental results closely align with theoretical predictions and numerical simulations. The insights gained from this study showcase Aquila's capabilities in handling complex quantum simulations and computations, and also pave the way for new avenues of research in quantum information processing and physics that employ programmable analog hardware platforms.
We propose a numerical approach to design highly efficient adiabatic schedules for analog quantum computing, focusing on the maximum-independent-set problem and neutral atom platforms. On the basis of a representative dataset of small graphs, we present numerical evidence that the optimum schedules depend principally on the hardness of the problem rather than on its size. These schedules perform better than the benchmark protocols and admit a straightforward implementation in the hardware. This allows us to extrapolate the results to larger graphs and to successfully solve moderately hard problems using QuEra’s 256-qubit Aquila computer. We believe that extending our approach to hybrid algorithms could be the key to solving the hardest instances with the current technology, making yet another step toward real-world applications.
Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum algorithms for solving the maximum independent set problem. We use a hardware-efficient encoding associated with Rydberg blockade, realize closed-loop optimization to test several variational algorithms, and subsequently apply them to systematically explore a class of graphs with programmable connectivity. We find that the problem hardness is controlled by the solution degeneracy and number of local minima, and we experimentally benchmark the quantum algorithm's performance against classical simulated annealing. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions in the deep circuit regime and analyze its origins.
Neutral-atom quantum computers provide a scalable platform for large-scale quantum computation due to their all-optical control, room-temperature operation, and flexible lattice geometry. Although the favorable energy characteristics of these systems are well recognized, the relationship between system-level energy consumption, runtime, and computational fidelity remains poorly understood, limiting practical scheduling decisions. In this work, we develop a hardware-grounded analytical model that captures how energy and runtime scale with qubit utilization in neutral-atom systems. We introduce PaQit, a fidelity-aware qubit packing framework that integrates device-level Rydberg interaction physics with system-level scheduling to jointly optimize energy, runtime, and fidelity. By translating fidelity targets into packing decisions, PaQit identifies operating regimes that maximize parallelism while respecting interaction-driven crosstalk constraints. We validate the analytical framework using simulations of QuEra's analog Aquila system and digital Gemini system, as well as real hardware executions, demonstrating close agreement between the predicted trends and observed system behavior.
In wireless communication networks, many resource optimization problems are nondeterministic polynomial-time hard (NP-hard) due to their combinatorial nature and high computational complexity. Recently, neutral-atom-based quantum computing has emerged as a promising platform for efficiently solving such problems by leveraging quantum superposition and entanglement. However, its application to wireless communication optimization problems remains largely unexplored. In this paper, we investigate the use of neutral-atom quantum platforms to solve the maximum access problem (MAP), formulated as a mixed-integer programming task that jointly considers admission control, user clustering, channel assignment, and power allocation in a non-orthogonal multiple access (NOMA)-enabled uplink network. To reduce the computational burden, the MAP is equivalently reformulated as a maximum independent set (MIS) problem in graph theory. This reformulation enables the use of the neutral atom platform based on Rydberg atom arrays, where the MIS problem is naturally encoded into the physical geometry and blockade constraints of the quantum system. Numerical results demonstrate the feasibility and potential of this approach for addressing large-scale wireless resource optimization problems.