The early Gottesman, Kitaev, and Preskill (GKP) proposal for encoding a qubit in an
oscillator has recently been followed by cat-and binomial-code proposals. Numerically …

Continuous quantum error correction has been found to have certain advantages over
discrete quantum error correction, such as a reduction in hardware resources and the …

Quantum channels can describe all transformations allowed by quantum mechanics. We
adapt two existing works [S. Lloyd and L. Viola, Phys. Rev. A 65, 010101 (2001) PLRAAN …

A quantum code is a subspace of a Hilbert space of a physical system chosen to be
correctable against a given class of errors, where information can be encoded. Ideally, the …

Two quantum channels are called compatible if they can be obtained as marginals from a
single broadcasting channel; otherwise they are incompatible. We derive a characterization …

We introduce and analyze approximate quantum secret sharing in a formal cryptographic
setting, wherein a dealer encodes and distributes a quantum secret to players such that …

Traditional quantum error-correcting codes are designed for the depolarizing channel
modeled by generalized Pauli errors occurring with equal probability. Amplitude damping …

Alice and Bob receive a bipartite state (possibly entangled) from some finite collection or
from some subspace. Alice sends a message to Bob through a noisy quantum channel such …

The Knill-Laflamme conditions distinguish exact quantum error correction codes, and they
have played a critical role in the discovery of state-of-the-art codes. However, the family of …

The robustness of quantum memory against physical noises is measured by two methods:
the exact and approximate quantum error correction (QEC) conditions for error recoverability …