Coherence of a charge stabilised tin-vacancy spin in diamond

Quantum information processing (QIP) with solid state spin qubits strongly depends on the efficient Quantum information processing (QIP) with solid state spin qubits strongly depends on the efficient initialisation of the qubit’s desired charge state. While the negatively charged tin-vacancy (SnV−) centre in diamond has emerged as an excellent platform…

Continue reading

Communication with Unreliable Entanglement Assistance

Entanglement resources can increase transmission rates substantially. Unfortunately, entanglement is a fragile resource that is quickly degraded by decoherence effects. In order to generate entanglement for optical communication, the transmitter first prepares an entangled photon pair locally, and then transmits one of the photons to the receiver through an optical…

Continue reading

Sharing Classical Secrets with Continuous-Variable Entanglement: Composable
Security and Network Coding Advantage

Secret sharing is a multiparty cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed). When sharing classical secrets (as opposed to quantum states), one can distinguish…

Continue reading

Simulating quantum repeater strategies for multiple satellites

A global quantum repeater network involving satellite-based links is likely to have advantages over fiber-based networks in terms of long-distance communication, since the photon losses in free space scale only polynomially with the distance — compared to the exponential losses in optical fibers. To simulate the performance of such networks,…

Continue reading

Identification over Compound Multiple-Input Multiple-Output Broadcast Channels

The identification capacity region of the compound broadcast channel is determined under an average error criterion, where the sender has no channel state information. We give single-letter identification capacity formulas for discrete channels and multiple-input multiple-output Gaussian channels under an average input constraint. The capacity theorems apply to general discrete…

Continue reading

Rate limits in quantum networks with lossy repeaters

The derivation of ultimate limits to communication over certain quantum repeater networks have provided extremely valuable benchmarks for assessing near-term quantum communication protocols. However, these bounds are usually derived in the limit of ideal devices and leave questions about the performance of practical implementations unanswered. To address this challenge, we…

Continue reading