English
Related papers

Related papers: Quantum Achievability Proof via Collision Relative…

200 papers

The goal of demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity…

Quantum Physics · Physics 2019-09-16 Niraj Kumar , Iordanis Kerenidis , Eleni Diamanti

Quantum error correction (QEC) is one of the central concepts in quantum information science and also has wide applications in fundamental physics. The capacity theorems provide solid foundations of QEC. We here provide a general and highly…

Quantum Physics · Physics 2021-07-14 Yoshifumi Nakata , Eyuri Wakakuwa , Hayata Yamasaki

We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of…

Quantum Physics · Physics 2013-06-20 Nilanjana Datta , Min-Hsiu Hsieh

In this Thesis, several results in quantum information theory are collected, most of which use entropy as the main mathematical tool. *While a direct generalization of the Shannon entropy to density matrices, the von Neumann entropy behaves…

Quantum Physics · Physics 2018-10-25 Christian Majenz

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 Physics · Physics 2017-07-04 Matthias Christandl , Alexander Müller-Hermes

The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we…

Quantum Physics · Physics 2013-01-29 Ligong Wang , Renato Renner

Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the…

Quantum Physics · Physics 2019-03-19 Anurag Anshu , Rahul Jain , Naqueeb Ahmad Warsi

One-shot information theory entertains a plethora of entropic quantities, such as the smooth max-divergence, hypothesis testing divergence and information spectrum divergence, that characterize various operational tasks and are used to…

Quantum Physics · Physics 2020-08-24 Anurag Anshu , Mario Berta , Rahul Jain , Marco Tomamichel

We prove new one shot achievability results for measurement compression of quantum instruments with side information at the receiver. Unlike previous one shot results for this problem, our one shot bounds are nearly optimal and do not need…

Quantum Physics · Physics 2022-03-31 Sayantan Chakraborty , Arun Padakandla , Pranab Sen

Communication complexity is a fundamental aspect of information science, concerned with the amount of communication required to solve a problem distributed among multiple parties. The standard quantification of one-way communication…

Quantum Physics · Physics 2024-12-25 Satyaki Manna , Anubhav Chaturvedi , Debashis Saha

We prove new inner bounds for several multiterminal channels with classical inputs and quantum outputs. Our inner bounds are all proved in the one-shot setting, and are natural analogues of the best classical inner bounds for the respective…

Quantum Physics · Physics 2020-12-25 Pranab Sen

Quantum theory makes the most accurate empirical predictions and yet it lacks simple, comprehensible physical principles from which the theory can be uniquely derived. A broad class of probabilistic theories exist which all share some…

Quantum Physics · Physics 2012-04-17 Borivoje Dakic , Caslav Brukner

We provide a derivation of quantum theory in which the existence of an energy observable that generates the reversible dynamics follows directly from information-theoretic principles. Our first principle is that every reversible dynamics is…

Quantum Physics · Physics 2026-05-13 Lorenzo Giannelli , Giulio Chiribella

The precise one-shot characterisation of operational tasks in classical and quantum information theory relies on different forms of smooth entropic quantities. A particularly important connection is between the hypothesis testing relative…

Quantum Physics · Physics 2026-04-29 Bartosz Regula , Ludovico Lami , Nilanjana Datta

A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass, but all efficient classical computers cannot (under some cryptographic assumption). Such protocols play a crucial role in the…

Quantum Physics · Physics 2024-05-27 Petia Arabadjieva , Alexandru Gheorghiu , Victor Gitton , Tony Metger

We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…

Quantum Physics · Physics 2019-08-07 Xin Wang , Kun Fang , Marco Tomamichel

We consider the problem of communication over a classical-quantum broadcast channel with one sender and two receivers. Generalizing the classical inner bounds shown by Marton and the recent quantum asymptotic version shown by Savov and…

Information Theory · Computer Science 2015-03-02 Jaikumar Radhakrishnan , Pranab Sen , Naqueeb Warsi

The task of compressing classical information in the one-shot scenario is studied in the setting where the decompressor additionally has access to some given quantum side information. In this hybrid classical-quantum version of the famous…

Quantum Physics · Physics 2012-03-27 Joseph M. Renes , Renato Renner

This thesis establishes a number of connections between foundational issues in quantum theory, and some quantum information applications. It starts with a review of quantum contextuality and non-locality, multipartite entanglement…

Quantum Physics · Physics 2007-05-23 Ernesto F. Galvao

This paper introduces a new and ubiquitous framework for establishing achievability results in \emph{network information theory} (NIT) problems. The framework uses random binning arguments and is based on a duality between channel and…

Information Theory · Computer Science 2014-08-25 Mohammad Hossein Yassaee , Mohammad Reza Aref , Amin Gohari