Abstract The measured relative entropies of quantum states and channels find operational significance in quantum information theory as achievable error rates in hypothesis testing tasks. They are of interest in the near term, as they correspond to hybrid quantum–classical strategies with technological requirements far less challenging to implement than required by the most general strategies allowed by quantum mechanics. In this paper, we prove that these measured relative entropies can be calculated efficiently by means of semidefinite programming (SDP), by making use of variational formulas for the measured relative entropies of states and semidefinite representations of the weighted geometric mean and the operator connection of the logarithm. Not only do the semidefinite programs provide the optimal values of the measured relative entropies of states and channels, but also the numerical characterizations of optimal strategies for achieving them, which is of significant practical interest for designing hypothesis testing protocols.
Abstract The measured relative entropies of quantum states and channels find operational significance in quantum information theory as achievable error rates in hypothesis testing tasks. They are of interest in the near term, as they correspond to hybrid quantum–classical strategies with technological requirements far less challenging to implement than required by the most general strategies allowed by quantum mechanics. In this paper, we prove that these measured relative entropies can be calculated efficiently by means of semidefinite programming (SDP), by making use of variational formulas for the measured relative entropies of states and semidefinite representations of the weighted geometric mean and the operator connection of the logarithm. Not only do the semidefinite programs provide the optimal values of the measured relative entropies of states and channels, but also the numerical characterizations of optimal strategies for achieving them, which is of significant practical interest for designing hypothesis testing protocols.
Abstract Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing provable upper and lower bounds is the central result of this work. Our primordial motivation stems from the essential task of estimating secret key rates for QKD from the measurement statistics of a real device. Further applications include the computation of channel capacities, the estimation of entanglement measures and many more. We build on a recently introduced integral representation of quantum relative entropy by [Frenkel, Quantum 7, 1102 (2023)] and provide reliable bounds as a sequence of semidefinite programs (SDPs). Our approach ensures provable sublinear convergence in the discretization, while also maintaining resource efficiency in terms of SDP matrix dimensions. Additionally, we can provide gap estimates to the optimum at each iteration stage.
The measured relative entropy and measured Rényi relative entropy are quantifiers of the distinguishability of two quantum states ρ and σ. They are defined as the maximum classical relative entropy or Rényi relative entropy realizable by performing a measurement on ρ and σ, and they have interpretations in terms of asymptotic quantum hypothesis testing. Crucially, they can be rewritten in terms of variational formulas involving the optimization of a concave or convex objective function over the set of positive definite operators. In this paper, we establish foundational properties of these objective functions by analyzing their matrix gradients and Hessian superoperators; namely, we prove that these objective functions are β-smooth and γ-strongly convex / concave, where β and γ depend on the max-relative entropies of ρ and σ. A practical consequence of these properties is that we can conduct Nesterov accelerated projected gradient descent / ascent, a well known classical optimization technique, to calculate the measured relative entropy and measured Rényi relative entropy to arbitrary precision. These algorithms are generally more memory efficient than our previous algorithms based on semi-definite optimization [Huang and Wilde, arXiv:2406.19060], and for well conditioned states ρ and σ, these algorithms are notably faster.
The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state, projective operators, unitary learning, and others), Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi matrix. A remarkable feature of SDP is that the optimization is convex, which allows the problem to be efficiently solved by a variety of numerical algorithms. We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of quantum channels of different forms. A notable feature is that the Kraus rank of the obtained quantum channel typically comprises less than a few percent of its maximal possible value. This suggests that a relatively small Kraus rank quantum channel is typically sufficient to describe experimentally observed classical data. The theory was also applied to the problem of reconstructing projective operators from data. Finally, we discuss a classical computational model based on quantum channel transformation, performed and calculated on a classical computer, possibly hardware-optimized.
We study an entropy measure for quantum systems that generalizes the von Neumann entropy as well as its classical counterpart, the Gibbs or Shannon entropy. The entropy measure is based on hypothesis testing and has an elegant formulation as a semidefinite program, a type of convex optimization. After establishing a few basic properties, we prove upper and lower bounds in terms of the smooth entropies, a family of entropy measures that is used to characterize a wide range of operational quantities. From the formulation as a semidefinite program, we also prove a result on decomposition of hypothesis tests, which leads to a chain rule for the entropy.
We use the techniques of convex optimization, especially semidefinite programming, to study two kinds of fundamental tasks, i.e., distillation and simulation in quantum information theory. We investigate these tasks in a unified framework of resource theory and focus on their computation and characterization with finite resources. Particularly we study the tradeoff among relevant parameters such as the number of resource copies, resource transformation rate, error tolerance and success probability.
In the first part, we study the task of distillation for two different resources, maximally entangled state and maximally coherent state, representing nonlocal and local “quantumness” respectively. For entanglement distillation, we derive an efficiently computable second-order estimation of the distillation rate for general quantum states, which are tight for quantum states of practical interest. Our study overcomes the limitation of conventional research either focusing on the asymptotic rate or ignoring the computability. For the coherence distillation, we perform finite analysis for both deterministic and probabilistic scenarios. Our results unveil several new features of coherence from a resource theoretic viewpoint and contribute to an increased understanding of the fundamental properties of different sets of free operations.
In the second part, we investigate the resource cost of simulating a quantum channel via quantum coherence or another quantum channel. We introduce the channel’s analogs of max-relative entropy, logarithmic robustness and max-information of quantum states, providing their operational interpretation with the channel simulation cost via different resources. Particularly, we establish the asymptotic equipartition property of the channel’s max-information, that is, it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. As applications, this asymptotic equipartition property implies the quantum reverse Shannon theorem in the presence of non-signalling correlations.
From the perspective of resource theory, the worth of a resource can usually be characterized by the minimum distance to a set of useless resources under a proper distance measure. We give such characterization for all the tasks studied in this thesis, and find that the distance measure for the distillation and simulation process naturally corresponds to the quantum hypothesis testing relative entropy and the max-relative entropy, respectively.
This thesis aims to improve our understanding of the structure of quantum entanglement and the limits of information processing with quantum systems. It presents new results relevant to three threads of quantum information: the theory of quantum entanglement, the communication capabilities of quantum channels, and the quantum zero-error information theory. \nIn the first part, we investigate the fundamental features of quantum entanglement and develop quantitative approaches to better exploit the power of entanglement. First, we introduce a computable and additive entanglement measure to quantify the amount of entanglement, which also plays an important role as the improved semidefinite programming (SDP) upper bound of distillable entanglement. Second, we show that the Rains bound is neither additive nor equal to the asymptotic relative entropy of entanglement. Third, we establish SDP lower bounds for the entanglement cost and demonstrate the irreversibility of asymptotic entanglement manipulation under positive-partial-transpose-preserving quantum operations, resolving a major open problem in quantum information theory. \nIn the second part, we develop a framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes. In particular, we establish the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel and give in particular the best known upper bound on the classical capacity of the amplitude damping channel. We further establish a finite resource analysis of classical communication over quantum erasure channels, including the first second-order expansion of classical capacity beyond entanglement-breaking channels. For quantum communication, we establish the best SDP-computable strong converse bound and refine it as the so-called max-Rains information. \nIn the third part, we investigate the quantum zero-error information theory. In contrast to the conventional Shannon theory, there is a very different-looking information theory when errors are required to be precisely zero, where the communication problem reduces to the analysis of the so-called confusability graph (noncommutative graph) of a classical channel (quantum channel). We develop an activated communication model and explore its novel properties. Notably, we separate the quantum Lovász number and the entanglement-assisted zero-error capacity, resolving an intriguing open problem in the area of zero-error information.