This content will become publicly available on June 5, 2025
- Award ID(s):
- 2304816
- PAR ID:
- 10534599
- Publisher / Repository:
- Springer
- Date Published:
- Journal Name:
- Letters in mathematical physics
- ISSN:
- 1573-0530
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
The concept of antidistinguishability of quantum states has been studied to investigate foundational questions in quantum mechanics. It is also called quantum state elimination, because the goal of such a protocol is to guess which state, among finitely many chosen at random, the system is not prepared in (that is, it can be thought of as the first step in a process of elimination). Antidistinguishability has been used to investigate the reality of quantum states, ruling out ψ-epistemic ontological models of quantum mechanics (Pusey et al. in Nat Phys 8(6):475–478, 2012). Thus, due to the established importance of antidistinguishability in quantum mechanics, exploring it further is warranted. In this paper, we provide a comprehensive study of the optimal error exponent—the rate at which the optimal error probability vanishes to zero asymptotically—for classical and quantum antidistinguishability. We derive an exact expression for the optimal error exponent in the classical case and show that it is given by the multivariate classical Chernoff divergence. Our work thus provides this divergence with a meaningful operational interpretation as the optimal error exponent for antidistinguishing a set of probability measures. For the quantum case, we provide several bounds on the optimal error exponent: a lower bound given by the best pairwise Chernoff divergence of the states, a single-letter semi-definite programming upper bound, and lower and upper bounds in terms of minimal and maximal multivariate quantum Chernoff divergences. It remains an open problem to obtain an explicit expression for the optimal error exponent for quantum antidistinguishability.more » « less
-
Abstract We develop a resource theory of symmetric distinguishability, the fundamental objects of which are elementary quantum information sources, i.e. sources that emit one of two possible quantum states with given prior probabilities. Such a source can be represented by a classical-quantum state of a composite system XA , corresponding to an ensemble of two quantum states, with X being classical and A being quantum. We study the resource theory for two different classes of free operations: (i) CPTP A , which consists of quantum channels acting only on A , and (ii) conditional doubly stochastic maps acting on XA . We introduce the notion of symmetric distinguishability of an elementary source and prove that it is a monotone under both these classes of free operations. We study the tasks of distillation and dilution of symmetric distinguishability, both in the one-shot and asymptotic regimes. We prove that in the asymptotic regime, the optimal rate of converting one elementary source to another is equal to the ratio of their quantum Chernoff divergences, under both these classes of free operations. This imparts a new operational interpretation to the quantum Chernoff divergence. We also obtain interesting operational interpretations of the Thompson metric, in the context of the dilution of symmetric distinguishability.more » « less
-
Abstract Quantum state discrimination is a central problem in quantum measurement theory, with applications spanning from quantum communication to computation. Typical measurement paradigms for state discrimination involve a minimum probability of error or unambiguous discrimination with a minimum probability of inconclusive results. Alternatively, an optimal inconclusive measurement, a non-projective measurement, achieves minimal error for a given inconclusive probability. This more general measurement encompasses the standard measurement paradigms for state discrimination and provides a much more powerful tool for quantum information and communication. Here, we experimentally demonstrate the optimal inconclusive measurement for the discrimination of binary coherent states using linear optics and single-photon detection. Our demonstration uses coherent displacement operations based on interference, single-photon detection, and fast feedback to prepare the optimal feedback policy for the optimal non-projective quantum measurement with high fidelity. This generalized measurement allows us to transition among standard measurement paradigms in an optimal way from minimum error to unambiguous measurements for binary coherent states. As a particular case, we use this general measurement to implement the optimal minimum error measurement for phase-coherent states, which is the optimal modulation for communications under the average power constraint. Moreover, we propose a hybrid measurement that leverages the binary optimal inconclusive measurement in conjunction with sequential, unambiguous state elimination to realize higher dimensional inconclusive measurements of coherent states.
-
In this paper, we are interested in the performance of a variable-length stop-feedback (VLSF) code with m optimal decoding times for the binary-input additive white Gaussian noise channel. We first develop tight approximations to the tail probability of length-n cumulative information density. Building on the work of Yavas et al., for a given information density threshold, we formulate the integer program of minimizing the upper bound on average blocklength over all decoding times subject to the average error probability, minimum gap and integer constraints. Eventually, minimization of locally optimal upper bounds over all thresholds yields the globally minimum upper bound and the above method is called the two-step minimization. Relaxing to allow positive real-valued decoding times activates the gap constraint. We develop gap-constrained sequential differential optimization (SDO) procedure to find the optimal, gap-constrained, real-valued decoding times. In the error regime of practical interest, Polyanskiy's scheme of stopping at zero does not help. In this region, the achievability bounds estimated by the two-step minimization and gap-constrained SDO show that Polyanskiy’s achievability bound for VLSF codes can be approached with a small number of decoding times.more » « less
-
Fawzi, Omar ; Walter, Michael (Ed.)The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically lifts to a quantum communication lower bound for a related function. We introduce a framework for proving approximate degree lower bounds for certain oracle identification problems, where the goal is to recover a hidden binary string x ∈ {0, 1}ⁿ given possibly non-standard oracle access to it. Our lower bounds apply to decision versions of these problems, where the goal is to compute the parity of x. We apply our framework to the ordered search and hidden string problems, proving nearly tight approximate degree lower bounds of Ω(n/log² n) for each. These lower bounds generalize to the weakly unbounded error setting, giving a new quantum query lower bound for the hidden string problem in this regime. Our lower bounds are driven by randomized communication upper bounds for the greater-than and equality functions.more » « less