Related papers: Efficiently Computable Strategies and Limits for B…
We study quantum channels that are close to another channel with weakly additive Holevo information and derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking…
Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the…
We consider energy-constrained infinite-dimensional quantum channels from a given system (satisfying a certain condition) to any other systems. We show that dealing with basic capacities of these channels we may assume (accepting…
The capacities of noisy quantum channels capture the ultimate rates of information transmission across quantum communication lines, and the quantum capacity plays a key role in determining the overhead of fault-tolerant quantum computation…
This paper studies the difficulty of discriminating between an arbitrary quantum channel and a "replacer" channel that discards its input and replaces it with a fixed state. We show that, in this particular setting, the most general…
Unitary errors, such as those arising from fault-tolerant compilation of quantum algorithms, systematically bias observable estimates. Correcting this bias typically requires additional resources, such as an increased number of non-Clifford…
Identification in quantum communication enables receivers to verify the presence of a message without decoding its entire content. While identification capacity has been explored for classical and finite-dimensional quantum channels, its…
Current quantum computers suffer from non-stationary noise channels with high error rates, which undermines their reliability and reproducibility. We propose a Bayesian inference-based adaptive algorithm that can learn and mitigate quantum…
What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we…
Quantum multiparameter estimation involves estimating multiple parameters simultaneously and can be more precise than estimating them individually. Our interest here is to determine fundamental quantum limits to the achievable…
Computing systems that can tolerate effects of errors in their communicated data values can trade this tolerance for improved resource efficiency. Many important applications of computing, such as embedded sensor systems, can tolerate…
Amplitude damping (AD) channels are good models for many physical scenarios, and so the development of protocols to discriminate between them is an important task in quantum information science. It is therefore important to bound the…
A core problem in communications is the optimal discrimination of binary-phase-shift-keyed (BPSK) signals. A longstanding goal has been to reach the fundamental quantum limit, known as the Helstrom bound, for BPSK signals encoded in…
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…
We derive fundamental bounds on the maximal achievable precision in multiparameter noisy quantum metrology, valid under the most general entanglement-assisted adaptive strategy, which are tighter than the bounds obtained by a direct use of…
Motivated by the application of point-to-point communication networks and biological storage, we investigate new achievability bounds for noisy permutation channels with strictly positive and full-rank square matrices. Our new bounds use…
We develop several lower bounds on the capacity of binary input symmetric output channels with synchronization errors which also suffer from other types of impairments such as substitutions, erasures, additive white Gaussian noise (AWGN)…
We investigate the classical communication over quantum channels when assisted by no-signaling (NS) and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the…
We study asymmetric binary channel discrimination, for qantum channels acting on separable Hilbert spaces. We establish quantum Stein's lemma for channels for both adaptive and parallel strategies, and show that under finiteness of the…
We study distributed similarity estimation of quantum channels (DSEC), a primitive for cross-platform verification where two remote quantum devices are compared by estimating the inner product of their Choi states. We show that the optimal…