Related papers: A Mathematical Structure for Amplitude-Mixing Erro…
Traditional quantum error correction involves the redundant encoding of k quantum bits using n quantum bits to allow the detection and correction of any t bit error. The smallest general t=1 code requires n=5 for k=1. However, the dominant…
Crosstalk and several sources of operational interference are invisible when qubit or a gate is calibrated or benchmarked in isolation. These are unlocked during the execution of full quantum circuit applying entangling gates to several…
Fault-tolerant quantum computers rely on Quantum Error-Correcting Codes (QECCs) to protect information from noise. However, no single error-correcting code supports a fully transversal and therefore fault-tolerant implementation of all…
Quantum error-correcting codes protect fragile quantum information by encoding it redundantly, but identifying codes that perform well in practice with minimal overhead remains difficult due to the combinatorial search space and the high…
To realize fault-tolerant quantum computing, it is necessary to store quantum information in logical qubits with error correction functions, realized by distributing a logical state among multiple physical qubits or by encoding it in the…
We present a set of efficiently implementable logical multi-qubit gates in concatenated quantum error correction codes using parity qubits. In particular, we show how fault-tolerant high-weight rotation gates of arbitrary angle can be…
Bosonic systems offer unique advantages for quantum error correction, as a single bosonic mode provides a large Hilbert space to redundantly encode quantum information. However, previous studies have been limited to exploiting symmetries in…
Quantum error correction plays an important role in fault-tolerant quantum information processing. It is usually difficult to experimentally realize quantum error correction, as it requires multiple qubits and quantum gates with high…
Postselected quantum computation is distinguished from regular quantum computation by accepting the output only if measurement outcomes satisfy predetermined conditions. The output must be accepted with nonzero probability. Methods for…
Practical quantum computation heavily relies on the ability to perform quantum error correction in a fault-tolerant manner. Fault-tolerant encoding is a critical first step, and careful consideration of the error correction cycle that…
In this work, we propose a novel key reconciliation protocol for the quantum key distribution (QKD). Based on Newton's polynomial interpolation, the proposed protocol aims to correct all erroneous bits at the receiver without revealing…
Noise-biased qubits are a promising route toward significantly reducing the hardware overhead associated with quantum error correction. The squeezed cat code, a non-local encoding in phase space based on squeezed coherent states, is an…
Continuous-variable systems protected by bosonic quantum error-correcting codes have emerged as a promising platform for quantum information processing. To date, design of codewords has centered on optimizing the occupation of basis states…
We present a two-step decoder for the parity code and evaluate its performance in code-capacity and faulty-measurement settings. For noiseless measurements, we find that the decoding problem can be reduced to a series of repetition codes…
Quantum optical frequency combs provide an intriguing approach to high-dimensional quantum states. Because of the need to move probabilities among different colors, the realization of gates appropriate to multicolor photons requires…
Physical qubits in a quantum computer are often represented by superposition states of single particles or excitations. Decay of the excitation itself is a fundamental error channel that is difficult to overcome via external drive or…
It has previously been shown that probabilistic quantum logic operations can be performed using linear optical elements, additional photons (ancilla), and post-selection based on the output of single-photon detectors. Here we describe the…
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…
Achieving reliable performance on early fault-tolerant quantum hardware will depend on protocols that manage noise without incurring prohibitive overhead. We propose a novel framework that integrates quantum computation with the…
Quantum information is vulnerable to environmental noise and experimental imperfections, hindering the reliability of practical quantum information processors. Therefore, quantum error correction (QEC) that can protect quantum information…