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

TL;DR

This paper introduces a method combining heralded probabilistic gates with logical encoding to enable high-fidelity, deterministic quantum gates in a network, robust against photon loss, advancing quantum network scalability.

Contribution

It presents a novel approach integrating heralded gates with logical encoding for efficient, high-fidelity quantum computation in networks with probabilistic operations.

Findings

Achieves high-fidelity quantum gates using heralded operations and logical encoding.

Robust to photon loss, improving photonic quantum information processing.

Enables deterministic quantum gates in a probabilistic setting.

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.