arXiv subjects

Sarah Brandsen

Publications and source records attributed to Sarah Brandsen.

11 recordsLinked to original sources

arXiv2024

Inevitability of knowing less than nothing

A colloquial interpretation of entropy is that it is the knowledge gained upon learning the outcome of a random experiment. Conditional entropy is then interpreted as the knowledge gained upon learning the outcome of one random experiment after learning the outcome of another, possibly statistically dependent, random experiment. In the classical world, entropy and conditional entropy take only non-negative values, consistent with the intuition that one has regarding the aforementioned interpretations. However, for certain entangled states, one obtains negative values when evaluating commonly accepted and information-theoretically justified formulas for the quantum conditional entropy, leading to the confounding conclusion that one can know less than nothing in the quantum world. Here, we introduce a physically motivated framework for defining quantum conditional entropy, based on two simple postulates inspired by the second law of thermodynamics (non-decrease of entropy) and extensivity of entropy, and we argue that all plausible definitions of quantum conditional entropy should respect these two postulates. We then prove that all plausible quantum conditional entropies take on negative values for certain entangled states, so that it is inevitable that one can know less than nothing in the quantum world. All of our arguments are based on constructions of physical processes that respect the first postulate, the one inspired by the second law of thermodynamics.

quant-ph↗

arXiv2022

Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing

Reinforcement learning with neural networks (RLNN) has recently demonstrated great promise for many problems, including some problems in quantum information theory. In this work, we apply RLNN to quantum hypothesis testing and determine the optimal measurement strategy for distinguishing between multiple quantum states $\{ ρ_{j} \}$ while minimizing the error probability. In the case where the candidate states correspond to a quantum system with many qubit subsystems, implementing the optimal measurement on the entire system is experimentally infeasible. We use RLNN to find locally-adaptive measurement strategies that are experimentally feasible, where only one quantum subsystem is measured in each round. We provide numerical results which demonstrate that RLNN successfully finds the optimal local approach, even for candidate states up to 20 subsystems. We additionally demonstrate that the RLNN strategy meets or exceeds the success probability for a modified locally greedy approach in each random trial. While the use of RLNN is highly successful for designing adaptive local measurement strategies, in general a significant gap can exist between the success probability of the optimal locally-adaptive measurement strategy and the optimal collective measurement. We build on previous work to provide a set of necessary and sufficient conditions for collective protocols to strictly outperform locally adaptive protocols. We also provide a new example which, to our knowledge, is the simplest known state set exhibiting a significant gap between local and collective protocols. This result raises interesting new questions about the gap between theoretically optimal measurement strategies and practically implementable measurement strategies.

quant-ph↗

arXiv2021

Quantum conditional entropy from information-theoretic principles

We introduce an axiomatic approach for characterizing quantum conditional entropy. Our approach relies on two physically motivated axioms: monotonicity under conditional majorization and additivity. We show that these two axioms provide sufficient structure that enable us to derive several key properties applicable to all quantum conditional entropies studied in the literature. Specifically, we prove that any quantum conditional entropy must be negative on certain entangled states and must equal -log(d) on dxd maximally entangled states. We also prove the non-negativity of conditional entropy on separable states, and we provide a generic definition for the dual of a quantum conditional entropy. Finally, we develop an operational approach for characterizing quantum conditional entropy via games of chance, and we show that, for the classical case, this complementary approach yields the same ordering as the axiomatic approach.

quant-ph↗

arXiv2021

Explicit construction of optimal witnesses for input-output correlations attainable by quantum channels

Given a quantum channel -- that is, a completely positive trace-preserving linear map -- as the only communication resource available between two parties, we consider the problem of characterizing the set of classical noisy channels that can be obtained from it by means of suitable classical-quantum encodings and quantum-classical decodings, respectively, on the sender's and the receiver's side. We consider various classes of linear witnesses and compute their optimum values in closed form for several classes of quantum channels. The witnesses that we consider here are formulated as communication games, in which Alice's aim is to exploit a single use of a given quantum channel to help Bob guess some information she has received from an external referee.

quant-ph↗

arXiv2021

What is Entropy? A new perspective from games of chance

Given entropy's central role in multiple areas of physics and science, one important task is to develop a systematic and unifying approach to defining entropy. Games of chance become a natural candidate for characterising the uncertainty of a physical system, as a system's performance in gambling games depends solely on the uncertainty of its output. In this work, we construct families of games which induce pre-orders corresponding to majorization, conditional majorization, and channel majorization. Finally, we provide operational interpretations for all pre-orders, show the relevance of these results to dynamical resource theories, and find the only asymptotically continuous classical dynamic entropy.

quant-ph↗

arXiv2019

Adaptive Procedures for Discrimination Between Arbitrary Tensor-Product Quantum States

Discrimination between quantum states is a fundamental task in quantum information theory. Given two arbitrary tensor-product quantum states (TPQS) $ρ_{\pm} = ρ_{\pm}^{(1)} \otimes \cdots \otimes ρ_{\pm}^{(N)}$, determining the joint $N$-system measurement to optimally distinguish between the two states is a hard problem. Thus, there is great interest in identifying local measurement schemes that are optimal or close-to-optimal. In this work, we focus on distinguishing between two general TPQS. We begin by generalizing previous work by Acin et al. (Phys. Rev. A 71, 032338) to show that a locally greedy (LG) scheme using Bayesian updating can optimally distinguish between two states that can be written as tensor products of arbitrary pure states. Then, we show that even in the limit of large $N$ the same algorithm cannot distinguish tensor products of mixed states with vanishing error probability. This poor asymptotic behavior occurs because the Helstrom measurement becomes trivial for sufficiently biased priors. Based on this, we introduce a modified locally greedy (MLG) scheme with strictly better performance. In the second part of this work, we compare these simple local schemes with a general dynamic programming (DP) approach that finds the optimal series of local measurements to distinguish the two states. When the subsystems are non-identical, we demonstrate that the ordering of the systems affects performance and we extend the DP technique to determine the optimal ordering adaptively. Finally, in contrast to the binary optimal collective measurement, we show that adaptive protocols on sufficiently large (e.g., qutrit) subsystems must contain non-binary measurements to be optimal. (The code that produced the simulation results in this paper can be found at: https://github.com/SarahBrandsen/AdaptiveStateDiscrimination)

quant-ph↗

arXiv2018

No-hypersignaling principle

A paramount topic in quantum foundations, rooted in the study of the EPR paradox and Bell inequalities, is that of characterizing quantum theory in terms of the space-like correlations it allows. Here we show that to focus only on space-like correlations is not enough: we explicitly construct a toy model theory that, while not contradicting classical and quantum theories at the level of space-like correlations, still displays an anomalous behavior in its time-like correlations. We call this anomaly, quantified in terms of a specific communication game, the "hypersignaling" phenomena. We hence conclude that the "principle of quantumness," if it exists, cannot be found in space-like correlations alone: nontrivial constraints need to be imposed also on time-like correlations, in order to exclude hypersignaling theories.

quant-ph↗

arXiv2017

Device-independent tests of quantum measurements

We consider the problem of characterizing the set of input-output correlations that can be generated by an arbitrarily given quantum measurement. Our main result is to provide a closed-form, full characterization of such a set for any qubit measurement, and to discuss its geometrical interpretation. As applications, we further specify our results to the cases of real and complex symmetric, informationally complete measurements and mutually unbiased bases of a qubit, in the presence of isotropic noise. Our results provide the optimal device-independent tests of quantum measurements.

quant-ph↗

arXiv2017

Device-independent tests of quantum channels

We develop a device-independent framework for testing quantum channels. That is, we falsify a hypothesis about a quantum channel based only on an observed set of input-output correlations. Formally, the problem consists of characterizing the set of input-output correlations compatible with any arbitrary given quantum channel. For binary (i.e., two input symbols, two output symbols) correlations, we show that extremal correlations are always achieved by orthogonal encodings and measurements, irrespective of whether or not the channel preserves commutativity. We further provide a full, closed-form characterization of the sets of binary correlations in the case of: i) any dihedrally-covariant qubit channel (such as any Pauli and amplitude-damping channels), and ii) any universally-covariant commutativity-preserving channel in an arbitrary dimension (such as any erasure, depolarizing, universal cloning, and universal transposition channels).

quant-ph↗

arXiv2016

Communication capacity of mixed quantum t designs

We operationally introduce mixed quantum t-designs as the most general arbitrary-rank extension of projective quantum t-designs which preserves indistinguishability from the uniform distribution for t copies. First, we derive upper bounds on the classical communication capacity of any mixed t-design measurement for t in [1,5]. Second, we explicitly compute the classical communication capacity of several mixed t-design measurements, including the depolarized version of any qubit and qutrit symmetric, informationally complete (SIC) measurement and complete mutually unbiased bases, the qubit icosahedral measurement, the Hoggar SIC measurement, any anti-SIC (where each element is proportional to the projector on the subspace orthogonal to one of the elements of the original SIC), and the uniform distribution over pure effects.

quant-ph↗

arXiv2016

Device independent witnessing of unknown quantum channels

Quantum process tomography, the standard procedure to characterize any quantum channel in nature, is affected by a circular argument: in order to characterize the channel, the tomographic preparation and measurement need in turn to be already characterized. We break this loop by designing an operational framework able to optimally characterize any given unknown quantum channel in a device-independent fashion, namely, by only looking at its input-output statistics, under the sole assumption that quantum theory is valid. We provide explicit solutions, in closed form, for practically relevant cases such as the erasure, depolarizing, and amplitude-damping channels.

quant-ph↗