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

Physics World

Programmable quantum simulator boasts up to 256 qubits

Sam Jarman

Published Dec 1, 2021• 0 citations
Publisher

Abstract

Physicists have demonstrated a largescale, programmable quantum simulator that features a 2D array of 256 quantum bits (qubits).
DOI
10.1088/2058-7058/34/09/08

Related papers

A Rydberg Programmable Quantum Simulator with 256 Qubits

Tout T. Wang, Sepehr Ebadi, Harry Levine +15 more

Bulletin of the American Physical Society•Jun 1, 2021•0 citations

Compilation of Qcrank Encoding Algorithm for a Dynamically Programmable Qubit Array Processor

J. T. Balewski, Wan-Hsuan Lin, Anupam Mitra +5 more

Algorithm and hardware-aware compilation co-design is essential for the efficient deployment of near-term quantum programs. We present a compilation case-study implementing QCrank - an efficient encoding protocol for storing sequenced real-valued classical data in a quantum state targeting neutral atom-based Dynamically Programmable Qubit Arrays (DPQAs). We show how key features of neutral-atom arrays such as high qubits count, operation parallelism, multizone architecture, and natively reconfigurable connectivity can be used to inform effective algorithm deployment. We identify algorithmic and circuit features that signal opportunities to implement them in a hardware-efficient manner. To evaluate projected hardware performance, we define a realistic noise model for DPQAs using parameterized Pauli channels, implement it in Qiskit circuit simulators, and assess QCrank's accuracy for writing and reading back$24-320$real numbers into$6-20$qubits. We compare DPQA results with simulated performances of Quantinuum's H1-1E and with experimental results from IBM Fez, highlighting promising accuracy scaling for DPQAs.

arXiv:2507.10699•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Reconfigurable quantum computer juggles 98 qubits

Crystal Noel

Nature•Jun 17, 2026•0 citations

Quantum Algorithm Emulation Using FPGAs

Samuel Petruescu

Field Programmable Gate Arrays (FPGAs) have been used in most of the physics sub-fields for various unique purposes. This includes particle physics, quantum optics, and, more recently, quantum computing. FPGAs boast many benefits over previous experimental and computational setups. They are versatile, easy to program, and cost-effective, leading to an understandable desire to incorporate them into the new field of quantum computing. While FPGAs have been used to help control the readout and control of physical qubits, they can also be a good tool for improving algorithm simulations, which is the focus of this paper. Different algorithms have different computational limits because of the varying operations and circuit depth levels. Due to the ease of incorporating parallel processes and the ability to optimize FPGAs on a deeper level, we can speed up computationally expensive operations, increasing the size of the quantum circuits we can simulate. This paper aims to provide an educational walkthrough for quantum computing physicists interested in taking advantage of FPGAs in their research. Our findings indicate that an inexpensive FPGA with a clock rate of 100MHz can perform simple, unoptimized matrix operations on the order of 107 ns faster than a CPU using optimized Python libraries. This can be further improved upon using more expensive hardware and optimized designs. This will provide many researchers and students with the tools needed to study quantum algorithms without the need for costly hardware.

•Jul 24, 2025•0 citations

Harnessing a 256-qubit Neutral Atom Simulator for Graph Classification

Edoardo Giusto, Gabriele Iurlaro, Bartolomeo Montrucchio +5 more

Neutral atom platforms are analogue quantum simulators that offer the possibility to map graphs onto a 2D qubit register using programmable Rubidium atoms arrays, whose valence electrons' energy state is used as qubits, using optical tweezers. This makes it possible to implement algorithms for solving graph combinatorial optimization and Quantum Machine Learning (QML) tasks, such as graph classification. However, the restrictions of real hardware, as well as the very low number of publicly available machines, make such implementation non-trivial. In this work, we manage to compute the Quantum Evolution Kernel (QEK) to extract the features from graphs of the PROTEINS dataset using the 256-qubits Aquila platform (available through AWS) and then we apply classical Machine Learning (ML) techniques for the final classification. The method is benchmarked against classical kernels, resulting in slightly better performance, proving the effectiveness of the method, even in the case of a noisy quantum simulator.

quant-pharXiv:2605.04737•IEEE International Conference on Quantum Computing and Engineering (QCE)•May 7, 2026•1 citation

Demonstration of a small programmable quantum computer with atomic qubits

Shantanu Debnath, Norbert M. Linke, Caroline Figgatt +3 more

arXiv:1603.04512•Nature•Aug 3, 2016•776 citations
Algorithm and hardware-aware compilation co-design is essential for the efficient deployment of near-term quantum programs. We present a compilation case-study implementing QCrank - an efficient encoding protocol for storing sequenced real-valued classical data in a quantum state targeting neutral atom-based Dynamically Programmable Qubit Arrays (DPQAs). We show how key features of neutral-atom arrays such as high qubits count, operation parallelism, multizone architecture, and natively reconfigurable connectivity can be used to inform effective algorithm deployment. We identify algorithmic and circuit features that signal opportunities to implement them in a hardware-efficient manner. To evaluate projected hardware performance, we define a realistic noise model for DPQAs using parameterized Pauli channels, implement it in Qiskit circuit simulators, and assess QCrank's accuracy for writing and reading back24−32024-32024−320real numbers into6−206-206−20qubits. We compare DPQA results with simulated performances of Quantinuum's H1-1E and with experimental results from IBM Fez, highlighting promising accuracy scaling for DPQAs.
Field Programmable Gate Arrays (FPGAs) have been used in most of the physics sub-fields for various unique purposes. This includes particle physics, quantum optics, and, more recently, quantum computing. FPGAs boast many benefits over previous experimental and computational setups. They are versatile, easy to program, and cost-effective, leading to an understandable desire to incorporate them into the new field of quantum computing. While FPGAs have been used to help control the readout and control of physical qubits, they can also be a good tool for improving algorithm simulations, which is the focus of this paper. Different algorithms have different computational limits because of the varying operations and circuit depth levels. Due to the ease of incorporating parallel processes and the ability to optimize FPGAs on a deeper level, we can speed up computationally expensive operations, increasing the size of the quantum circuits we can simulate. This paper aims to provide an educational walkthrough for quantum computing physicists interested in taking advantage of FPGAs in their research. Our findings indicate that an inexpensive FPGA with a clock rate of 100MHz can perform simple, unoptimized matrix operations on the order of 107 ns faster than a CPU using optimized Python libraries. This can be further improved upon using more expensive hardware and optimized designs. This will provide many researchers and students with the tools needed to study quantum algorithms without the need for costly hardware.
Neutral atom platforms are analogue quantum simulators that offer the possibility to map graphs onto a 2D qubit register using programmable Rubidium atoms arrays, whose valence electrons' energy state is used as qubits, using optical tweezers. This makes it possible to implement algorithms for solving graph combinatorial optimization and Quantum Machine Learning (QML) tasks, such as graph classification. However, the restrictions of real hardware, as well as the very low number of publicly available machines, make such implementation non-trivial. In this work, we manage to compute the Quantum Evolution Kernel (QEK) to extract the features from graphs of the PROTEINS dataset using the 256-qubits Aquila platform (available through AWS) and then we apply classical Machine Learning (ML) techniques for the final classification. The method is benchmarked against classical kernels, resulting in slightly better performance, proving the effectiveness of the method, even in the case of a noisy quantum simulator.