activity
20142026
most citedLogical quantum processor based on reconfigurable atom arrays

1.1k citations · 1.2k across the 10 of their papers we have counts for

collaborators

11 papers

quant-ph2026

Efficient fidelity simulation of high-rate magic distillation circuits

Xiao Xiao, Dominik Hangleiter, J. Pablo Bonilla Ataides +4

Non-Clifford gates are essential for avoiding classical simulability under the Gottesman-Knill theorem. An error-corrected circuit with non-Clifford gates will therefore be an impo…

quant-ph2026

Strategic Plan for Neutral Atom Quantum Computation

Adrian J. Menssen, Tout Wang, Michael Gullans +53

We present a strategic plan for neutral atom quantum computation, bringing together hardware development and theory advancements to achieve the goal of practical quantum advantage.…

quant-ph2026

In-situ benchmarking of fault-tolerant quantum circuits. I. Clifford circuits

Xiao Xiao, Dominik Hangleiter, Dolev Bluvstein +2

Benchmarking physical devices and verifying logical algorithms are important tasks for scalable fault-tolerant quantum computing. Numerous protocols exist for benchmarking devices…

quant-ph2025

Scalable and fault-tolerant preparation of encoded k-uniform states

Shayan Majidy, Dominik Hangleiter, Michael J. Gullans

-uniform states are valuable resources in quantum information, enabling tasks such as teleportation, error correction, and accelerated quantum simulations. The practical realiza…

quant-ph2024★ 1 cited

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates

Jon Nelson, Joel Rajakumar, Dominik Hangleiter +1

We construct a polynomial-time classical algorithm that samples from the output distribution of noisy geometrically local Clifford circuits with any product-state input and single-…

quant-ph2024★ 7 cited

Fault-tolerant compiling of classically hard IQP circuits on hypercubes

Dominik Hangleiter, Marcin Kalinowski, Dolev Bluvstein +6

Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task. While fault-tolerant quantum computing provides a route to redu…

quant-ph2023★ 1.1k cited

Logical quantum processor based on reconfigurable atom arrays

Dolev Bluvstein, Simon J. Evered, Alexandra A. Geim +18

Suppressing errors is the central challenge for useful quantum computing, requiring quantum error correction for large-scale processing. However, the overhead in the realization of…

quant-ph2023★ 2 cited

Secret extraction attacks against obfuscated IQP circuits

David Gross, Dominik Hangleiter

Quantum computing devices can now perform sampling tasks which, according to complexity-theoretic and numerical evidence, are beyond the reach of classical computers. This raises t…

quant-ph2023★ 27 cited

Bell sampling from quantum circuits

Dominik Hangleiter, Michael J. Gullans

A central challenge in the verification of quantum computers is benchmarking their performance as a whole and demonstrating their computational capabilities. In this work, we find…

quant-ph2020★ 1 cited

Sampling and the complexity of nature

Dominik Hangleiter

Randomness is an intrinsic feature of quantum theory. The outcome of any quantum measurement will be random, sampled from a probability distribution that is defined by the measured…

cond-mat.quant-gas2014★ 42 cited

Non-destructive selective probing of phononic excitations in a cold Bose gas using impurities

D. Hangleiter, M. T. Mitchison, T. H. Johnson +3

We introduce a detector that selectively probes the phononic excitations of a cold Bose gas. The detector is composed of a single impurity atom confined by a double-well potential,…