English
Related papers

Related papers: Scalability of quantum computation with addressabl…

200 papers

We present a new approach to scalable quantum computing--a ``qubus computer''--which realises qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be ``static'' matter qubits…

Quantum Physics · Physics 2009-11-11 T. P. Spiller , Kae Nemoto , Samuel L. Braunstein , W. J. Munro , P. van Loock , G. J. Milburn

We analyze the use of photonic links to enable large-scale fault-tolerant connectivity of locally error-corrected modules based on neutral atom arrays. Our approach makes use of recent theoretical results showing the robustness of surface…

Many quantum computing platforms are based on a two-dimensional physical layout. Here we explore a concept called looped pipelines which permits one to obtain many of the advantages of a 3D lattice while operating a strictly 2D device. The…

Quantum Physics · Physics 2025-01-23 Zhenyu Cai , Adam Siegel , Simon Benjamin

Topological error correction codes are promising candidates to protect quantum computations from the deteriorating effects of noise. While some codes provide high noise thresholds suitable for robust quantum memories, others allow…

Quantum Physics · Physics 2017-11-07 Hendrik Poulsen Nautrup , Nicolai Friis , Hans J. Briegel

Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. However, due to the noise and the limited scale of current quantum…

Quantum Physics · Physics 2024-03-05 Julien Gacon

In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…

Quantum Physics · Physics 2024-12-11 Harry Buhrman , Marten Folkertsma , Bruno Loff , Niels M. P. Neumann

We investigate the possibility of realising effective quantum gates between two atoms in distant cavities coupled by an optical fibre. We show that highly reliable swap and entangling gates are achievable. We exactly study the stability of…

Quantum Physics · Physics 2007-05-23 Alessio Serafini , Stefano Mancini , Sougato Bose

As the size and complexity of a quantum computer increases, quantum bit (qubit) characterization and gate optimization become complex and time-consuming tasks. Current calibration techniques require complicated and verbose measurements to…

In this paper, we place bounds on when it is impossible to purify a noisy two-qubit state if all the gates used in the purification protocol are subject to adversarial local, independent, noise. It is found that the gate operations must be…

Quantum Physics · Physics 2008-05-20 Alastair Kay

Full connectivity of qubits is necessary for most quantum algorithms, which is difficult to directly implement on Noisy Intermediate-Scale Quantum processors. However, inserting swap gate to enable the two-qubit gates between uncoupled…

Quantum Physics · Physics 2021-02-03 Bin-Han Lu , Yu-Chun Wu , Wei-Cheng Kong , Qi Zhou , Guo-Ping Guo

Robust gate sequences are widely used to reduce the sensitivity of gate operations to experimental imperfections. Typically, the optimization minimizes the average gate error, however, recent work in quantum error correction has…

Quantum Physics · Physics 2023-10-31 Sven Jandura , Jeff D Thompson , Guido Pupillo

The realization of fault-tolerant quantum computation hinges on the ability to execute deep quantum circuits while maintaining gate fidelities consistently above error-correction thresholds. Although neutral-atom arrays have recently…

In order to achieve error rates necessary for advantageous quantum algorithms, Quantum Error Correction (QEC) will need to be employed, improving logical qubit fidelity beyond what can be achieved physically. As today's devices begin to…

Fault-tolerant quantum computation critically depends on architectures uniting high encoding rates with physical implementability. Quantum low-density parity-check (qLDPC) codes, including bivariate bicycle (BB) codes, achieve dramatic…

Quantum Physics · Physics 2025-06-24 Yingli Yang , Guo Zhang , Ying Li

We develop a layered quantum computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent…

Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing (FTQC) architectures. However, all of the known hardware implementations of these codes…

High-quality two-qubit gate operations are crucial for scalable quantum information processing. Often, the gate fidelity is compromised when the system becomes more integrated. Therefore, a low-error-rate, easy-to-scale two-qubit gate…

Quantum Physics · Physics 2020-12-24 Yuan Xu , Ji Chu , Jiahao Yuan , Jiawei Qiu , Yuxuan Zhou , Libo Zhang , Xinsheng Tan , Yang Yu , Song Liu , Jian Li , Fei Yan , Dapeng Yu

We analyze the operation of quantum gates for neutral atoms with qubits that are delocalized in space, i.e., the computational basis states are defined by the presence of a neutral atom in the ground state of one out of two trapping…

Quantum Physics · Physics 2009-11-07 J. Mompart , K. Eckert , W. Ertmer , G. Birkl , M. Lewenstein

The ability to execute a large number of quantum gates in parallel is a fundamental requirement for quantum error correction, allowing an error threshold to exist under the finite coherence time of physical qubits. Recently, two-dimensional…

Quantum Physics · Physics 2025-01-20 Fangxuan Liu , Gaoxiang Tang , Luming Duan , Yukai Wu

The establishment of a scalable scheme for quantum computing with addressable and long-lived qubits would be a scientific watershed, harnessing the laws of quantum physics to solve classically intractable problems. The design of many…

Quantum Physics · Physics 2010-04-23 N. Lundblad , J. M. Obrecht , I. B. Spielman , J. V. Porto