pith. machine review for the scientific record. sign in

arxiv: 1612.06812 · v1 · submitted 2016-12-20 · 🪐 quant-ph

Recognition: unknown

Efficient quantum computation in a network with probabilistic gates and logical encoding

Authors on Pith no claims yet
classification 🪐 quant-ph
keywords quantumgatescomputationencodingapproachefficientfidelityheralded
0
0 comments X
read the original abstract

A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from linear optical quantum computation in order to perform high fidelity quantum gates across a quantum network. The error-detecting properties of the heralded operations ensure high fidelity while the encoding makes it possible to correct for failed attempts such that deterministic and high-quality gates can be achieved. Importantly, this is robust to photon loss, which is typically the main obstacle to photonic based quantum information processing. Overall this approach opens a novel path towards quantum networks with atomic nodes and photonic links.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.