Related papers: Error exponents for entanglement transformations f…
We consider a class of sampling-based decomposition methods to solve risk-averse multistage stochastic convex programs. We prove a formula for the computation of the cuts necessary to build the outer linearizations of the recourse…
An asymptotic entanglement measure for any bipartite states is derived in the light of the dense coding capacity optimized with respect to local quantum operations and classical communications. General properties and some examples with…
We study how well answer to the question ``Is the given quantum state equal to a certain maximally entangled state?'' using LOCC, in the context of hypothesis testing. Under several locality and invariance conditions, optimal tests will be…
Probabilistic Amplitude Shaping (PAS) is a coded-modulation scheme in which the encoder is a concatenation of a distribution matcher with a systematic Forward Error Correction (FEC) code. For reduced computational complexity the decoder can…
Quantum coherence is one of the fundamental aspects distinguishing classical and quantum theories. Coherence between different energy eigenstates is particularly important, as it serves as a valuable resource under the law of energy…
The AdaBoost algorithm was designed to combine many "weak" hypotheses that perform slightly better than random guessing into a "strong" hypothesis that has very low error. We study the rate at which AdaBoost iteratively converges to the…
Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be…
Characterization and quantification of multipartite entanglement is one of the challenges in state-of-the-art experiments in quantum information processing. According to theory, this is achieved via entanglement monotones, that is,…
In quantum information theory, it is widely believed that entanglement concentration for bipartite pure states is asymptotically reversible. In order to examine this, we give a precise formulation of the problem, and show a trade-off…
This paper characterizes the optimal type-II error exponent for a distributed hypothesis testing-against-independence problem when the \emph{expected} rate of the sensor-detector link is constrained. Unlike for the well-known…
We study intrinsic coherence in the tripartite process to unambiguously discriminate two nonorthogonal states of a qubit, entangled with another one, and assisted by an auxiliary system. The optimal success probability is found to be…
Two remote parties, Alice and Bob initially share some non-maximally entangled states. Through the entanglement concentration by local operation and classical communication(LOCC), they may obtain an outcome of maximally entangled states in…
Given a finite dimensional pure state transformation restricted by entanglement assisted local operations and classical communication (ELOCC), we derive minimum and maximum bounds on the entanglement of an ancillary catalyst that allows…
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…
Binary measurements arise naturally in a variety of statistical and engineering applications. They may be inherent to the problem---e.g., in determining the relationship between genetics and the presence or absence of a disease---or they…
The impossibility of deterministic and error-free discrimination among nonorthogonal quantum states lies at the core of quantum theory and constitutes a primitive for secure quantum communication. Demanding determinism leads to errors,…
In this paper, we present a general numerical framework for both deterministic and probabilistic quantum state transformations, under locality constraints. For a given arbitrary bipartite initial state and a desired bipartite target state,…
We consider the development of adaptive, instance-dependent algorithms for interactive decision making (bandits, reinforcement learning, and beyond) that, rather than only performing well in the worst case, adapt to favorable properties of…
Bidirectional quantum teleportation is a fundamental protocol for exchanging quantum information between two parties. Specifically, the two individuals make use of a shared resource state as well as local operations and classical…
In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on…