We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the one-shot quantum capacity. In this paper, we prove bounds on the one-shot quantum capacity of an arbitrary channel. This allows us to compute the quantum capacity of a channel with arbitrarily correlated noise, in the limit of asymptotically many uses of the channel. In the memoryless case, we explicitly show that our results reduce to known expressions for the quantum capacity.
Capacity of dense coding via correlated noisy channel is greater than that in uncorrelated noisy channel. It is shown that weak measurement and reversal measurement can make further effort to improve quantum dense coding capacity in correlated amplitude damping channel, but this effort is very small in correlated phase damping channel and correlated depolarizing channel.
We establish Ahlswede dichotomy for arbitrarily varying classical-quantum wiretap channels. This means that either the deterministic secrecy capacity of an arbitrarily varying classical-quantum wiretap channel is zero or it equals its randomness-assisted secrecy capacity. We analyze the secrecy capacity of arbitrarily varying classical-quantum wiretap channels when the sender and the receiver use various resources. It turns out that having randomness, common randomness, and correlation as resources are very helpful for achieving a positive deterministic secrecy capacity of arbitrarily varying …
The classical capacity of a quantum channel with arbitrary Markovian correlated noise is evaluated. For the general case of a channel with long-term memory, which corresponds to a Markov chain which does not converge to equilibrium, the capacity is expressed in terms of the communicating classes of the Markov chain. For an irreducible and aperiodic Markov chain, the channel is forgetful, and one retrieves the known expression for the capacity.
We provide $poly\log$ sparse quantum codes for correcting the erasure channel arbitrarily close to the capacity. Specifically, we provide $[[n, k, d]]$ quantum stabilizer codes that correct for the erasure channel arbitrarily close to the capacity if the erasure probability is at least $0.33$, and with a generating set $\langle S_1, S_2, ... S_{n-k} \rangle$ such that $|S_i|\leq \log^{2+ζ}(n)$ for all $i$ and for any $ζ> 0$ with high probability. In this work we show that the result of Delfosse et al. is tight: one can construct capacity approaching codes with weight almost $O(1)$.
We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer systems, we show, using permutation symmetry and a de Finetti reduction, how the random coding capacity (classical and quantum) of the QAVC is reduced to the capacity of a naturally associated compound channel, which is obtained by restricting the jammer to i.i.d. input states. Furthermore, we demonstrate that the shared randomness required is at most logarithm…
We calculate the entanglement-assisted classical capacity of symmetric and asymmetric Pauli channels where two consecutive uses of the channels are correlated. It is evident from our study that in the presence of memory, a higher amount of classical information is transmitted over quantum channels if there exists prior entanglement as compared to product and entangled state coding.
We derive a lower bound on the capacity of classical-quantum arbitrarily varying wiretap channel and determine the capacity of the classicalquantum arbitrarily varying wiretap channel with channel state information at the transmitter.
One of the main figures of merit for quantum memories and quantum communication devices is their quantum capacity. It has been studied for arbitrary kinds of quantum channels, but its practical estimation has so far been limited to devices that implement independent and identically distributed (i.i.d.) quantum channels, where each qubit is affected by the same noise process. Real devices, however, typically exhibit correlated errors. Here, we overcome this limitation by presenting protocols that estimate a channel's one-shot quantum capacity for the case where the device acts on (an arbitrary …
We study the capacity of d-dimensional quantum channels with memory modeled by correlated noise. We show that, in agreement with previous results on Pauli qubit channels, there are situations where maximally entangled input states achieve higher values of mutual information than product states. Moreover, a strong dependence of this effect on the nature of the noise correlations as well as on the parity of the space dimension is found. We conjecture that when entanglement gives an advantage in terms of mutual information, maximally entangled states saturate the channel capacity.
We study the capacity of a quantum channel where channel acts like controlled phase gate with the control being provided by a one-dimensional quantum spin chain environment. Due to the correlations in the spin chain, we get a quantum channel with memory. We derive formulas for the quantum capacity of this channel when the spin state is a matrix product state. Particularly, we derive exact formulas for the capacity of the quantum memory channel when the environment state is the ground state of the AKLT model and the Majumdar-Ghosh model. We find that the behavior of the capacity for the range o…
We study the classical capacity of a forgetful quantum memory channel that switches between two qubit depolarizing channels according to an ergodic Markov chain. The capacity of this quantum memory channel depends on the parameters of the two depolarizing channels and the memory of the ergodic Markov chain. When the number of input qubit's is two, we show that depending on channel parameters either the maximally entangled input states or product input states achieve the classical capacity. Our conjecture based on numerics is that as the number of input qubits are increased the classical capaci…
We present an experimental method to detect lower bounds to the quantum capacity of two-qubit communication channels. We consider an implementation with polarisation degrees of freedom of two photons and report on the efficiency of such a method in the presence of correlated noise for varying values of the correlation strength. The procedure is based on the generation of separable states of two qubits and local measurements at the output. We also compare the performance of the correlated two-qubit channel with the single-qubit channels corresponding to the partial trace on each of the subsyste…
We derive a regularized formula for the common randomness assisted entanglement transmission capacity of finite arbitrarily varying quantum channels (AVQC's). For finite AVQC's with positive capacity for classical message transmission we show, by derandomization through classical forward communication, that the random capacity for entanglement transmission equals the deterministic capacity for entanglement transmission. This is a quantum version of the famous Ahlswede dichotomy. In the infinite case, we derive a similar result for certain classes of AVQC's. At last, we give two possible defini…
We study information transmission over a fully correlated amplitude damping channel acting on two qubits. We derive the single-shot classical channel capacity and show that entanglement is needed to achieve the channel best performance. We discuss the degradability properties of the channel and evaluate the quantum capacity for any value of the noise parameter. We finally compute the entanglement-assisted classical channel capacity.
We construct a class of quantum channels in arbitrary dimensions for which entanglement improves the performance of the channel. The channels have correlated noise and when the level of correlation passes a critical value we see a sharp transition in the optimal input states (states which minimize the output entropy) from separable to maximally entangled states. We show that for a subclass of channels with some extra conditions, including the examples which we consider, the states which minimize the output entropy are the ones which maximize the mutual information.
We present an algorithm for calculation of the Gaussian classical capacity of a quantum bosonic memory channel with additive Gaussian noise. The algorithm, restricted to Gaussian input states, is applicable to all channels with noise correlations obeying certain conditions and works in the full input energy domain, beyond previous treatments of this problem. As an illustration, we study the optimal input states and capacity of a quantum memory channel with Gauss-Markov noise [J. Schäfer, Phys. Rev. A 80, 062313 (2009)]. We evaluate the enhancement of the transmission rate when using these opti…
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 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 …
We develop a model for a noisy communication channel in which the noise affecting consecutive transmissions is correlated. This model is motivated by fluctuating birefringence of fiber optic links. We analyze the role of entanglement of the input states in optimizing the classical capacity of such a channel. Assuming a general form of an ensemble for two consecutive transmissions, we derive tight bounds on the classical channel capacity depending on whether the input states used for communication are separable or entangled across different temporal slots. This result demonstrates that by an ap…
Quantum communication theory sets the maximum rates at which information can be encoded and decoded reliably given the physical properties of the information carriers. Here we consider the problem of readout of a digital optical memory, where information is stored by means of the optical properties of the memory cells that are in turn probed by shining a laser beam on them. Interesting features arise in the regime in which the probing light has to be treated quantum mechanically. The maximum rate of reliable readout defines the quantum reading capacity, which is proven to overcome the classica…
We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels.Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender to the legal receiver and varies arbitrarily from the sender to the eavesdropper. As an application we examine when the secrecy capacity is a continuous function of the system parameters and show that resources, i.e., having access to a perfect copy of the outcome of a random experiment. are helpful for channel stability.
We characterize the optimal correlative capacity of entangled, separable, and classically correlated states. Introducing the notions of the infimum and supremum within majorization theory, we construct the least disordered separable state compatible with a set of marginals. The maximum separable correlation information supportable by the marginals of a multi-qubit pure state is shown to be an LOCC monotone. The least disordered composite of a pair of qubits is found for the above classes, with classically correlated states defined as diagonal in the product of marginal bases.
Using no conventional measurements in position space, information extraction rates exceeding one bit per photon are achieved by employing high-dimensional correlated orbital angular momentum (OAM) states for object recognition. The correlations are shown to be insensitive to axial rotation of the target object: the information structure of an object's joint OAM coincidence spectrum is unchanged even when the object undergoes random rotations between each measurement. Additionally, OAM correlations alone are shown to be sufficient for full image reconstruction of complex, off-axis objects, and …
The highest fidelity of quantum error-correcting codes of length n and rate R is proven to be lower bounded by 1 - exp [-n E(R)+ o(n)] for some function E(R) on noisy quantum channels that are subject to not necessarily independent errors. The E(R) is positive below some threshold R', which implies R' is a lower bound on the quantum capacity. This work is an extension of the author's previous works [M. Hamada, Phys. Rev. A, 65, 052305, 2002 (e-Print quant-ph/0109114, LANL, 2001), and M. Hamada, submitted to IEEE Trans. Inf. Theory, 2002 (e-Print quant-ph/0112103, LANL, 2001)], which presented …
We consider compound as well as arbitrarily varying classical-quantum channel models. For classical-quantum compound channels, we give an elementary proof of the direct part of the coding theorem. A weak converse under average error criterion to this statement is also established. We use this result together with the robustification and elimination technique developed by Ahlswede in order to give an alternative proof of the direct part of the coding theorem for a finite classical-quantum arbitrarily varying channels with the criterion of success being average error probability. Moreover we pro…
Quantum nonlocality can be observed in networks even in the case where every party can only perform a single measurement, i.e. does not receive any input. So far, this effect has been demonstrated under the assumption that all sources in the network are fully independent from each other. Here we investigate to what extent this independence assumption can be relaxed. After formalizing the question, we show that, in the triangle network without inputs, quantum nonlocality can be observed, even when assuming only an arbitrarily small level of independence between the sources. This means that quan…
Prior entanglement between sender and receiver, which exactly doubles the classical capacity of a noiseless quantum channel, can increase the classical capacity of some noisy quantum channels by an arbitrarily large constant factor depending on the channel, relative to the best known classical capacity achievable without entanglement. The enhancement factor is greatest for very noisy channels, with positive classical capacity but zero quantum capacity. Although such quantum channels can be simulated classically, no violation of causality is implied, because the simulation requires at least as …
We propose here a two-round relativistic bit commitment scheme where committer commits in the first round and then confirms his/her commitment in the second round. The scheme offers indefinite commitment time where both committer and receiver extract non-locally correlated measurement outcomes during the scheme that can be stored and revealed after arbitrarily long time. We show that the proposed scheme turns out to be a multiparty bit commitment scheme where both parties commit and reveal simultaneously. The multiparty generalization would have applications in business and secure multiparty c…
We calculate the information capacities of a time-correlated amplitude-damping channel, provided the sender and receiver share prior entanglement. Our analytical results show that the noisy channel with zero capacity can transmit information if it has finite memory. The capacities increase as the memory increases attaining maximum value for perfect memory channel.
A general attenuator $Φ_{λ, σ}$ is a bosonic quantum channel that acts by combining the input with a fixed environment state $σ$ in a beam splitter of transmissivity $λ$. If $σ$ is a thermal state the resulting channel is a thermal attenuator, whose quantum capacity vanishes for $λ\leq 1/2$. We study the quantum capacity of these objects for generic $σ$, proving a number of unexpected results. Most notably, we show that for any arbitrary value of $λ>0$ there exists a suitable single-mode state $σ(λ)$ such that the quantum capacity of $Φ_{λ,σ(λ)}$ is larger than a universal constant $c>0$. Our …
We present an experiment demonstrating entanglement-enhanced classical communication capacity of a quantum channel with correlated noise. The channel is modelled by a fiber optic link exhibiting random birefringence that fluctuates on a time scale much longer than the temporal separation between consecutive uses of the channel. In this setting, introducing entanglement between two photons travelling down the fiber allows one to encode reliably up to one bit of information into their joint polarization degree of freedom. When no quantum correlations between two separate uses of the channel are …
We test a general method to detect lower bounds of the quantum channel capacity for two-qubit correlated channels. We consider in particular correlated dephasing, depolarising and amplitude damping channels. We show that the method is easily implementable, it does not require a priori knowledge about the channels, and it is very efficient, since it does not rely on full quantum process tomography.
In this article we show that the Holevo capacity of a classical quantum channel, can be reached not only by a POVM but by von Neumann measurement too. Furthermore we show two use of this fact 1) We can generalize the classical compound channel to quantum environment and with this new measure technique we can give an optimal coding/decoding algorithm to it. 2) We give an algorithm, with it a classical system can be decoded by quantum apparatus in linear time, which is a surprising result, because best known optimal classical decoding algorithm need n*log(n) time. This means that if a quantum ma…
Nonclassical correlations between the quadrature-phase amplitudes of two spatially separated optical beams are exploited to realize a two-channel quantum communication experiment with a high degree of immunity to interception. For this scheme, either channel alone can have an arbitrarily small signal-to-noise ratio (SNR) for transmission of a coherent ``message''. However, when the transmitted beams are combined properly upon authorized detection, the encoded message can in principle be recovered with the original SNR of the source. An experimental demonstration has achieved a 3.2 dB improveme…
This work is motivated by a quite general question: Under which circumstances are the capacities of information transmission systems continuous? The research is explicitly carried out on arbitrarily varying quantum channels (AVQCs). We give an explicit example that answers the recent question whether the transmission of messages over AVQCs can benefit from distribution of randomness between the legitimate sender and receiver in the affirmative. The specific class of channels introduced in that example is then extended to show that the deterministic capacity does have discontinuity points, whil…
Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects are involved, we do not know how to compute channel capacities. The capacity to transmit quantum information is essential to quantum cryptography and computing, but the formula involves maximising the coherent information over arbitrarily many channel uses. This is because entanglement across channel uses can increase the coherent information, even from zero t…
We investigate the basic constraint on amplifying the asymmetry in quantum states with correlated catalysts. Here a correlated catalyst is a finite-dimensional auxiliary, which exactly preserves its reduced state while allowed to become correlated to the quantum system. Interestingly, we prove that under translationally invariant operations, catalysts in pure states are useless in any state transformation, while with a correlated catalyst in a mixed state, one can enlarge the set of accessible states from an initially asymmetric state. Moreover, we show that the power of a catalyst increases w…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In this way, we obtain single-letter characterizations of the entanglement-assisted classical capacities for both channel models. Moreover, we show that the entanglement-assisted classical capacity does exhibit no strong converse property for some compound quantum channels for the average as well as the maximal error criterion. A strong converse to the entangle…
We prove a new version of the quantum accuracy threshold theorem that applies to non-Markovian noise with algebraically decaying spatial correlations. We consider noise in a quantum computer arising from a perturbation that acts collectively on pairs of qubits and on the environment, and we show that an arbitrarily long quantum computation can be executed with high reliability in D spatial dimensions, if the perturbation is sufficiently weak and decays with the distance r between the qubits faster than 1/r^D.
The information-carrying capacity of a memory is known to be a thermodynamic resource facilitating the conversion of heat to work. Szilard's engine explicates this connection through a toy example involving an energy-degenerate two-state memory. We devise a formalism to quantify the thermodynamic value of memory in general quantum systems with nontrivial energy landscapes. Calling this the thermal information capacity, we show that it converges to the non-equilibrium Helmholtz free energy in the thermodynamic limit. We compute the capacity exactly for a general two-state (qubit) memory away fr…
As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share (asymptotically perfect) common randomness. Rather, it is sufficient that they each have access to an unlimited amount of uses of one part of a correlated bipartite source. This access might be restricted to an arbitrary small (nonzero) fraction per channel use, without changing the main result. We investigate the notion of common randomness. It turns out that this is a …
In this paper we propose a new model for arbitrarily varying classical-quantum channels. In this model a jammer has side information. We consider two scenarios. In the first scenario the jammer knows the channel input, while in the second scenario the jammer knows both the channel input and the message. The transmitter and receiver share a secret random key with a vanishing key rate. We determine the capacity for both average and maximum error criteria for both scenarios. We also establish the strong converse. We show that all these corresponding capacities are equal, which means that addition…
We determine the secrecy capacities of AVQCs (arbitrarily varying quantum channels). Both secrecy capacity with average error probability and with maximal error probability are derived. Both derivations are based on one common code construction. The code we construct fulfills a stringent secrecy requirement, which is called the strong code concept. We determine when the secrecy capacity is a continuous function of the system parameters and completely characterize its discontinuity points both for average error criterion and for maximal error criterion. Furthermore, we prove the phenomenon "sup…
The zero-error classical capacity of a quantum channel is the asymptotic rate at which it can be used to send classical bits perfectly, so that they can be decoded with zero probability of error. We show that there exist pairs of quantum channels, neither of which individually have any zero-error capacity whatsoever (even if arbitrarily many uses of the channels are available), but such that access to even a single copy of both channels allows classical information to be sent perfectly reliably. In other words, we prove that the zero-error classical capacity can be superactivated. This result …
We derive universal codes for simultaneous transmission of classical messages and entanglement through quantum channels, possibly under attack of a malignant third party. These codes are robust to different kinds of channel uncertainty. To construct such universal codes, we invoke and generalize properties of random codes for classical and quantum message transmission through quantum channels. We show these codes to be optimal by giving a multi-letter characterization of regions corresponding to the capacity of compound quantum channels for simultaneously transmitting and generating entangleme…
We consider one-way quantum state merging and entanglement distillation under compound and arbitrarily varying source models. Regarding quantum compound sources, where the source is memoryless, but the source state an unknown member of a certain set of density matrices, we continue investigations begun in the work of Bjelaković et. al. [Universal quantum state merging, J. Math. Phys. 54, 032204 (2013)] and determine the classical as well as entanglement cost of state merging. We further investigate quantum state merging and entanglement distillation protocols for arbitrarily varying quantum so…
No information transmission through quantum channels above capacity
National Taiwan University（国立台湾大学）；National Center for Theoretical Sciences, Taiwan（台湾理论科学中心）；Hon Hai (Foxconn) Quantum Computing Center, Taiwan（台湾鸿海（富士康）量子计算中心）；National University of Singapore（新加坡国立大学）；Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）
