English
Related papers

Related papers: A Finite-Blocklength Analysis for ORBGRAND

200 papers

Randomized benchmarking (RB) is widely used to measure an error rate of a set of quantum gates, by performing random circuits that would do nothing if the gates were perfect. In the limit of no finite-sampling error, the exponential decay…

Quantum Physics · Physics 2017-10-03 Timothy Proctor , Kenneth Rudinger , Kevin Young , Mohan Sarovar , Robin Blume-Kohout

As sensing and instrumentation play an increasingly important role in systems controlled over wired and wireless networks, the need to better understand delay-sensitive communication becomes a prime issue. Along these lines, this article…

Information Theory · Computer Science 2021-03-26 Anoosheh Heidarzadeh , Jean-Francois Chamberland , Parimal Parag , Richard D. Wesel

Randomized benchmarking (RB) is an efficient and robust method to characterize gate errors in quantum circuits. Averaging over random sequences of gates leads to estimates of gate errors in terms of the average fidelity. These estimates are…

Quantum Physics · Physics 2019-09-11 Jonas Helsen , Joel J. Wallman , Steven T. Flammia , Stephanie Wehner

This work studies distributed compression for the uplink of a cloud radio access network where multiple multi-antenna base stations (BSs) are connected to a central unit, also referred to as cloud decoder, via capacity-constrained backhaul…

Information Theory · Computer Science 2012-06-19 Seok-Hwan Park , Osvaldo Simeone , Onur Sahin , Shlomo Shamai

Reliable retrieval-augmented generation (RAG) systems depend fundamentally on the retriever's ability to find relevant information. We show that neural retrievers used in RAG systems have blind spots, which we define as the failure to…

Information Retrieval · Computer Science 2026-02-11 Zeinab Sadat Taghavi , Ali Modarressi , Hinrich Schutze , Andreas Marfurt

Random number generators (RNG) based on quantum mechanics are captivating due to their security and unpredictability compared to conventional generators, such as pseudo-random number generators and hardware-random number generators. This…

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

Retrieval-augmented Generation (RAG) enhances Large Language Models (LLMs) by integrating external knowledge to reduce hallucinations and incorporate up-to-date information without retraining. As an essential part of RAG, external knowledge…

Computer Vision and Pattern Recognition · Computer Science 2025-09-03 Junyuan Zhang , Qintong Zhang , Bin Wang , Linke Ouyang , Zichen Wen , Ying Li , Ka-Ho Chow , Conghui He , Wentao Zhang

Second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint $\epsilon$ is obtained by using the information spectrum method. We apply…

Information Theory · Computer Science 2016-11-15 Masahito Hayashi

We describe how randomized benchmarking can be used to reconstruct the unital part of any trace-preserving quantum map, which in turn is sufficient for the full characterization of any unitary evolution, or more generally, any unital…

Quantum Physics · Physics 2016-04-12 Shelby Kimmel , Marcus P. da Silva , Colm A. Ryan , Blake R. Johnson , Thomas Ohki

The well-known graph-based clustering methods, including spectral clustering, symmetric non-negative matrix factorization, and doubly stochastic normalization, can be viewed as relaxations of the kernel $k$-means approach. However, we posit…

Machine Learning · Computer Science 2025-09-24 Wenlong Lyu , Yuheng Jia , Hui Liu , Junhui Hou

Locally repairable codes (LRCs) were originally introduced to enable efficient recovery from erasures in distributed storage systems by accessing only a small number of other symbols. While their structural properties-such as bounds and…

Information Theory · Computer Science 2026-02-23 Hoang Ly , Emina Soljanin , Philip Whiting

We study error bounds for linear programming decoding of regular LDPC codes. For memoryless binary-input output-symmetric channels, we prove bounds on the word error probability that are inverse doubly-exponential in the girth of the factor…

Information Theory · Computer Science 2011-04-12 Nissim Halabi , Guy Even

Recent work has shown that standard training via empirical risk minimization (ERM) can produce models that achieve high accuracy on average but low accuracy on underrepresented groups due to the prevalence of spurious features. A…

Machine Learning · Computer Science 2023-05-11 Yachuan Liu , Bohan Zhang , Qiaozhu Mei , Paramveer Dhillon

This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…

Information Theory · Computer Science 2023-05-17 Ioannis Papoutsidakis , Angela Doufexi , Robert J. Piechocki

Benchmarking methods that can be adapted to multi-qubit systems are essential for assessing the overall or "holistic" performance of nascent quantum processors. The current industry standard is Clifford randomized benchmarking (RB), which…

Fundamental rate-distortion-perception (RDP) trade-offs arise in applications requiring maintained perceptual quality of reconstructed data, such as neural image compression. When compressed data is transmitted over public communication…

Information Theory · Computer Science 2026-04-23 Gustaf Åhlgren , Onur Günlü

Ordinary differential equation (ODE) is an important tool to study the dynamics of a system of biological and physical processes. A central question in ODE modeling is to infer the significance of individual regulatory effect of one signal…

Methodology · Statistics 2024-02-06 Xiaowu Dai , Lexin Li

In wavelength division multiplexed (WDM) optical networks, intraband and/or interband crosstalk plays a major role in limiting practical implementation of an OXC subsystem. Again FIBER BRAGG GRATINGS (FBGs), due to their properties, are…

Optics · Physics 2012-03-15 Bobby Barua

We derive the optimum second-order coding rates, known as second-order capacities, for erasure and list decoding. For erasure decoding for discrete memoryless channels, we show that second-order capacity is $\sqrt{V}\Phi^{-1}(\epsilon_t)$…

Information Theory · Computer Science 2014-04-22 Vincent Y. F. Tan , Pierre Moulin