Entanglement can completely defeat quantum noise

We describe two quantum channels that individually cannot send any classical information without some chance of decoding error. But together a single use of each channel can send quantum information perfectly reliably. This proves that the zero-error classical capacity exhibits superactivation, the extreme form of the superadditivity phenomenon in which entangled inputs allow communication over zero-capacity channels. But our result is stronger still, as it even allows zero-error quantum communication when the two channels are combined. Thus our result shows a new remarkable way in which entanglement across two systems can be used to resist noise, in this case perfectly. We also show a new form of superactivation by entanglement shared between sender and receiver.     

The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory

The Quantum Reverse Shannon Theorem states that any quantum channel can be simulated by an unlimited amount of shared entanglement and an amount of classical communication equal to the channel’s entanglement assisted classical capacity. In this paper, we provide a new proof of this theorem, which has previously been proved by Bennett, Devetak, Harrow, Shor, and Winter. Our proof has a clear structure being based on two recent information-theoretic results: one-shot Quantum State Merging and the Post-Selection Technique for quantum channels.     

Continuity of Quantum Channel Capacities

We prove that a broad array of capacities of a quantum channel are continuous. That is, two channels that are close with respect to the diamond norm have correspondingly similar communication capabilities. We first show that the classical capacity, quantum capacity, and private classical capacity are continuous, with the variation on arguments e{\varepsilon} apart bounded by a simple function of e{\varepsilon} and the channel’s output dimension. Our main tool is an upper bound of the variation of output entropies of many copies of two nearby channels given the same initial state; the bound is linear in the number of copies. Our second proof is concerned with the quantum capacities in the presence of free backward or two-way public classical communication. These capacities are proved continuous on the interior of the set of non-zero capacity channels by considering mutual simulation between similar channels.     

Extremality of Gaussian quantum states

We investigate Gaussian quantum states in view of their exceptional role within the space of all continuous variables states. A general method for deriving extremality results is provided and applied to entanglement measures, secret key distillation and the classical capacity of bosonic quantum channels. We prove that for every given covariance matrix the distillable secret key rate and the entanglement, if measured appropriately, are minimized by Gaussian states. This result leads to a clearer picture of the validity of frequently made Gaussian approximations. Moreover, it implies that Gaussian encodings are optimal for the transmission of classical information through bosonic channels, if the capacity is additive.     

Bipartite subspaces having no bases distinguishable by local operations and classical communication

It is proved that there exist subspaces of bipartite tensor product spaces that have no orthonormal bases that can be perfectly distinguished by means of local operations and classical communication. A corollary of this fact is that there exist quantum channels having suboptimal classical capacity even when the receiver may communicate classically with a third party that represents the channel's environment.     

Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels

We investigate entanglement transmission over an unknown channel in the presence of a third party (called the adversary), which is enabled to choose the channel from a given set of memoryless but non-stationary channels without informing the legitimate sender and receiver about the particular choice that he made. This channel model is called an arbitrarily varying quantum channel (AVQC). We derive a quantum version of Ahlswede’s dichotomy for classical arbitrarily varying channels. This includes a regularized formula for the common randomness-assisted capacity for entanglement transmission of an AVQC. Quite surprisingly and in contrast to the classical analog of the problem involving the maximal and average error probability, we find that the capacity for entanglement transmission of an AVQC always equals its strong subspace transmission capacity. These results are accompanied by different notions of symmetrizability (zero-capacity conditions) as well as by conditions for an AVQC to have a capacity described by a single-letter formula. In the final part of the paper the capacity of the erasure-AVQC is computed and some light shed on the connection between AVQCs and zero-error capacities. Additionally, we show by entirely elementary and operational arguments motivated by the theory of AVQCs that the quantum, classical, and entanglement-assisted zero-error capacities of quantum channels are generically zero and are discontinuous at every positivity point.     

Quantum walk under coherence non-generating channels

We investigate the probability distribution of the quantum walk under coherence non-generating channels. We definea model called generalized classical walk with memory. Under certain conditions, generalized classical random walk withmemory can degrade into classical random walk and classical random walk with memory. Based on its various spreadingspeed, the model may be a useful tool for building algorithms. Furthermore, the model may be useful for measuring thequantumness of quantum walk. The probability distributions of quantum walks are generalized classical random walkswith memory under a class of coherence non-generating channels. Therefore, we can simulate classical random walkand classical random walk with memory by coherence non-generating channels. Also, we find that for another class ofcoherence non-generating channels, the probability distributions are influenced by the coherence in the initial state of thecoin. Nevertheless, the influence degrades as the number of steps increases. Our results could be helpful to explore therelationship between coherence and quantum walk.     

Classical signal model for quantum channels

Recently it was shown that the main distinguishing features of quantum mechanics (QM) can be reproduced by a model based on classical random fields, the so-called prequantum classical statistical field theory (PCSFT). This model provides a possibility to represent averages of quantum observables, including correlations of observables on subsystems of a composite system (e.g., entangled systems), as averages with respect to fluctuations of classical (Gaussian) random fields. We consider some consequences of the PCSFT for quantum information theory. They are based on our previous observation that classical Gaussian channels (important in classical signal theory) can be represented as quantum channels. Now we show that quantum channels can be represented as classical linear transforms of classical Gaussian signals.     

Quantum benchmark for storage and transmission of coherent states

We consider the storage and transmission of a Gaussian distributed set of coherent states of continuous variable systems. We prove a limit on the average fidelity achievable when the states are transmitted or stored by a classical channel, i.e., a measure and repreparation scheme which sends or stores classical information only. The obtained bound is tight and serves as a benchmark which has to be surpassed by quantum channels in order to outperform any classical strategy. The success in experimental demonstrations of quantum memories as well as quantum teleportation has to be judged on this footing.     

Public classical communication in quantum cryptography: Error correction,integrity, and authentication

Quantum cryptography systems combine two communication channels: a quantum and a classical one. (They can be physically implemented in the same fiber-optic link, which is employed as a quantum channel when one-photon states are transmitted and as a classical one when it carries classical data traffic.) Both channels are supposed to be insecure and accessible to an eavesdropper. Error correction in raw keys, interferometer balancing, and other procedures are performed by using the public classical channel. A discussion of the requirements to be met by the classical channel is presented.     

LMG model: Markovian evolution of classical and quantum correlations under decoherence

We have investigated the quantum phase transition in the ground state of collective Lipkin-Meshkov-Glick model (LMG model) subjected to decoherence due to its interaction, represented by a quantum channel, with an environment. We discuss the behavior of quantum and classical pair wise correlations in the system, with the quantumness of correlations measured by quantum discord (QD), entanglement of formation (EOF), measurement-induced disturbance (MID) and the Clauser-Horne-Shimony-Holt-Bell function (CHSH-Bell function). The time evolution established by system-environment interactions is assumed to be Markovian in nature and the quantum channels studied include the amplitude damping (AD), phase damping (PD), bit-flip (BF), phase-flip (PF), and bit-phase-flip (BPF) channels. One can identify appropriate quantities associated with the dynamics of quantum correlations signifying quantum phase transition in the model. Surprisingly, the CHSH-Bell function is found to detect all the phase transitions, even when quantum and classical correlations are zero for the relevant ground state.     

Memory effects in quantum channel discrimination

We consider quantum-memory assisted protocols for discriminating quantum channels. We show that for optimal discrimination of memory channels, memory assisted protocols are needed. This leads to a new notion of distance for channels with memory, based on the general theory of quantum testers. For discrimination and estimation of sets of independent unitary channels, we prove optimality of parallel protocols among all possible architectures.     

Upper bounds on the private capacity for bosonic Gaussian channels

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 Gaussian channels involving a general Gaussian-noise case through the conditional quantum entropy power inequality.     

A Quantum Analogue of the First Fundamental Theorem of Classical Invariant Theory

We establish a noncommutative analogue of the first fundamental theorem of classical invariant theory. For each quantum group associated with a classical Lie algebra, we construct a noncommutative associative algebra whose underlying vector space forms a module for the quantum group and whose algebraic structure is preserved by the quantum group action. The subspace of invariants is shown to form a subalgebra, which is finitely generated. We determine generators of this subalgebra of invariants and determine their commutation relations. In each case considered, the noncommutative modules we construct are flat deformations of their classical commutative analogues. Our results are therefore noncommutative generalisations of the first fundamental theorem of classical invariant theory, which follows from our results by taking the limit as q → 1. Our method similarly leads to a definition of quantum spheres, which is a noncommutative generalisation of the classical case with orthogonal quantum group symmetry.     

Strong Converse for the Classical Capacity of Entanglement-Breaking and Hadamard Channels via a Sandwiched Rényi Relative Entropy

A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of communication exceeds the classical capacity of the channel. Along with a corresponding achievability statement for rates below the capacity, such a strong converse theorem enhances our understanding of the capacity as a very sharp dividing line between achievable and unachievable rates of communication. Here, we show that such a strong converse theorem holds for the classical capacity of all entanglement-breaking channels and all Hadamard channels (the complementary channels of the former). These results follow by bounding the success probability in terms of a “sandwiched” Rényi relative entropy, by showing that this quantity is subadditive for all entanglement-breaking and Hadamard channels, and by relating this quantity to the Holevo capacity. Prior results regarding strong converse theorems for particular covariant channels emerge as a special case of our results.     

Entanglement-Assisted Joint Monostatic-Bistatic Radars

With the help of entanglement, we can build quantum sensors with sensitivity better than that of classical sensors. In this paper we propose an entanglement assisted (EA) joint monostatic-bistatic quantum radar scheme, which significantly outperforms corresponding conventional radars. The proposed joint monostatic-bistatic quantum radar is composed of two radars, one having both wideband entangled source and EA detector, and the second one with only an EA detector. The optical phase conjugation (OPC) is applied on the transmitter side, while classical coherent detection schemes are applied in both receivers. The joint monostatic-bistatic integrated EA transmitter is proposed suitable for implementation in LiNbO₃ technology. The detection probability of the proposed EA joint target detection scheme outperforms significantly corresponding classical, coherent states-based quantum detection, and EA monostatic detection schemes. The proposed EA joint target detection scheme is evaluated by modelling the direct radar return and forward scattering channels as both lossy and noisy Bosonic channels, and assuming that the distribution of entanglement over idler channels is not perfect.     

Remote state preparation

Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted. We show that the asymptotic classical communication cost of RSP is one bit per qubit--half that of teleportation--and even less when transmitting part of a known entangled state. We explore the tradeoff between entanglement and classical communication required for RSP, and discuss RSP capacities of general quantum channels.     

Quantum capacities of bosonic channels

We investigate the capacity of bosonic quantum channels for the transmission of quantum information. We calculate the quantum capacity for a class of Gaussian channels, including channels describing optical fibers with photon losses, by proving that Gaussian encodings are optimal. For arbitrary channels we show that achievable rates can be determined from few measurable parameters by proving that every channel can asymptotically simulate a Gaussian channel which is characterized by second moments of the initial channel. Along the way we provide a complete characterization of degradable Gaussian channels and those arising from teleportation protocols.     

Quantum walks with coins undergoing different quantum noisy channels

Quantum walks have significantly different properties compared to classical random walks, which have potential applications in quantum computation and quantum simulation. We study Hadamard quantum walks with coins undergoing different quantum noisy channels and deduce the analytical expressions of the first two moments of position in the longtime limit. Numerical simulations have been done, the results are compared with the analytical results, and they match extremely well. We show that the variance of the position distributions of the walks grows linearly with time when enough steps are taken and the linear coefficient is affected by the strength of the quantum noisy channels.     

Interplay between classical and quantum signals: partial trace and measurement channels

We continue the study of similarities between quantum information theory and theory of classical Gaussian signals. The possibility of using quantum entropy for classical Gaussian signals was explored a long time ago. Recently we demonstrated that some basic quantum channels can be represented as linear transforms of classical Gaussian signals. Here we consider bipartite quantum systems and show that an important quantum channel given by the partial trace operation has a simple classical representation, namely, a coordinate projection of a classical “prequantum signal.” We also consider the classical signal realization of quantum channels corresponding to state transforms in the process of measurement. The latter induces a difficult interpretational problem — the output signal corresponding to one system depends on a measurement that has been done on the second system. This situation might be interpreted as a sign of quantum nonlocality, action at a distance. Although we do not exclude such a possibility, i.e., that, in complete accordance with Bell, the creation of a realistic prequantum model is impossible without action at a distance, we found another interpretation of this situation that is not related to quantum nonlocality.