English
Related papers

Related papers: Reliable Simulation of Quantum Channels: the Error…

200 papers

We introduce a resource theory of channels relevant to communication via quantum channels, in which the set of constant channels --- useless channels for communication tasks --- is considered as the free resource. We find that our theory…

Quantum Physics · Physics 2020-03-27 Ryuji Takagi , Kun Wang , Masahito Hayashi

We give trade-offs between classical communication, quantum communication, and entanglement for processing information in the Shannon-theoretic setting. We first prove a unit-resource capacity theorem that applies to the scenario where only…

Quantum Physics · Physics 2010-08-23 Min-Hsiu Hsieh , Mark M. Wilde

We consider the discrete memoryless degraded broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function.…

Information Theory · Computer Science 2015-04-23 Yasutada Oohama

We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…

Quantum Physics · Physics 2018-03-07 Anurag Anshu

The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes,…

Quantum Physics · Physics 2007-06-13 M. I. Dyakonov

Estimates of the quantum accuracy threshold often tacitly assume that it is possible to interact arbitrary pairs of qubits in a quantum computer with a failure rate that is independent of the distance between them. None of the many physical…

Quantum Physics · Physics 2013-05-29 A. M. Stephens , Z. W. E. Evans

We show that entirely quantum Shannon theoretic methods, based on von Neumann entropies and their properties, can be used to derive Singleton bounds on the performance of entanglement-assisted hybrid classical-quantum (EACQ) error…

Quantum Physics · Physics 2024-09-25 Manideep Mamindlapally , Andreas Winter

Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. While ordinary teleportation is simple and efficient, port-based teleportation (PBT) enables applications such as universal programmable quantum…

A model of quantum noisy channel with input encoding by a classical random vector is described. An equation of optimality is derived to determine a complete set of wave functions describing quantum decodings based on quasi-measurements…

Quantum Physics · Physics 2007-05-23 V. P. Belavkin , R. L. Stratonovich

Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distillation, etc., which characterize asymptotic properties of…

Quantum Physics · Physics 2008-10-03 I. Devetak , A. W. Harrow , A. Winter

We study the robustness of quantum computers under the influence of errors modelled by strictly contractive channels. A channel $T$ is defined to be strictly contractive if, for any pair of density operators $\rho,\sigma$ in its domain, $\|…

Quantum Physics · Physics 2007-05-23 Maxim Raginsky

Covert and secret quantum key distribution aims at generating information-theoretically secret bits between distant legitimate parties in a manner that remains provably undetectable by an adversary. We propose a framework in which to…

Information Theory · Computer Science 2019-05-29 Mehrdad Tahmasbi , Matthieu R. Bloch

We demonstrate that the Maximum Lyapunov Exponent for computable dynamical systems is isomorphic to the maximum capacity of a noiseless, memoryless channel in a Shannon communication model. The isomorphism allows the understanding of…

Statistical Mechanics · Physics 2018-01-29 Gerald Friedland , Alfredo Metere

We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the…

Quantum Physics · Physics 2007-05-23 Peter W. Shor

We consider the scenario of classical communication over a finite-dimensional quantum channel with memory using a separable-state input ensemble and local output measurements. We propose algorithms for estimating the information rate of…

Information Theory · Computer Science 2024-10-30 Michael X. Cao , Pascal O. Vontobel

It was shown by Ahn, Wiseman, and Milburn [PRA {\bf 67}, 052310 (2003)] that feedback control could be used as a quantum error correction process for errors induced by weak continuous measurement, given one perfectly measured error channel…

Quantum Physics · Physics 2009-11-10 Charlene Ahn , H. M. Wiseman , Kurt Jacobs

The discrete memoryless interference channel is modelled as a conditional probability distribution with two outputs depending on two inputs and has widespread applications in practical communication scenarios. In this paper, we introduce…

Quantum Physics · Physics 2015-03-19 Ivan Savov , Omar Fawzi , Mark M. Wilde , Pranab Sen , Patrick Hayden

Quantum channel capacities play a central role in quantum Shannon theory, a formalism built upon rigorous coding theorems for noisy channels. Evaluating exact capacity values for general quantum channels remains intractable due to…

Quantum Physics · Physics 2025-10-14 Zhen Wu , Si-Qi Zhou

We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we propose to consider a certain operator space as the quantum generalisation of the adjacency matrix, in terms of…

Quantum Physics · Physics 2013-04-19 Runyao Duan , Simone Severini , Andreas Winter

Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,\epsilon)$ of length-$n$ codes subject to an average decoding error…

Information Theory · Computer Science 2016-12-28 Pierre Moulin
‹ Prev 1 8 9 10 Next ›