log in  |  register  |  feedback?  |  help  |  web accessibility
Logo
On the optimal error exponents for classical and quantum antidistinguishability
Hemant Mishra - Cornell University
Wednesday, April 24, 2024, 2:15-3:15 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract

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 psi-epistemic ontological models of quantum mechanics [Pusey et al., 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 work, 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.

This work is done in collaboration with Prof. Michael Nussbaum and Prof. Mark M. Wilde. A preprint of the work is available at https://arxiv.org/abs/2309.03723.

*We strongly encourage attendees to use their full name (and if possible, their UMD credentials) to join the zoom session.*

Join Zoom Meeting

https://umd.zoom.us/j/5972416689?omn=92004592340

Meeting ID: 597 241 6689

---

One tap mobile

+13017158592,,5972416689# US (Washington DC)

+13092053325,,5972416689# US

---

Dial by your location

• +1 301 715 8592 US (Washington DC)

• +1 309 205 3325 US

• +1 312 626 6799 US (Chicago)

• +1 646 931 3860 US

• +1 929 436 2866 US (New York)

• +1 305 224 1968 US

• +1 360 209 5623 US

• +1 386 347 5053 US

• +1 507 473 4847 US

• +1 564 217 2000 US

• +1 669 444 9171 US

• +1 669 900 6833 US (San Jose)

• +1 689 278 1000 US

• +1 719 359 4580 US

• +1 253 205 0468 US

• +1 253 215 8782 US (Tacoma)

• +1 346 248 7799 US (Houston)

Meeting ID: 597 241 6689

Find your local number: https://umd.zoom.us/u/ado7lbZvUj

---

Join by SIP

• 5972416689@zoomcrc.com

---

Join by H.323

• 162.255.37.11 (US West)

• 162.255.36.11 (US East)

• 115.114.131.7 (India Mumbai)

• 115.114.115.7 (India Hyderabad)

• 213.19.144.110 (Amsterdam Netherlands)

• 213.244.140.110 (Germany)

• 103.122.166.55 (Australia Sydney)

• 103.122.167.55 (Australia Melbourne)

• 149.137.40.110 (Singapore)

• 64.211.144.160 (Brazil)

• 149.137.68.253 (Mexico)

• 69.174.57.160 (Canada Toronto)

• 65.39.152.160 (Canada Vancouver)

• 207.226.132.110 (Japan Tokyo)

• 149.137.24.110 (Japan Osaka)

Meeting ID: 597 241 6689

This talk is organized by Andrea F. Svejda