Related papers: Probabilistic channel simulation using coherence
We propose a general method to operationally quantify the resourcefulness of quantum channels via channel discrimination, an important information processing task. A main result is that the maximum success probability of distinguishing a…
Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information theory. Recently, [Berta-Borderi-Fawzi-Scholz, Mathematical Programming, 2021]…
Decoherence is all around us. Every quantum system that interacts with the environment is doomed to decohere. The preservation of quantum coherence is one of the major challenges faced in quantum technologies, but its use as a resource is…
This paper introduces coherent quantum channel discrimination as a coherent version of conventional quantum channel discrimination. Coherent channel discrimination is phrased here as a quantum interactive proof system between a verifier and…
Coherent superposition is a key feature of quantum mechanics that underlies the advantage of quantum technologies over their classical counterparts. Recently, coherence has been recast as a resource theory in an attempt to identify and…
We characterize the operational capabilities of quantum channels which can neither create nor detect quantum coherence vis-\`a-vis efficiently manipulating coherence as a resource. We study the class of dephasing-covariant operations (DIO),…
Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the…
Quantum coherence is one of the fundamental properties of quantum mechanics and also acts as a valuable resource for a variety of practical applications, which includes quantum computing and quantum information processing. Evaluating the…
The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state,…
We investigate the classical communication over quantum channels when assisted by no-signaling (NS) and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the…
We study the effect of shared non-signaling correlations for the problem of simulating a channel using noiseless communication in the one-shot setting. For classical channels, we show how to round any non-signaling-assisted simulation…
Is it always possible to explain random stochastic transitions between states of a finite-dimensional system as arising from the deterministic quantum evolution of the system? If not, then what is the minimal amount of randomness required…
Any quantum resource theory is based on free states and free operations, i.e., states and operations which can be created and performed at no cost. In the resource theory of coherence free states are diagonal in some fixed basis, and free…
We investigate the coherence of quantum channels using the Choi-Jamio\l{}kowski isomorphism. The relation between the coherence and the purity of the channel respects a duality relation. It characterizes the allowed values of coherence when…
We present a class of numerical algorithms which adapt a quantum error correction scheme to a channel model. Given an encoding and a channel model, it was previously shown that the quantum operation that maximizes the average entanglement…
In this paper, we consider a simplified error-correcting problem: for a fixed encoding process, to find a cascade connected quantum channel such that the worst fidelity between the input and the output becomes maximum. With the use of the…
We generalize the recently proposed resource theory of coherence (or superposition) [Baumgratz, Cramer & Plenio, Phys. Rev. Lett. 113:140401; Winter & Yang, Phys. Rev. Lett. 116:120404] to the setting where not only the free ("incoherent")…
It is well known that opportunistic scheduling algorithms are throughput optimal under full knowledge of channel and network conditions. However, these algorithms achieve a hypothetical achievable rate region which does not take into…
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.…
A programmable quantum processor is a fundamental model of quantum computation. In this model, any quantum channel can be approximated by applying a fixed universal quantum operation onto an input state and a quantum `program' state, whose…