English
Related papers

Related papers: An Algorithm for Fast Assembling Large-Scale Defec…

200 papers

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 error-corrected ``logical'' qubits, where information is…

The task of atom rearrangement has emerged in the last decade as a fundamental building block for the development of neutral atom-based quantum processors. However, despite many recent efforts to develop algorithms with favorable asymptotic…

Quantum Physics · Physics 2025-08-05 Nikhil K Harle , Bo-Yu Chen , Bob Bao , Hannes Bernien

We introduce an optical tweezer platform for assembling and individually manipulating a two-dimensional register of nuclear spin qubits. Each nuclear spin qubit is encoded in the ground $^{1}S_{0}$ manifold of $^{87}$Sr and is individually…

Compiling a given quantum algorithm into a target hardware architecture is a challenging optimization problem. The compiler must take into consideration the coupling graph of physical qubits and the gate operation dependencies. The existing…

Quantum Physics · Physics 2024-02-16 Xiangyu Gao , Yuwei Jin , Minghao Guo , Henry Chen , Eddy Z. Zhang

Neutral atom arrays have emerged as a promising platform for both analog and digital quantum processing. Recently, devices capable of reconfiguring arrays during quantum processes have enabled new applications for these systems. Atom…

Programmable quantum systems based on Rydberg atom arrays have recently emerged as a promising testbed for combinatorial optimization. Indeed, the Maximum Weighted Independent Set problem on unit-disk graphs can be efficiently mapped to…

To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance -- how can we realize a relatively noiseless computation by cleverly combining noisy components? -- and compilation -- how can we…

Quantum Physics · Physics 2026-04-29 Jack Weinberg , Narayanan Rengaswamy

Atomic level qubits in silicon are attractive candidates for large-scale quantum computing, however, their quantum properties and controllability are sensitive to details such as the number of donor atoms comprising a qubit and their…

Mesoscale and Nanoscale Physics · Physics 2020-03-17 Muhammad Usman , Yi Z. Wong , Charles D. Hill , Lloyd C. L. Hollenberg

Quantum computers require high-fidelity measurement of many qubits to achieve a quantum advantage. Traditional approaches suffer from readout crosstalk for a neutral-atom quantum processor with a tightly spaced array. Although classical…

We present the first successful trapping of single erbium atoms in an array of optical tweezers. Using a single narrow-line optical transition, we achieve deep cooling for direct tweezer loading, pairwise ejection, and continous imaging…

Atomic Physics · Physics 2025-04-04 D. S. Grün , S. J. M. White , A. Ortu , A. Di Carli , H. Edri , M. Lepers , M. J. Mark , F. Ferlaino

We show that with a purely blue-detuned cooling mechanism we can densely load single neutral atoms into large arrays of shallow optical tweezers. With this ability, more efficient assembly of larger ordered arrays will be possible - hence…

Atomic Physics · Physics 2019-04-08 M. O. Brown , T. Thiele , C. Kiehl , T. -W. Hsu , C. A. Regal

Neutral atom quantum processors provide a viable route to scalable quantum computing, with recent demonstrations of high-fidelity and parallel gate operations and initial implementation of quantum algorithms using both physical and logical…

Quantum Physics · Physics 2024-02-06 K. McInroy , N. Pearson , J. D. Pritchard

We propose a probabilistic quantum algorithm that decides whether a monochrome picture matches a given template (or one out of a set of templates). As a major advantage to classical pattern recognition, the algorithm just requires a few…

Quantum Physics · Physics 2008-08-28 Gernot Schaller , Ralf Schützhold

Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance…

Development of a network for remote entanglement of quantum processors is an outstanding challenge in quantum information science. We propose and analyze a two-species architecture for remote entanglement of neutral atom quantum computers…

Quantum Physics · Physics 2024-06-12 C. B. Young , A. Safari , P. Huft , J. Zhang , E. Oh , R. Chinnarasu , M. Saffman

Single neutral atoms in optical tweezer arrays offer a promising platform for high-fidelity quantum computing at local nodes. Nonetheless, creating entanglement between remote nodes in a distributed quantum network remains challenging due…

Quantum Physics · Physics 2025-08-13 Xiaoshui Lin , Yefeng Mei , Chuanwei Zhang

Reconfigurable neutral-atom arrays are a promising platform for quantum computing, quantum simulation, and quantum metrology, but atom transport using frequency-chirped acousto-optic deflectors (AODs) is limited by chirp-induced acoustic…

The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems. In most state-of-the-art approaches, qubits interact locally,…

Our work is motivated by the challenges presented in preparing arrays of atoms for use in quantum simulation. The recently-developed process of loading atoms into traps results in approximately half of the traps being filled. To consolidate…

Computational Complexity · Computer Science 2025-04-09 Alexandre Cooper , Stephanie Maaz , Amer E. Mouawad , Naomi Nishimura

Entanglement is a powerful concept with an enormous potential for scientific and technological advances. A central focus in modern research is to extend the generation and control of entangled states from few to many qubits, and protect…

Quantum Physics · Physics 2024-06-04 Philip Thomas , Leonardo Ruscio , Olivier Morin , Gerhard Rempe
‹ Prev 1 4 5 6 7 8 10 Next ›