English
Related papers

Related papers: A universal neutral-atom quantum computer with ind…

200 papers

Programmable neutral-atom arrays offer a promising route toward scalable quantum computing, where coherent qubit transfer enables non-local connectivity and reduces resource overhead. However, transfer speed and motional heating remain key…

Quantum Physics · Physics 2026-04-10 Jia-Chao Wang , Zai-Zheng Zhang , Xiao Li , Guang-Wei Wang , Xiao-Dong He , Min Liu , Peng Xu

Neutral atoms are among the leading platforms toward realizing fault-tolerant quantum computation (FTQC). However, scaling up a single neutral-atom device beyond $\sim 10^4$ atoms to meet the demands of FTQC for practical applications…

Quantum Physics · Physics 2025-02-18 Shinichi Sunami , Shiro Tamiya , Ryotaro Inoue , Hayata Yamasaki , Akihisa Goban

Quantum simulations of electronic structure and strongly correlated quantum phases are widely regarded as among the most promising applications of quantum computing. These computations naturally benefit from native fermionic encodings,…

Developing optimal strategies to calibrate quantum processors for high-fidelity operation is one of the outstanding challenges in quantum computing today. Here, we demonstrate multiple examples of high-fidelity operations achieved using a…

Individual neutral atoms excited to Rydberg states are a promising platform for quantum simulation and quantum information processing. However, experimental progress to date has been limited by short coherence times and relatively low gate…

We propose a scalable quantum-computing architecture based on cold atoms confined to sites of a tight optical lattice. The lattice is placed in a non-uniform magnetic field and the resulting Zeeman sublevels define qubit states. Microwave…

Quantum Physics · Physics 2009-11-10 Andrei Derevianko , Caleb C. Cannon

We present a robust protocol for implementing high-fidelity multiqubit controlled phase gates $(C^kZ)$ on neutral atom qubits coupled to highly excited Rydberg states. Our approach is based on extending adiabatic rapid passage to two-photon…

Quantum Physics · Physics 2022-10-13 Gerard Pelegrí , Andrew J. Daley , Jonathan D. Pritchard

A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates…

Quantum Physics · Physics 2007-05-23 P. Oscar Boykin , Tal Mor , Matthew Pulver , Vwani Roychowdhury , Farrokh Vatan

Fault-tolerant quantum error correction provides a strategy to protect information processed by a quantum computer against noise which would otherwise corrupt the data. A fault-tolerant universal quantum computer must implement a universal…

Quantum computing promises to solve problems previously deemed infeasible. However, high error rates necessitate quantum error correction for practical applications. Seminal experiments with zoned neutral atom architectures have shown…

Quantum Physics · Physics 2025-06-03 Yannick Stade , Ludwig Schmid , Lukas Burgholzer , Robert Wille

Arbitrarily accurate fault-tolerant (FT) universal quantum computation can be carried out using the Clifford gates Z, S, CNOT plus the non-Clifford T gate. Moreover, a recent improvement of the Solovay-Kitaev theorem by Kuperberg implies…

Quantum Physics · Physics 2024-07-02 H. F. Chau

A scheme for globally addressing a quantum computer is presented along with its realisation in an optical lattice setup of one, two or three dimensions. The required resources are mainly those necessary for performing quantum simulations of…

Quantum Physics · Physics 2015-06-26 Alastair Kay , Jiannis K. Pachos

We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…

Quantum Physics · Physics 2014-03-06 G. Ivanyos , S. Massar , A. B. Nagy

Gate fidelity -- an average fidelity over all possible input states -- is the workhorse metric for benchmarking quantum gates or circuits, yet fault-tolerant quantum computing ultimately depends on the worst-case behavior, typically…

Quantum Physics · Physics 2026-03-10 Kyoungho Cho , Ilkwon Sohn , Yongsoo Hwang , Jeongho Bang

In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components;…

Quantum Physics · Physics 2013-05-29 Ying Li , Sean D. Barrett , Thomas M. Stace , Simon C. Benjamin

A novel two-qubit entangling gate for trapped-ion quantum processors is proposed theoretically and demonstrated experimentally. During the gate, double-dressed quantum states are created by applying a phase-modulated continuous driving…

We report the characterization of a universal set of logic gates for one-way quantum computing using a four-photon `star' cluster state generated by fusing photons from two independent photonic crystal fibre sources. We obtain a fidelity…

Quantum Physics · Physics 2013-12-25 B. A. Bell , M. S. Tame , A. S. Clark , R. W. Nock , W. J. Wadsworth , J. G. Rarity

We demonstrate arbitrary coherent addressing of individual neutral atoms in a $5\times 5\times 5$ array formed by an optical lattice. Addressing is accomplished using rapidly reconfigurable crossed laser beams to selectively ac Stark shift…

Quantum Physics · Physics 2015-07-29 Yang Wang , Xianli Zhang , Theodore A. Corcovilos , Aishwarya Kumar , David S. Weiss

We experimentally demonstrate a virtual two-qubit gate and characterize it using quantum process tomography~(QPT). The virtual two-qubit gate decomposes an actual two-qubit gate into single-qubit unitary gates and projection gates in…

We demonstrate universal quantum control over chains of ions in a surface-electrode ion trap, including all the fundamental operations necessary to perform algorithms in a one-dimensional, nearest-neighbor quantum computing architecture. We…