Related papers: Oscillator-to-oscillator codes do not have a thres…
We address the challenge of crosstalk in quantum multiplexing -an obstacle to scaling throughput in quantum communication networks. Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity. We propose a…
The surface code is one the most promising alternatives for implementing fault-tolerant, large-scale quantum information processing. Its high threshold for single-qubit errors under stochastic noise is one of its most attrative features. We…
The constituent parts of a quantum computer are inherently vulnerable to errors. To this end we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a…
Boson sampling, a computational problem conjectured to be hard to simulate on a classical machine, is a promising candidate for an experimental demonstration of quantum advantage using bosons. However, inevitable experimental noise and…
Topological subsystem codes proposed recently by Bombin are quantum error correcting codes defined on a two-dimensional grid of qubits that permit reliable quantum information storage with a constant error threshold. These codes require…
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…
Quantum error correction is vital for implementing universal quantum computing. A key component is the encoding circuit that maps a product state of physical qubits into the encoded multipartite entangled logical state. Known methods are…
The stable operation of quantum computers will rely on error-correction, in which single quantum bits of information are stored redundantly in the Hilbert space of a larger system. Such encoded qubits are commonly based on arrays of many…
Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of…
We introduce a variational method for analyzing limit cycle oscillators in $\mathbb{R}^d$ driven by Gaussian noise. This allows us to derive exact stochastic differential equations (SDEs) for the amplitude and phase of the solution, which…
Determining the quantum capacity of a noisy quantum channel is an important problem in the field of quantum communication theory. In this work, we consider the Gaussian random displacement channel $N_{\sigma}$, a type of bosonic Gaussian…
In this paper we do a detailed numerical investigation of the fault-tolerant threshold for optical cluster-state quantum computation. Our noise model allows both photon loss and depolarizing noise, as a general proxy for all types of local…
Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless.…
We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit…
Physical platforms such as trapped ions suffer from coherent noise where errors manifest as rotations about a particular axis and can accumulate over time. We investigate passive mitigation through decoherence free subspaces, requiring the…
While 2-level systems, aka qubits, are a natural choice to perform a logical quantum computation, the situation is less clear at the physical level. Encoding information in higher-dimensional physical systems can indeed provide a first…
We construct a new class of quantum error-correcting codes for a bosonic mode which are advantageous for applications in quantum memories, communication, and scalable computation. These 'binomial quantum codes' are formed from a finite…
With rapid advances in quantum hardware, a central question is whether quantum devices with or without full error correction can outperform classical computers on practically relevant problems. Variational Quantum Algorithms (VQAs) have…
We study the robustness of a fault-tolerant quantum computer subject to Gaussian non-Markovian quantum noise, and we show that scalable quantum computation is possible if the noise power spectrum satisfies an appropriate "threshold…
The quantum logic gates used in the design of a quantum computer should be both universal, meaning arbitrary quantum computations can be performed, and fault-tolerant, meaning the gates keep errors from cascading out of control. A number of…