中文
相关论文

相关论文: Algorithmic Superactivation of Asymptotic Quantum …

200 篇论文

We define a new phenomenon for communication over noisy quantum channels. The investigated solution is called polaractivation and based on quantum polar encoding. Polaractivation is a natural consequence of the channel polarization effect…

量子物理 · 物理学 2016-11-18 Laszlo Gyongyosi

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…

量子物理 · 物理学 2016-12-01 Chiara Macchiavello , Massimiliano F. Sacchi

We present an experimental approach to construct a dephrasure channel, which contains both dephasing and erasure noises, and can be used as an efficient tool to study the superadditivity of coherent information. By using a three-fold…

A quantum channel is conjugate degradable if the channel's environment can be simulated up to complex conjugation using the channel's output. For all such channels, the quantum capacity can be evaluated using a single-letter formula. In…

量子物理 · 物理学 2010-07-19 Kamil Bradler , Nicolas Dutil , Patrick Hayden , Abubakr Muhammad

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…

量子物理 · 物理学 2009-01-23 Charles H. Bennett , Peter W. Shor , John A. Smolin , Ashish V. Thapliyal

Quantum amplifier channels are at the core of several physical processes. Not only do they model the optical process of spontaneous parametric down-conversion, but the transformation corresponding to an amplifier channel also describes the…

量子物理 · 物理学 2017-02-02 Haoyu Qi , Mark M. Wilde

We propose a method to detect lower bounds to quantum capacities of a noisy quantum communication channel by means of few measurements. The method is easily implementable and does not require any knowledge about the channel. We test its…

量子物理 · 物理学 2016-04-12 Chiara Macchiavello , Massimiliano F. Sacchi

A quantum communication channel can be put to many uses: it can transmit classical information, private classical information, or quantum information. It can be used alone, with shared entanglement, or together with other channels. For each…

信息论 · 计算机科学 2010-07-20 Graeme Smith

Quantum channel capacities give the fundamental performance limits for information flow over a communication channel. However, the prevalence of superadditivity is a major obstacle to understanding capacities, both quantitatively and…

量子物理 · 物理学 2025-09-10 Graeme Smith , Peixue Wu

We present a method to detect lower bounds to the classical capacity of quantum communication channels by means of few local measurements (i.e. without complete process tomography), reconstruction of sets of conditional probabilities, and…

量子物理 · 物理学 2019-08-30 Chiara Macchiavello , Massimiliano F. Sacchi

Recently the theory of communication developed by Shannon has been extended to the quantum realm by exploiting the rules of quantum theory. This latter stems on complex vector spaces. However complex (as well as real) numbers are just…

信息论 · 计算机科学 2018-04-23 Samad Khabbazi Oskouei , Stefano Mancini

The quantum capacity of a quantum channel captures its capability for noiseless quantum communication. It lies at the heart of quantum information theory. Unfortunately, our poor understanding of nonadditivity of coherent information makes…

量子物理 · 物理学 2018-12-07 Felix Leditzky , Debbie Leung , Graeme Smith

Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error…

量子物理 · 物理学 2024-11-07 Matthias Christandl , Alexander Müller-Hermes

Understanding quantum channels and the strange behavior of their capacities is a key objective of quantum information theory. Here we study a remarkably simple, low-dimensional, single-parameter family of quantum channels with exotic…

量子物理 · 物理学 2023-06-14 Felix Leditzky , Debbie Leung , Vikesh Siddhu , Graeme Smith , John A. Smolin

The quantum channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known.…

量子物理 · 物理学 2011-03-31 Markus Grassl , Zhengfeng Ji , Zhaohui Wei , Bei Zeng

Quantum channel capacity is a fundamental quantity in order to understand how good can quantum information be transmitted or corrected when subjected to noise. However, it is generally not known how to compute such quantities, since the…

量子物理 · 物理学 2023-09-20 Josu Etxezarreta Martinez , Antonio deMarti iOlius , Pedro M. Crespo

When classical information is sent through a quantum channel of nonorthogonal states, there is a possibility that transmittable classical information exceeds a channel capacity in a single use of the initial channel by extending it into…

量子物理 · 物理学 2009-10-30 Masahide Sasaki , Kentaro Kato , Masayuki Izutsu , Osamu Hirota

Entangled inputs can enhance the capacity of quantum channels, this being one of the consequences of the celebrated result showing the non-additivity of several quantities relevant for quantum information science. In this work, we answer…

量子物理 · 物理学 2015-05-20 Fernando G. S. L. Brandao , Jens Eisert , Michal Horodecki , Dong Yang

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…

量子物理 · 物理学 2020-03-04 Lu Li , Kaifeng Bu , Zi-Wen Liu

The design of error-correcting codes used in modern communications relies on information theory to quantify the capacity of a noisy channel to send information [1]. This capacity can be expressed using the mutual information between input…

量子物理 · 物理学 2019-07-17 M. B. Hastings