English
Related papers

Related papers: The Redundancy of Non-Singular Channel Simulation

200 papers

Virtual distillation is an error-mitigation technique that reduces quantum-computation errors without assuming the noise type. In scenarios where the user of a quantum circuit is required to additionally employ peripherals, such as delay…

Quantum Physics · Physics 2023-07-04 Yong Siah Teo , Seongwook Shin , Hyukgun Kwon , Seok-Hyung Lee , Hyunseok Jeong

Using the graphical calculus and integration techniques introduced by the authors, we study the statistical properties of outputs of products of random quantum channels for entangled inputs. In particular, we revisit and generalize models…

Quantum Physics · Physics 2012-02-17 Benoit Collins , Ion Nechita

Recent advancements in information technology and the widespread use of the Internet have led to easier access to data worldwide. As a result, transmitting data through noisy channels is inevitable. Reducing the size of data and protecting…

Traditional studies of multi-source, multi-terminal interference channels typically allow a vanishing probability of error in communication. Motivated by the study of network coding, this work addresses the task of quantifying the loss in…

Information Theory · Computer Science 2013-07-30 Ilia Levi , Dan Vilenchik , Michael Langberg , Michelle Effros

We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent is expressed as a single-letter formula optimized over…

Quantum Physics · Physics 2024-10-15 Aadil Oufkir , Yongsheng Yao , Mario Berta

We derive quantum counterparts of two key theorems of classical information theory, namely, the rate distortion theorem and the source-channel separation theorem. The rate-distortion theorem gives the ultimate limits on lossy data…

Quantum Physics · Physics 2012-12-21 Nilanjana Datta , Min-Hsiu Hsieh , Mark M. Wilde

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

Quantitative analysis of discontinuity of basic characteristics of quantum states and channels is presented. First we consider general estimates for discontinuity jump (loss) of the von Neumann entropy for a given converging sequence of…

Quantum Physics · Physics 2021-09-28 M. E. Shirokov

We argue that a fundamental (conjectured) property of memoryless quantum channels, namely the strong superadditivity, is intimately related to the decreasing property of the quantum relative entropy. Using the latter we first give, for a…

Quantum Physics · Physics 2009-07-09 Grigori G. Amosov , Stefano Mancini

The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have…

Quantum Physics · Physics 2007-05-23 Charles H. Bennett , Peter W. Shor , John A. Smolin , Ashish V. Thapliyal

This paper provides insight into when, why, and how forecast strategies fail when they are applied to complicated time series. We conjecture that the inherent complexity of real-world time-series data---which results from the dimension,…

Information Theory · Computer Science 2014-11-24 Joshua Garland , Ryan James , Elizabeth Bradley

Latent Euclidean embedding models a given network by representing each node in a Euclidean space, where the probability of two nodes sharing an edge is a function of the distances between the nodes. This implies that for two nodes to share…

Social and Information Networks · Computer Science 2019-09-19 Clifford Anderson-Bergman , Phan Nguyen , Jose Cadena Pico

We introduce a quantum channel to model the dissipative dynamics resulting from the coupling between spin and motional degrees of freedom in chains of neutral atoms with Rydberg interactions. The quantum channel acts on the reduced spin…

Quantum Physics · Physics 2025-07-01 Christopher Wyenberg , Kent Ueno , Alexandre Cooper

A source-channel separation theorem for a general channel has recently been shown by Aggrawal et. al. This theorem states that if there exist a coding scheme that achieves a maximum distortion level d_{max} over a general channel W, then…

Information Theory · Computer Science 2013-06-27 Nir Elkayam , Meir Feder

Characterizing the minimal communication needed for the quantum channel simulation is a fundamental task in the quantum information theory. In this paper, we show that, in fidelity, the quantum channel simulation can be directly achieved…

Quantum Physics · Physics 2024-06-25 Michael X. Cao , Rahul Jain , Marco Tomamichel

The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when they are not deleted, they are not affected by the channel.…

Information Theory · Computer Science 2011-05-02 Yashodhan Kanoria , Andrea Montanari

The implementation and practicality of quantum algorithms highly hinge on the quality of operations within a quantum processor. Therefore, including realistic error models in quantum computing simulation platforms is crucial for testing…

Quantum Physics · Physics 2021-04-12 Ahmed Abid Moueddene , Nader Khammassi , Koen Bertels , Carmen G. Almudever

We develop a device-independent framework for testing quantum channels. That is, we falsify a hypothesis about a quantum channel based only on an observed set of input-output correlations. Formally, the problem consists of characterizing…

Quantum Physics · Physics 2017-03-17 Michele Dall'Arno , Sarah Brandsen , Francesco Buscemi

This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and…

Information Theory · Computer Science 2025-05-28 Priyanka Patel , Francesc Molina , Albert Guillén i Fàbregas

The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…

Information Theory · Computer Science 2012-10-26 Feng Xue