Standard communication systems have transmission spectra that characterize their ability to perform frequency multiplexing over a finite bandwidth. Realistic quantum signals in quantum communication systems like transducers are inherently limited in time due to intrinsic decoherence and finite latency, which hinders the direct implementation of frequency-multiplexed encoding. We investigate quantum channel capacities for bandwidth-and-time-limited (BTL) channels to establish the optimal communication strategy in a realistic setting. For pure-loss bosonic channels, we derive analytical solutions of the optimal encoding and decoding modes for Lorentzian and box transmission spectra, along with numerical solutions for various other transmissions. Our findings reveal a general feature of sequential activation of quantum channels as the input signal duration increases, as well as the existence of optimal signal length for scenarios where only a limited number of channels are in use.
Standard communication systems have transmission spectra that characterize their ability to perform frequency multiplexing over a finite bandwidth. Realistic quantum signals in quantum communication systems like transducers are inherently limited in time due to intrinsic decoherence and finite latency, which hinders the direct implementation of frequency-multiplexed encoding. We investigate quantum channel capacities for bandwidth-and-time-limited (BTL) channels to establish the optimal communication strategy in a realistic setting. For pure-loss bosonic channels, we derive analytical solutions of the optimal encoding and decoding modes for Lorentzian and box transmission spectra, along with numerical solutions for various other transmissions. Our findings reveal a general feature of sequential activation of quantum channels as the input signal duration increases, as well as the existence of optimal signal length for scenarios where only a limited number of channels are in use.
High-performance quantum transducers, which faithfully convert quantum information between disparate physical carriers, are essential in quantum science and technology. Different figures of merit, including efficiency, bandwidth, and added noise, are typically used to characterize the transducers' ability to transfer quantum information. Here we utilize quantum capacity, the highest achievable qubit communication rate through a channel, to define a single metric that unifies various criteria of a desirable transducer. Using the continuous-time quantum capacities of bosonic pure-loss channels as benchmarks, we investigate the optimal designs of generic quantum transduction schemes implemented by transmitting external signals through a coupled bosonic chain. With physical constraints on the maximal coupling rate [Formula: see text], the highest continuous-time quantum capacity [Formula: see text] is achieved by transducers with a maximally flat conversion frequency response, analogous to Butterworth electric filters. We further investigate the effect of thermal noise on the performance of transducers.
The quantum capacity of a memoryless channel determines the maximal rate at which we can communicate reliably over asymptotically many uses of the channel. Here we illustrate that this asymptotic characterization is insufficient in practical scenarios where decoherence severely limits our ability to manipulate large quantum systems in the encoder and decoder. In practical settings, we should instead focus on the optimal trade-off between three parameters: the rate of the code, the size of the quantum devices at the encoder and decoder, and the fidelity of the transmission. We find approximate and exact characterizations of this trade-off for various channels of interest, including dephasing, depolarizing and erasure channels. In each case, the trade-off is parameterized by the capacity and a second channel parameter, the quantum channel dispersion. In the process, we develop several bounds that are valid for general quantum channels and can be computed for small instances.
Quantum transducers convert quantum signals through hybrid interfaces of physical platforms in quantum networks. Modeled as quantum communication channels, performance of unidirectional quantum transduction can be measured by the quantum channel capacity. However, characterizing performance of quantum transducers used for duplex quantum transduction where signals are converted bidirectionally remains an open question. Here, we propose rate regions to characterize the performance of duplex quantum transduction. Using this tool, we find that quantum transducers optimized for simultaneous duplex transduction can outperform strategies based on the standard protocol of time-shared unidirectional transduction. Integrated over the frequency domain, we demonstrate that the rate region can also characterize quantum transducers with finite bandwidth.
A pure-loss bosonic channel is a simple model for communication over free-space or fiber-optic links. More generally, phase-insensitive bosonic channels model other kinds of noise, such as thermalizing or amplifying processes. Recent work has established the classical capacity of all of these channels, and furthermore, it is now known that a strong converse theorem holds for the classical capacity of these channels under a particular photon-number constraint. The goal of the present paper is to initiate the study of second-order coding rates for these channels, by beginning with the simplest one, the pure-loss bosonic channel. In a second-order analysis of communication, one fixes the tolerable error probability and seeks to understand the back-off from capacity for a sufficiently large yet finite number of channel uses. We find a lower bound on the maximum achievable code size for the pure-loss bosonic channel, in terms of the known expression for its capacity and a quantity called channel dispersion. We accomplish this by proving a general “one-shot” coding theorem for channels with classical inputs and pure-state quantum outputs which reside in a separable Hilbert space. The theorem leads to an optimal second-order characterization when the channel output is finite-dimensional, and it remains an open question to determine whether the characterization is optimal for the pure-loss bosonic channel.
We study quantum communication, entanglement distribution, and secret-key generation through multimode bosonic loss and fading channels, assisted by local quantum operations and two-way classical communication. Using sector teleportation, we determine the exact two-way quantum and secret-key capacities of multimode pure-loss channels under a mean photon-number constraint, allowing arbitrary adaptive quantum protocols. We extend these results to continuous frequency-dependent loss under a power constraint and identify the optimal allocation of photons among optical modes. For constant loss over an unlimited bandwidth, we obtain a closed-form capacity proportional to the square root of power. For randomly varying loss, we determine exact finite-energy capacities when the channel realization is publicly revealed, distinguishing knowledge before and after transmission. When fading remains unobserved, we derive capacity bounds and explicit formulas for an on/off channel. We also establish strong-converse bounds, with exact thresholds for the deterministic loss models considered here, observed fading, and unobserved fading with finitely many possible transmissivities. Under mean energy constraints, these thresholds generally exceed the corresponding finite-energy capacities. These results guide energy allocation and provide benchmarks for energy-constrained optical quantum communication with multimode signals and variable loss.
Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the optimal information transmission rate, is in general challenging. In this work, we derive the quantum capacity and entanglement-assisted quantum capacity of the bosonic continuous-variable erasure channel when subject to energy constraints. We then construct random codes based on scrambling information within the typical subspace of the encoding state and prove that these codes are asymptotically optimal up to a constant gap. Finally, using our random coding scheme we design a bosonic variation of the Hayden-Preskill protocol and find that information recovery depends on the ratio between the input and output modes. This is in contrast with the conventional discrete-variable scenario which requires only a fixed number of additional output qudits.