English
Related papers

Related papers: Improved Lower Bounds for Learning Quantum Channel…

200 papers

For multi-input and multi-output (MIMO) channels, the optimal channel estimation (CE) based on linear minimum mean square error (LMMSE) requires three-dimensional (3D) filtering. However, the complexity is often prohibitive due to large…

Machine Learning · Computer Science 2026-04-03 Xiangzhao Qin , Sha Hu

We study the generalized degrees of freedom (gDoF) of the block-fading noncoherent diamond (parallel relay) wireless network with asymmetric distributions of link strengths, and a coherence time of T symbol duration. We first derive an…

Information Theory · Computer Science 2020-02-20 Joyson Sebastian , Suhas Diggavi

Divergence chain rules for channels relate the divergence of a pair of channel inputs to the divergence of the corresponding channel outputs. An important special case of such a rule is the data-processing inequality, which tells us that if…

Quantum Physics · Physics 2024-05-21 Mario Berta , Marco Tomamichel

We investigate the error tolerance of quantum cryptographic protocols using $d$-level systems. In particular, we focus on prepare-and-measure schemes that use two mutually unbiased bases and a key-distillation procedure with two-way…

Quantum Physics · Physics 2007-05-23 Georgios M. Nikolopoulos , Kedar S. Ranade , Gernot Alber

Shadow tomography for quantum states provides a sample efficient approach for predicting the properties of quantum systems when the properties are restricted to expectation values of $2$-outcome POVMs. However, these shadow tomography…

Quantum Physics · Physics 2022-09-08 Weiyuan Gong , Scott Aaronson

We propose a novel deep learning-based channel estimation technique for high-dimensional communication signals that does not require any training. Our method is broadly applicable to channel estimation for multicarrier signals with any…

Signal Processing · Electrical Eng. & Systems 2019-04-23 Eren Balevi , Jeffrey G. Andrews

In this work, we study the learnability of quantum circuits in the near term. We demonstrate the natural robustness of quantum statistical queries for learning quantum processes, motivating their use as a theoretical tool for near-term…

Quantum Physics · Physics 2025-04-29 Chirag Wadhwa , Mina Doosti

A real time coding system with lookahead consists of a memoryless source, a memoryless channel, an encoder, which encodes the source symbols sequentially with knowledge of future source symbols upto a fixed finite lookahead, d, with or…

Information Theory · Computer Science 2011-05-31 Himanshu Asnani , Tsachy Weissman

We derive a lower bound on the differential entropy of a log-concave random variable $X$ in terms of the $p$-th absolute moment of $X$. The new bound leads to a reverse entropy power inequality with an explicit constant, and to new bounds…

Information Theory · Computer Science 2018-04-04 Arnaud Marsiglietti , Victoria Kostina

State-of-the-art sensors of force, motion and magnetic fields have reached the sensitivity where the quantum noise of the meter is significant or even dominant. In particular, the sensitivity of the best optomechanical devices has reached…

Quantum Physics · Physics 2021-05-05 Farid Ya. Khalili , Emil Zeuthen

Determining the ultimate limits of quantum communication, such as the quantum capacity of a channel and the distillable entanglement of a shared state, remains a central challenge in quantum information theory, primarily due to the…

Quantum Physics · Physics 2025-10-15 Chengkai Zhu , Hongyu Mao , Kun Fang , Xin Wang

We study the problem of approximating a quantum channel by one with as few Kraus operators as possible (in the sense that, for any input state, the output states of the two channels should be close to one another). Our main result is that…

Quantum Physics · Physics 2024-05-01 Cécilia Lancien , Andreas Winter

Analyzing the dimension of an unknown quantum system in a device-independent manner, i.e., using only the measurement statistics, is a fundamental task in quantum physics and quantum information theory. In this paper, we consider this…

Quantum Physics · Physics 2016-11-02 Jamie Sikora , Antonios Varvitsiotis , Zhaohui Wei

We introduce a new quantum decoder based on a variant of the pretty good measurement, but defined via an alternative matrix quotient. We use this decoder to show new lower bounds on the error exponent both in the one-shot and asymptotic…

Quantum Physics · Physics 2025-07-29 Salman Beigi , Marco Tomamichel

We determine a fundamental upper bound on the performance of any adaptive protocol for discrimination or estimation of a channel which has an unknown parameter encoded in the state of its environment. Since our approach relies on the…

Quantum Physics · Physics 2016-11-29 Masahiro Takeoka , Mark M. Wilde

The study of quantum channels is the most fundamental theoretical problem in quantum information and quantum communication theory. The link product theory of quantum channels is an important tool for studying quantum networks. In this…

Quantum Physics · Physics 2024-03-13 Qiang Lei , Liuheng Cao , Asutosh Kumar , Junde Wu

We derive an upper bound on the action of a direct product of two quantum maps (channels) acting on multi-partite quantum states. We assume that the individual channels $\Lambda_j$ affect single-particle states so, that for an arbitrary…

Quantum Physics · Physics 2007-05-23 Peter Stelmachovic , Vladimir Buzek

Quantum communication and computation heavily rely on entanglement distillation protocols. There is a plethora of distillation protocols for Pauli channels and also for some non-Pauli channels. However, an effort to relate the effectiveness…

Quantum Physics · Physics 2025-02-05 Dina Abdelhadi , Tomas Jochym-O'Connor , Vikesh Siddhu , John Smolin

Accurate manipulations of an open quantum system require a deep knowledge of its controllability properties and the information content of the implemented control fields. By using tools of information and quantum optimal control theory, we…

We are presented with a graph, $G$, on $n$ vertices with $m$ edges whose edge set is unknown. Our goal is to learn the edges of $G$ with as few queries to an oracle as possible. When we submit a set $S$ of vertices to the oracle, it tells…

Quantum Physics · Physics 2024-03-01 Asaf Ferber , Liam Hardiman