Open questions from Sarovar and Milburn (2006 J.Phys. A: Math. Gen. 39 8487) are answered. Sarovar and Milburn derived a convenient upper bound for the Fisher information of a one-parameter quantum channel. They showed that for quasi-classical models their bound is achievable and they gave a necessary and sufficient condition for positive operator-valued measures (POVMs) attaining this bound. They asked (i) whether their bound is attainable more generally, (ii) whether explicit expressions for optimal POVMs can be derived from the attainability condition. We show that the symmetric logarithmic derivative (SLD) quantum information is less than or equal to the SM bound, i.e.\ $H(θ) \leq C_Υ(θ)$ and we find conditions for equality. As the Fisher information is less than or equal to the SLD quantum information, i.e. $F_M(θ) \leq H(θ)$, we can deduce when equality holds in $F_M(θ) \leq C_Υ(θ)$. Equality does not hold for all channels. As a consequence, the attainability condition cannot be used to test for optimal POVMs for all channels. These results are extended to multi-parameter channels.
A recovery map effectively cancels the action of a quantum operation to a partial or full extent. We study the Petz recovery map in the case where the quantum channel and input states are fermionic and Gaussian. Gaussian states are convenient because they are totally determined by their covariance matrix and because they form a closed set under so-called Gaussian channels. Using a Grassmann representation of fermionic Gaussian maps, we show that the Petz recovery map is also Gaussian and determine it explicitly in terms of the covariance matrix of the reference state and the data of the channe…
Twin-Field quantum key distribution (TF-QKD) can beat the linear bound of repeaterless QKD systems. After the proposal of the original protocol, multiple papers have extended the protocol to prove its security. However, these works are limited to the case where the two channels have equal amount of loss (i.e. are symmetric). In a practical network setting, it is very likely that the channels are asymmetric due to e.g. geographical locations. In this paper we extend the "simple TF-QKD" protocol to the scenario with asymmetric channels. We show that by simply adjusting the two signal states of t…
We propose a general and systematic strategy to compile arbitrary quantum channels without using ancillary qubits, based on proximal policy optimization -- a powerful deep reinforcement learning algorithm. We rigorously prove that, in sharp contrast to the case of compiling unitary gates, it is impossible to compile an arbitrary channel to arbitrary precision with any given finite elementary channel set, regardless of the length of the decomposition sequence. However, for a fixed accuracy $ε$ one can construct a universal set with constant number of $ε$-dependent elementary channels, such that…
Multiparty quantum communication is an important branch of quantum networks. It enables private information transmission with information-theoretic security among legitimate parties. We propose a sender-controlled measurement-device-independent multiparty quantum communication protocol. The sender Alice divides a private message into several parts and delivers them to different receivers for secret sharing with imperfect measurement devices and untrusted ancillary nodes. Furthermore, Alice acts as an active controller and checks the security of quantum channels and the reliability of each rece…
Recently, there have been considerable progresses on the bounds of various quantum channel capacities for bosonic Gaussian channels. Especially, several upper bounds for the classical capacity and the quantum capacity on the bosonic Gaussian channels, via a technique known as quantum entropy power inequality, have been shed light on understanding the mysterious quantum-channel-capacity problems. However, upper bounds for the private capacity on quantum channels are still missing for the study on certain universal upper bounds. Here, we derive upper bounds on the private capacity for bosonic Ga…
Classical capacity of unital qubit channels is well known, whereas that of nonunital qubit channels is not. We find lower and upper bounds on classical capacity of nonunital qubit channels by using a recently developed decomposition technique relating nonunital and unital positive qubit maps.
We establish several upper bounds on the energy-constrained quantum and private capacities of all single-mode phase-insensitive bosonic Gaussian channels. The first upper bound, which we call the "data-processing bound," is the simplest and is obtained by decomposing a phase-insensitive channel as a pure-loss channel followed by a quantum-limited amplifier channel. We prove that the data-processing bound can be at most 1.45 bits larger than a known lower bound on these capacities of the phase-insensitive Gaussian channel. We discuss another data-processing upper bound as well. Two other upper …
