On classical capacities of infinite-dimensional quantum channels

A coding theorem for entanglement-assisted communication via an infinite-dimensional quantum channel with linear constraints is extended to a natural degree of generality. Relations between the entanglement-assisted classical capacity and χ-capacity of constrained channels are obtained, and conditions for their coincidence are given. Sufficient conditions for continuity of the entanglement-assisted classical capacity as a function of a channel are obtained. Some applications of the obtained results to analysis of Gaussian channels are considered. A general (continuous) version of the fundamental relation between coherent information and the measure of privacy of classical information transmission via an infinite-dimensional quantum channel is proved.     

Arbitrated quantum signature of classical messages without using authenticated classical channels

This paper points out design confusion existing in all the arbitrated quantum signatures (AQS) that require public discussions over authenticated classical channels. Instead, an AQS scheme of classical messages without using authenticated classical channels is proposed here. A cryptographic hash function is used in combine with quantum mechanics to check the existence of an eavesdropping or to verify a signature. In addition, by using only single photons, this scheme provides higher efficiency both in quantum transmissions and generations. The proposed AQS scheme is shown to be immune to several well-known attacks, i.e., the Trojan-horse attacks and the existential forgery attack.     

Entanglement assisted classical capacity of a class of quantum channels with long-term memory

In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channels with long-term memory, which are convex combinations of memoryless channels. The memory of such channels can be considered to be given by a Markov chain which is aperiodic but not irreducible. This class of channels was introduced by Datta and Dorlas in (J. Phys. A, Math. Theor. 40:8147–8164, 2007), where its product state capacity was evaluated.      

Comparing classical and quantum PageRanks

Following recent developments in quantum PageRanking, we present a comparative analysis of discrete-time and continuous-time quantum-walk-based PageRank algorithms. Relative to classical PageRank and to different extents, the quantum measures better highlight secondary hubs and resolve ranking degeneracy among peripheral nodes for all networks we studied in this paper. For the discrete-time case, we investigated the periodic nature of the walker’s probability distribution for a wide range of networks and found that the dominant period does not grow with the size of these networks. Based on this observation, we introduce a new quantum measure using the maximum probabilities of the associated walker during the first couple of periods. This is particularly important, since it leads to a quantum PageRanking scheme that is scalable with respect to network size.     

Dynamics of quantum entanglement in quantum channels

Based on the von Neumann entropy, we give a computational formalism of the quantum entanglement dynamics in quantum channels, which can be applied to a general finite systems coupled with their environments in quantum channels. The quantum entanglement is invariant in the decoupled local unitary quantum channel, but it is variant in the non-local coupled unitary quantum channel. The numerical investigation for two examples, two-qubit and two-qutrit models, indicates that the quantum entanglement evolution in the quantum non-local coupling channel oscillates with the coupling strength and time, and depends on the quantum entanglement of the initial state. It implies that quantum information loses or gains when the state of systems evolves in the quantum non-local coupling channel.     

Linearization methods in classical and quantum mechanics

The applicability and accuracy of linearization methods for initial-value problems in ordinary differential equations are verified on examples that include the nonlinear Duffing equation, the Lane-Emden equation, and scattering length calculations. Linearization methods provide piecewise linear ordinary differential equations which can be easily integrated, and provide accurate answers even for hypersingular potentials, for which perturbation methods diverge. It is shown that the accuracy of linearization methods can be substantially improved by employing variable steps which adjust themselves to the solution.     

One-mode quantum Gaussian channels: Structure and quantum capacity

A complete classification of one-mode Gaussian channels is given up to canonical unitary equivalence. We also comment on the quantum capacity of these channels. A channel complementary to the quantum channel with additive classical Gaussian noise is described, providing an example of a one-mode Gaussian channel which is neither degradable nor antidegradable.     

Hadamard quantum broadcast channels

We consider three different communication tasks for quantum broadcast channels, and we determine the capacity region of a Hadamard broadcast channel for these various tasks. We define a Hadamard broadcast channel to be such that the channel from the sender to one of the receivers is entanglement-breaking and the channel from the sender to the other receiver is complementary to this one. As such, this channel is a quantum generalization of a degraded broadcast channel, which is well known in classical information theory. The first communication task we consider is classical communication to both receivers, the second is quantum communication to the stronger receiver and classical communication to other, and the third is entanglement-assisted classical communication to the stronger receiver and unassisted classical communication to the other. The structure of a Hadamard broadcast channel plays a critical role in our analysis: The channel to the weaker receiver can be simulated by performing a measurement channel on the stronger receiver’s system, followed by a preparation channel. As such, we can incorporate the classical output of the measurement channel as an auxiliary variable and solve all three of the above capacities for Hadamard broadcast channels, in this way avoiding known difficulties associated with quantum auxiliary variables.     

Quantum privacy and quantum wiretap channels

Following Schumacher and Westmoreland, we address the problem of the capacity of a quantum wiretap channel. We first argue that, in the definition of the so-called quantum privacy, Holevo quantities should be used instead of classical mutual informations. The argument actually shows that the security condition in the definition of a code should limit the wiretappers Holevo quantity. Then we show that this modified quantum privacy is the optimum achievable rate of secure transmission.Translated from Problemy Peredachi Informatsii, No. 4, 2004, pp. 26–47. Original Russian Text Copyright © 2004 by Cai, Winter, Yeung.     

Novel classical post-processing for quantum key distribution-based quantum private query

Existing classical post-processing (CPP) schemes for quantum key distribution (QKD)-based quantum private queries (QPQs) including the \(kN\rightarrow N\), \(N\rightarrow N\), and \(rM\rightarrow N\) ones have been found imperfect in terms of communication efficiency and security. In this paper, we propose a novel CPP scheme for QKD-based QPQs. The proposed CPP scheme reduces the communication complexity and improves the security of QKD-based QPQ protocols largely. Furthermore, the proposed CPP scheme can provide a multi-bit query efficiently.     

Virtual ring and quantum elements of a classical particle

The fractal equations of mechanics (quantum and classical) are clearly demonstrated to be definitions of an arbitrary potential on a fractal complex number valued surface. The developed approach helps us to show that a translational motion of any rotating compact object (point-like particle) can be equivalently represented by a specific rotation of a virtual ring described in terms of a fractal “wave function”, the model endowing the particle with a set of quantum characteristics including quantization of the ring’s space translation.     

Controlling the loss of quantum correlations via quantum memory channels

Quantum Information Processing - We consider the support of the limit distribution of the Grover walk on crystal lattices with the linear scaling. The orbit of the Grover walk is denoted by the...     

Minimal resources identifiability and estimation of quantum channels

We characterize and discuss the identifiability condition for quantum process tomography, as well as the minimal experimental resources that ensure a unique solution in the estimation of quantum channels, with both direct and convex optimization methods. A convenient parametrization of the constrained set is used to develop a globally converging Newton-type algorithm that ensures a physically admissible solution to the problem. Numerical simulation is provided to support the results and indicate that the minimal experimental setting is sufficient to guarantee good estimates.     

Predominance of entanglement of formation over quantum discord under quantum channels

We present a study of the behavior of two different figures of merit for quantum correlations, entanglement of formation and quantum discord, under quantum channels showing how the former can, counterintuitively, be more resilient to such environments spoiling effects. By exploiting strict conservation relations between the two measures and imposing necessary constraints on the initial conditions we are able to explicitly show this predominance is related to build-up of the system-environment correlations.     

Generation and protection of steady-state quantum correlations due to quantum channels with memory

We have proposed a scheme of the generation and preservation of two-qubit steady-state quantum correlations through quantum channels where successive uses of the channels are correlated. Different types of noisy channels with memory, such as amplitude damping, phase damping, and depolarizing channels, have been taken into account. Some analytical or numerical results are presented. The effect of channels with memory on dynamics of quantum correlations has been discussed in detail. The results show that steady-state entanglement between two initial qubits whose initial states are prepared in a specific family states without entanglement subject to amplitude damping channel with memory can be generated. The entanglement creation is related to the memory coefficient of channel \(\mu \). The stronger the memory coefficient of channel \( \mu \) is, the more the entanglement creation is, and the earlier the separable state becomes the entangled state. Besides, we compare the dynamics of entanglement with that of quantum discord when a two-qubit system is initially prepared in an entangled state. We show that entanglement dynamics suddenly disappears, while quantum discord dynamics displays only in the asymptotic limit. Furthermore, two-qubit quantum correlations can be preserved at a long time in the limit of \(\mu \rightarrow 1\).     

The Correlation Conversion property of quantum channels

Transmission of quantum entanglement will play a crucial role in future networks and long-distance quantum communications. Quantum key distribution, the working mechanism of quantum repeaters and the various quantum communication protocols are all based on quantum entanglement. On the other hand, quantum entanglement is extremely fragile and sensitive to the noise of the communication channel over which it has been transmitted. To share entanglement between distant points, high fidelity quantum channels are needed. In practice, these communication links are noisy, which makes it impossible or extremely difficult and expensive to distribute entanglement. In this work, we first show that quantum entanglement can be generated by a new idea, exploiting the most natural effect of the communication channels: the noise itself of the link. We prove that the noise transformation of quantum channels that are not able to transmit quantum entanglement can be used to generate distillable (useable) entanglement from classically correlated input. We call this new phenomenon the Correlation Conversion property of quantum channels. The proposed solution does not require any non-local operation or local measurement by the parties, only the use of standard quantum channels. Our results have implications and consequences for the future quantum communications and for global-scale quantum communication networks. The discovery also revealed that entanglement generation by local operations is possible.     

Oblivious transfer and quantum channels as communication resources

We show that from a communication-complexity perspective, the primitive called oblivious transfer—which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as non-local boxes are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one qubit and measuring it in an orthogonal basis. On the other hand, a qubit channel allows for realizing non-cryptographic oblivious transfer with probability roughly 85 %, whereas 75 % is the classical limit.     

Mutual and coherent information for infinite-dimensional quantum channels

The paper is devoted to the study of quantum mutual information and coherent information, two important characteristics of a quantum communication channel. Appropriate definitions of these quantities in the infinite-dimensional case are given, and their properties are studied in detail. Basic identities relating the quantum mutual information and coherent information of a pair of complementary channels are proved. An unexpected continuity property of the quantum mutual information and coherent information, following from the above identities, is observed. An upper bound for the coherent information is obtained.     

An efficient quantum digital signature for classical messages

Quantum digital signature offers an information theoretically secure way to guarantee the identity of the sender and the integrity of classical messages between one sender and many recipients. The existing unconditionally secure protocols only deal with the problem of sending single-bit messages. In this paper, we modify the model of quantum digital signature protocol and construct an unconditionally secure quantum digital signature protocol which can sign multi-bit messages at one time. Our protocol is against existing quantum attacks. Compared with the previous protocols, our protocol requires less quantum memory and becomes much more efficient. Our construction makes it possible to have a quantum signature in actual application.