相关论文: Strong Converse for Identification via Quantum Cha…
A method is proposed to characterize a high-dimensional quantum channel with the aid of classical light. It uses a single nonseparable input optical field that contains correlations between spatial modes and wavelength to determine the…
Motivated by the question of the distinguishability of ensembles described by the same compressed density operator, we propose a model for one-way quantum secure direct communication using finite ensembles of shared EPR pairs per bit and a…
The coding theorem for the entanglement-assisted communication via infinite-dimensional quantum channel with linear constraint is extended to a natural degree of generality. Relations between the entanglement-assisted classical capacity and…
Partially smoothed information measures are fundamental tools in one-shot quantum information theory. In this work, we determine the exact strong converse exponents of these measures for both pure quantum states and classical states.…
Recent studies have shown that quantum information may be effectively transmitted by a finite collection of completely depolarizing channels in a coherent superposition of different orders, via an operation known as the quantum $\tt…
We study non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of classical information that can be transmitted when a quantum channel is used a finite…
We study the problem of decoding classical information encoded on quantum states at the output of a quantum channel, with particular focus on increasing the communication rates towards the maximum allowed by Quantum Mechanics. After a brief…
This paper presents a new derivation method of converse bounds on the non-asymptotic achievable rate of discrete weakly symmetric memoryless channels. It is based on the finite blocklength statistics of the channel, where with the use of an…
We find a strong-converse bound on the private capacity of a quantum channel assisted by unlimited two-way classical communication. The bound is based on the max-relative entropy of entanglement and its proof uses a new inequality for the…
Quantum computers may achieve speedups over their classical counterparts for solving linear algebra problems. However, in some cases -- such as for low-rank matrices -- dequantized algorithms demonstrate that there cannot be an exponential…
The quantization of particle trajectories gives rise to remarkable features such as the coherent superposition of quantum channels and the quantum switch, which offer significant advantages in the communication of both classical and quantum…
We review in a unified way a recently proposed method to detect properties of unknown quantum channels and lower bounds to quantum capacities, without resorting to full quantum process tomography. The method is based on the preparation of a…
We investigate the classical capacity of two quantum channels with memory: a periodic channel with depolarizing channel branches, and a convex combination of depolarizing channels. We prove that the capacity is additive in both cases. As a…
The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during the last period, when a number of direct quantum coding theorems was discovered. To considerable extent…
Quantum masking is a special type of secret sharing in which some information gets reversibly distributed into a multipartite system, leaving the original information inaccessible to each subsystem. This paper proposes a dynamical extension…
This paper establishes that the strong converse holds for some classes of discrete memoryless multimessage multicast networks (DM-MMNs) whose corresponding cut-set bounds are tight, i.e., coincide with the set of achievable rate tuples. The…
The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real world communication channels…
We study channel simulation under common randomness assistance in the finite-blocklength regime and identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.…
As with classical information, error-correcting codes enable reliable transmission of quantum information through noisy or lossy channels. In contrast to the classical theory, imperfect quantum channels exhibit a strong kind of synergy:…
In the absence of any efficient classical schemes for verifying a universal quantum computer, the importance of limiting the required quantum resources for this task has been highlighted recently. Currently, most of efficient quantum…