We develop the capacity region for the bosonic broadcast channel in the presence of thermal noise and photon loss due to the environment. The bosonic channel is a quantum-mechanical description of many practical communication links such as optical, microwave, and radiofrequency. We employ our results to find the capacity region for quantum-secure covert broadcast over such channels and show that time-division is optimal as in the classical covert broadcast scenario. We rely on a strong minimum entropy output conjecture, a direct result of the entropy photon-number inequality (EPnI) conjecture.
We develop the capacity region for the bosonic broadcast channel in the presence of thermal noise and photon loss due to the environment. The bosonic channel is a quantum-mechanical description of many practical communication links such as optical, microwave, and radiofrequency. We employ our results to find the capacity region for quantum-secure covert broadcast over such channels and show that time-division is optimal as in the classical covert broadcast scenario. We rely on a strong minimum entropy output conjecture, a direct result of the entropy photon-number inequality (EPnI) conjecture.
This dissertation explores covertness in two quantum settings: communication and computing. Covert communication refers to transmitting over a channel such that an adversary cannot detect the presence of the transmission, whereas covert quantum computing refers to running computations on a quantum computer that are undetectable by an adversary who is also using the same device. Although these problems arise from different physical phenomena, they share the common goal of preventing an adversary from detecting their operation. We begin by presenting the preliminaries and mathematical tools from quantum information theory required for covert analysis of communication over quantum channels and covert quantum computing. We then proceed to explore covert communication over the lossy thermal-noise bosonic channel, a quantum-mechanical model of many practical channels, including optical ones. First, we characterize the covert capacity region of the degraded lossy thermal-noise bosonic broadcast channel. We extend prior work on degraded bosonic broadcast channels to incorporate photon loss to an adversarial environment. We derive the classical capacity region and the covert capacity for the two-receiver case, and extend them to M receivers. We demonstrate that coherent-state encoding achieves these capacities and establish that time-division is optimal in the covert regime. These results rely on a strong minimum entropy output conjecture, a direct result of the entropy photon-number inequality (EPnI) conjecture. Building on covert communication, we develop a system construction for reliable transmission of covert qubits over an arbitrary quantum channel using single- and dual-rail encodings. We apply this construction to the lossy thermal-noise bosonic channel, thereby deriving achievable rates. We further explore the impact of access to a two-way classical communication link. While a tight upper bound remains an open problem, we provide a converse upper bound by decomposing the channel into a concatenation of a pure-loss channel and a quantum-limited amplifier and discarding the former. These bounds demonstrate a \emph{square root law} (SRL) for covert quantum communication similar to that for classical: M(n)∝n qubits can be transmitted covertly and reliably over n uses of the channel. We conjecture that the gap between our lower and upper bounds on the number of reliable covert qubits can be reduced by improving quantum error-correction codes and quantum channel capacity bounds. We then shift our focus to \emph{covert quantum computing}, introducing and formalizing a setting in which an adversary attempts to detect whether computation is occurring on a shared quantum processing unit (QPU) by monitoring a subset of the qubits or qumodes. For superconducting architectures with a nearest-neighbor crosstalk noise model and planar qubit topologies, a circuit remains covert by inserting idle qubits between the qubits running the computation and the remaining qubits on the QPU. Using discrete isoperimetric inequalities, we show that a circuit placement exists such that only O(n) spectator qubits bordering the circuit provide detection information to an adversary, where n is the number of qubits used for computation. Thus, in this setting, the cost of maintaining covertness while also maintaining reliability of the computation is an additional O(n) idle border qubits. We experimentally explore this model on IQM's Emerald processor, using Ramsey experiments on the adversary's qubits to detect gate operations. While nearest-neighbor crosstalk was detected as expected, long-range coupling effects were also observed beyond the border qubits, identifying a side channel that an adversary can exploit for detection. Finally, we discuss the outlook, future research directions, and open problems.
Previous work on the classical information capacities of bosonic channels has established the capacity of the single-user pure-loss channel, bounded the capacity of the single-user thermal-noise channel, and bounded the capacity region of the multiple-access channel. The latter is a multiple-user scenario in which several transmitters seek to simultaneously and independently communicate to a single receiver. We study the capacity region of the bosonic broadcast channel, in which a single transmitter seeks to simultaneously and independently communicate to two different receivers. It is known that the tightest available lower bound on the capacity of the single-user thermal-noise channel is that channel's capacity if, as conjectured, the minimum von Neumann entropy at the output of a bosonic channel with additive thermal noise occurs for coherent-state inputs. Evidence in support of this minimum output entropy conjecture has been accumulated, but a rigorous proof has not been obtained. We propose a minimum output entropy conjecture that, if proved to be correct, will establish that the capacity region of the bosonic broadcast channel equals the inner bound achieved using a coherent-state encoding and optimum detection. We provide some evidence that supports this conjecture, but again a full proof is not available.
Bosonic channels describe quantum-mechanically many practical communication links such as optical, microwave, and radiofrequency. We investigate the maximum rates for the bosonic multiple access channel (MAC) in the presence of thermal noise added by the environment and when the transmitters utilize Gaussian state inputs. We develop an outer bound for the capacity region for the thermal-noise lossy bosonic MAC. We additionally find that the use of coherent states at the transmitters is capacity-achieving in the limits of high and low mean input photon numbers. Furthermore, we verify that coherent states are capacity-achieving for the sum rate of the channel. In the non-asymptotic regime, when a global mean photon-number constraint is imposed on the transmitters, coherent states are the optimal Gaussian state. Surprisingly however, the use of single-mode squeezed states can increase the capacity over that afforded by coherent state encoding when each transmitter is photon number constrained individually.
The trade-off capacity region of a quantum channel characterizes the optimal net rates at which a sender can communicate classical, quantum, and entangled bits to a receiver by exploiting many independent uses of the channel, along with the help of the same resources. Similarly, one can consider a trade-off capacity region when the noiseless resources are public, private, and secret-key bits. We identified [see Wilde, Hayden, and Guha, Phys. Rev. Lett. 108, 140501 (2012)] these trade-off rate regions for the pure-loss bosonic channel and proved that they are optimal provided that a long-standing minimum-output entropy conjecture is true. Additionally, we showed that the performance gains of a trade-off coding strategy when compared to a time-sharing strategy can be quite significant. In this paper, we provide detailed derivations of the results announced there, and we extend the application of these ideas to thermal-noise and amplifying bosonic channels. We also derive a ``rule of thumb'' for trade-off coding, which determines how to allocate photons in a coding strategy if a large mean photon number is available at the channel input. Our results on the amplifying bosonic channel also apply to the ``Unruh channel'' considered in the context of relativistic quantum information theory.
We investigate the fundamental limit of quantumsecure covert communication over the lossy thermal noise bosonic channel, the quantum-mechanical mode underlying many practical channels. We assume that the adversary has unlimited quantum information processing capabilities as well as access to all transmitted photons that do not reach the legitimate receiver. Given existence of noise that is uncontrolled by the adversary, the square root law (SRL) governs covert communication: up to c√(n) covert bits can be transmitted reliably in n channel uses. Attempting to surpass this limit results in detection with unity probability as n → ∞. Here we present the expression for c, characterizing the SRL for the bosonic channel. We also prove that discrete-valued coherent state quadrature phase shift keying (QPSK) constellation achieves the optimal c, which is the same as that achieved by a circularly-symmetric complex-valued Gaussian prior on coherent state amplitude. Finally, while binary phase shift keying (BPSK) achieves the Holevo capacity for non-covert bosonic channels in the low received signal-to-noise ratio regime, we show that it is strictly sub-optimal for covert communication.
Determining the ultimate classical information carrying capacity of electromagnetic waves requires quantum-mechanical analysis to properly account for the bosonic nature of these waves. Recent work has established capacity theorems for bosonic single-user, broadcast, and wiretap channels, under the presumption of two minimum output entropy conjectures. Despite considerable accumulated evidence that supports the validity of these conjectures, they have yet to be proven. Here we show that the preceding minimum output entropy conjectures are simple consequences of an entropy photon-number inequality, which is a conjectured quantum-mechanical analog of the entropy power inequality from classical information theory.