Related papers: Sharp estimates of quantum covering problems via a…
Fast quantum data transmission faces several shortcomings such as the indistinguishability of some partly overlapping signals, the channel noises, and so on. Based on the encoded quantum data transmission protocol, an unconventional scheme…
Quantum optics bridges esoteric notions of entanglement and superposition with practical applications like metrology and communication. Throughout, there is an interplay between information theoretic concepts such as entropy and physical…
The problem of establishing out-of-sample bounds for the values of an unkonwn ground-truth function is considered. Kernels and their associated Hilbert spaces are the main formalism employed herein along with an observational model where…
Quantum entropy inequalities are studied. Some quantum entropy inequalities are obtained by several methods. For entanglement breaking channel, we show that the entanglement-assisted classical capacity is upper bounded by $\log d$. A…
We establish a simple method to assess the quantum Fisher information required for resolving two incoherent point sources with an imaging system. The resulting Cram\'er-Rao bound shows that the standard Rayleigh limit can be surpassed by…
We establish new integral inequalities for the numerical radius and the operator norm of bounded linear operators on Hilbert spaces. Our results refine classical triangle-type and operator matrix inequalities by incorporating convex…
As quantum computers become available through multi-tenant cloud platforms, ensuring privacy against adversaries sharing the same quantum processing unit becomes critical. We introduce and explore \emph{covert quantum computing}, a new…
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…
Entropic uncertainty relations provide an information-theoretic framework for quantifying the fundamental indeterminacy inherent in quantum mechanics. We propose more stringent quantum-memory-assisted entropic uncertainty relations for…
There are two main factors limiting the performance of quantum key distribution --- channel transmission loss and noise. Previously, a linear bound was believed to put an upper limit on the rate-transmittance performance. Remarkably, the…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…
Colbeck (Thesis, 2006) proposed using Bell inequality violations to generate certified random numbers. While full quantum-security proofs have been given, it remains a major open problem to identify the broadest class of Bell inequalities…
We consider the problem of source compression under three different scenarios in the one-shot (non- asymptotic) regime. To be specific, we prove one-shot achievability and converse bounds on the coding rates for distributed source coding,…
Let $S(\rho)=- Tr (\rho \log\rho)$ be the von Neumann entropy of an $N$-dimensional quantum state $\rho$ and $e_2(\rho)$ the second elementary symmetric polynomial of the eigenvalues of $\rho$. We prove the inequality $S(\rho) \le c(N)…
A simple and unifying method to show the perfect error-correcting condition is provided based on the quantum mutual information. The one-to-one parameterization of quantum operations and the properties of the quantum relative entropy are…
Quantum hypothesis testing concerns the discrimination between quantum states. This paper introduces a novel lower bound for asymmetric quantum hypothesis testing that is based on the Nussbaum-Szko{\l}a mapping. The lower bound provides a…
By revisiting the mathematical foundation of the uncertainty relation, skew information-based uncertainty sequences are developed for any two quantum channels. A reinforced version of the Cauchy-Schwarz inequality is adopted to improve the…
We consider a quantum quasi-relative entropy $S_f^K$ for an operator $K$ and an operator convex function $f$. We show how to obtain the error bounds for the monotonicity and joint convexity inequalities from the recent results for the…
In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using…
Scalable quantum computing can only be achieved if qubits are manipulated fault-tolerantly. Topological error correction - a novel method which combines topological quantum computing and quantum error correction - possesses the highest…