English
Related papers

Related papers: Fault-Tolerant Computing With Biased-Noise Superco…

200 papers

Superconducting qubits are one of the most promising candidates to implement quantum computers. The superiority of superconducting quantum computers over any classical device in simulating random but well-determined quantum circuits has…

Continuous gate sets are a key ingredient for near-term quantum algorithms. Here, we demonstrate a hardware-efficient, continuous set of controlled arbitrary-phase ($\mathrm{C}Z_{\theta}$) gates acting on flux-tunable transmon qubits. This…

We present a fault-tolerant universal quantum computing architecture based on a code concatenation of biased-noise qubits and the parity architecture. The parity architecture can be understood as an LDPC code tailored specifically to obtain…

Quantum Physics · Physics 2025-12-01 Anette Messinger , Valentin Torggler , Berend Klaver , Michael Fellner , Wolfgang Lechner

Quantum information processors promise fast algorithms for problems inaccessible to classical computers. But since qubits are noisy and error-prone, they will depend on fault-tolerant quantum error correction (FTQEC) to compute reliably.…

The superconducting fluxonium qubit has a great potential for high-fidelity quantum gates with its long coherence times and strong anharmonicity at the half flux quantum sweet spot. However, current implementations of two-qubit gates…

We analyze analytically, semi-analytically, and numerically the operation of Cross-Resonance (CR) gate for superconducting qubits (transmons). We find that a relatively simple semi-analytical method gives accurate results for the…

Quantum Physics · Physics 2019-07-15 Vinay Tripathi , Mostafa Khezri , Alexander N. Korotkov

As quantum circuits become more integrated and complex, additional error sources that were previously insignificant start to emerge. Consequently, the fidelity of quantum gates benchmarked under pristine conditions falls short of predicting…

The promise of tremendous computational power, coupled with the development of robust error-correcting schemes, has fuelled extensive efforts to build a quantum computer. The requirements for realizing such a device are confounding:…

Quantum Physics · Physics 2011-08-17 J L O'Brien , G J Pryde , A G White , T C Ralph , D Branning

We develop a scheme for fault-tolerant quantum computation based on asymmetric Bacon-Shor codes, which works effectively against highly biased noise dominated by dephasing. We find the optimal Bacon-Shor block size as a function of the…

Quantum Physics · Physics 2013-03-08 Peter Brooks , John Preskill

Noisy, intermediate-scale quantum computers come with intrinsic limitations in terms of the number of qubits (circuit "width") and decoherence time (circuit "depth") they can have. Here, for the first time, we demonstrate a recently…

Quantum Physics · Physics 2020-09-02 Thomas Ayral , François-Marie Le Régent , Zain Saleem , Yuri Alexeev , Martin Suchara

Designing a qubit architecture is one of the most critical challenges in achieving scalable and fault-tolerant quantum computing as the performance of a quantum computer is heavily dependent on the coherence times, connectivity and low…

We study the performance of SUPCODE---a family of dynamically correcting pulses designed to cancel simultaneously both Overhauser and charge noise for singlet-triplet spin qubits---adapted to silicon devices with electrostatic control. We…

Mesoscale and Nanoscale Physics · Physics 2014-10-22 Xin Wang , Fernando A. Calderon-Vargas , Muhed S. Rana , Jason P. Kestner , Edwin Barnes , Sankar Das Sarma

Quantum error correction protocols have been developed to offset the high sensitivity to noise inherent in quantum systems. However, much is still unknown about the behaviour of a quantum error-correcting code under general noise, including…

Quantum Physics · Physics 2021-06-09 Stefanie J. Beale , Joel J. Wallman

Bosonic codes encode quantum information into a single infinite-dimensional physical system endowed with error correction capabilities. This reduces the need for complex management of many physical constituents compared with standard…

Quantum Physics · Physics 2025-09-03 Long D. H. My , Shushen Qin , Hui Khoon Ng

Designing efficient fault tolerance schemes is crucial for building useful quantum computers. Most standard schemes assume no knowledge of the underlying device noise and rely on general-purpose quantum error-correcting (QEC) codes capable…

Quantum Physics · Physics 2025-03-31 Long D. H. My , Akshaya Jayashankar , Prabha Mandayam , Hui Khoon Ng

We present a gradient-based method to construct high-fidelity, two-qubit quantum gates in a system consisting of two transmon qubits coupled via a tunable coupler. In particular, we focus on single flux quantum (SFQ) pulses as a promising…

Inductively shunted superconducting qubits, such as the unimon qubit, combine high anharmonicity with protection from low-frequency charge noise, positioning them as promising candidates for the implementation of fault-tolerant…

Quantum Physics · Physics 2025-07-29 Rostislav Duda , Eric Hyyppä , Olli Mukkula , Vasilii Vadimov , Mikko Möttönen

We have investigated the realizability of the controlled-NOT (CNOT) gate and characterized the gate operation by quantum process tomography for a chain of qubits, realized by electrons confined in self-assembled quantum dots embedded in the…

Quantum Physics · Physics 2015-06-04 Makoto Unoki , Hiromichi Nakazato , Kazuya Yuasa , Kanji Yoh

Quantum computers have the potential to efficiently simulate large-scale quantum systems for which classical approaches are bound to fail. Even though several existing quantum devices now feature total qubit numbers of more than one…

Quantum Physics · Physics 2023-03-29 Hongye Yu , Yusheng Zhao , Tzu-Chieh Wei

Fault tolerant quantum computing methods which work with efficient quantum error correcting codes are discussed. Several new techniques are introduced to restrict accumulation of errors before or during the recovery. Classes of eligible…

Quantum Physics · Physics 2009-10-31 Andrew M. Steane