The highest current estimates for the amount of noise a quantum computer can tolerate are based on fault-tolerance schemes relying heavily on postselecting on no detected errors. However, there has been no proof that these schemes give even a positive tolerable noise threshold. A technique to prove a positive threshold, for probabilistic noise models, is presented. The main idea is to maintain strong control over the distribution of errors in the quantum state at all times. This distribution has correlations which conceivably could grow out of control with postselection. But in fact, the error distribution can be written as a mixture of nearby distributions each satisfying strong independence properties, so there are no correlations for postselection to amplify.
Genuine multipartite nonlocality (GMN), the strongest form of multipartite nonlocality that describes fully collective nonlocal correlations among all experimental parties, can be observed when different distant parties each locally measure a particle from a shared entangled many-particle state. For the demonstration of GMN, the experimentally observed statistics are typically postselected: Events for which some parties do not detect a particle must be discarded. This coincidence postselection generally leads to the detection loophole that invalidates a proper nonlocality demonstration. In thi…
Device-independent quantum key distribution (QKD) can permit the superior security even with unknown devices. In practice, however, the realization of device-independent QKD is technically challenging because of its low noise tolerance. In photonic setup, due to the limited detection efficiency, a large amount of the data generates from no-detection events which contain little correlations but contribute high errors. Here we propose the device-independent QKD protocol with random post selection, where the secret keys are extracted only from the post-selected subset of outcomes. This could not …
Fault-tolerant cluster states form the basis for scalable measurement-based quantum computation. Recently, new stabilizer codes for scalable circuit-based quantum computation have been introduced that have very high thresholds under biased noise where the qubit predominantly suffers from one type of error, e.g. dephasing. However, extending these advances in stabilizer codes to generate high-threshold cluster states for biased noise has been a challenge, as the standard method for foliating stabilizer codes to generate fault-tolerant cluster states does not preserve the noise bias. In this wor…
In the shallow sub-threshold regime, fault-tolerant quantum computation requires a tremendous amount of qubits. In this paper, we study the error correction in the deep sub-threshold regime. We estimate the physical error rate for achieving the logical error rates of $10^{-6} - 10^{-15}$ using few-qubit codes, i.e. short repetition codes, small surface codes and the Steane code. Error correction circuits that are efficient for biased error channels are identified. Using the Steane code, when error channels are biased with a ratio of $10^{-3}$, the logical error rate of $10^{-15}$ can be achiev…
Surface code is an error-correcting method that can be applied to the implementation of a usable quantum computer. At present, a promising candidate for a usable quantum computer is based on superconductor-specifically transmon. Because errors in transmon-based quantum computers appear biasedly as Z type errors, tailored surface and XZZX codes have been developed to deal with the type errors. Even though these surface codes have been suggested for lattice structures, since transmons-based quantum computers, developed by IBM, have a heavy-hexagon structure, it is natural to ask how tailored sur…
We investigate a scheme for topological quantum computing using optical hybrid qubits and make an extensive comparison with previous all-optical schemes. We show that the photon loss threshold reported by Omkar {\it et al}. [Phys. Rev. Lett. 125, 060501 (2020)] can be improved further by employing postselection and multi-Bell-state-measurement based entangling operation to create a special cluster state, known as Raussendorf lattice for topological quantum computation. In particular, the photon loss threshold is enhanced up to $5.7\times10^{-3}$, which is the highest reported value given a rea…
Hybrid Quantum Error Correction and Mitigation by Purification
New York University Shanghai（纽约大学上海分校）；NYU-ECNU Institute of Physics at NYU Shanghai（纽约大学上海纽约大学-华东师范大学物理研究所）；Department of Physics, New York University（纽约大学物理系）；Center for Quantum and Topological Systems (CQTS), NYUAD Research Institute, New York University Abu Dhabi（阿布扎比纽约大学研究学院量子与拓扑系统中心）；New York University（纽约大学）
Quantum non-demolition measurements as a practical primitive for fault-tolerant computation against biased noise
Alice & Bob（爱丽丝与鲍勃公司）；Laboratoire de Physique de l’École Normale Supérieure, École Normale Supérieure, Centre Automatique et Systèmes, Mines Paris, Université PSL, CNRS, Inria（巴黎高等师范学院物理实验室，巴黎高等师范学院，自动系统与矿业学院，巴黎高等矿业学院，PSL大学，法国国家科学研究中心，法国国家信息与自动化研究所）
Surface-Code Thresholds and Qubit Footprints in Shuttling-Based Spin-Qubit Railways
Donostia International Physics Center（多诺斯蒂亚国际物理中心）；Department of Basic Sciences, Tecnun - University of Navarra（纳瓦拉大学特库恩基础科学系）；Research and Development Group, Hitachi, Ltd.（日立有限公司研发集团）；Hitachi Cambridge Laboratory（日立剑桥实验室）
Recent work has demonstrated that high-threshold quantum error correction is possible for biased-noise qubits, provided one can implement a controlled-not (CX) gate that preserves the bias. Bias-preserving CX gates have been proposed for several biased-noise qubit platforms, most notably Kerr cats. However, experimentally measuring the noise bias is challenging as it requires accurately estimating certain low-probability Pauli errors in the presence of much larger state preparation and measurement (SPAM) errors. In this paper, we introduce bias randomized benchmarking (BRB) as a technique for …
Fault-Tolerant Non-Clifford GKP Gates using Polynomial Phase Gates and On-Demand Noise Biasing
QuTech, Delft University of Technology（代尔夫特理工大学 QuTech）；Kavli Institute of Nanoscience, Delft University of Technology（代尔夫特理工大学 卡弗里纳米科学研究所）；Delft Institute of Applied Mathematics, Delft University of Technology（代尔夫特理工大学 应用数学研究所）
Spectral properties and coding transitions of Haar-random quantum codes
Princeton University（普林斯顿大学）；Max Planck Institute for the Physics of Complex Systems（马克斯·普朗克复杂系统物理研究所）；University of California, Berkeley（加州大学伯克利分校）；California Institute of Technology（加州理工学院）
Biased-noise qubits: a guide to efficient fault-tolerance using the hierarchy of errors
Alice & Bob；Laboratoire de Physique de l’École Normale Supérieure, École Normale Supérieure, Centre Automatique et Systèmes, Mines Paris, Université PSL, CNRS, Inria, Paris, France（巴黎高等师范学院物理实验室，巴黎高等师范学院，自动与系统中心，巴黎矿业学院，PSL大学，法国国家科学研究中心，法国国家信息与自动化研究所）
Entropy threshold: A simple proxy for performance of quantum error correction
AWS Center for Quantum Computing（亚马逊量子计算中心）；Yale Quantum Institute & Department of Applied Physics, Yale University（耶鲁大学量子研究所与应用物理系）；Alice & Bob；Laboratoire de Physique de l’École Normale Supérieure, École Normale Supérieure, Centre Automatique et Systèmes, Mines Paris, Université PSL, CNRS, Inria（巴黎高等师范学院物理实验室、巴黎高等师范学院、自动与系统中心、巴黎矿业学院、巴黎文理研究大学、法国国家科学研究中心、Inria）
The error threshold of a one-parameter family of quantum channels is defined as the largest noise level such that the quantum capacity of the channel remains positive. This in turn guarantees the existence of a quantum error correction code for noise modeled by that channel. Discretizing the single-qubit errors leads to the important family of Pauli quantum channels; curiously, multipartite entangled states can increase the threshold of these channels beyond the so-called hashing bound, an effect termed superadditivity of coherent information. In this work, we divide the simplex of Pauli chann…
