Quantum state discrimination circuits inspired by Deutschian closed timelike curves

Presenting Author: Christopher Vairogs, University of Florida
Contributing Author(s): Vishal Katariya, Mark M. Wilde

The Holevo-Helstrom theorem places a bound on the probability of perfectly distinguishing two non-orthogonal states in a single measurement. However, using quantum states traveling along a Closed Timelike Curve (CTC), one can perfectly distinguish multiple non-orthogonal states and violate the Heisenberg uncertainty principle. A quantum computer can simulate a CTC using a quantum memory, multiple copies of the input state, and multiple iterations of a quantum channel. We determine the probability of correctly distinguishing states with the CTC-inspired scheme and show that this probability converges exponentially to one with respect to the number of iterations. We show how one may achieve practical quantum state discrimination by optimizing this scheme. We then explore applications of this scheme, which may lead to table-top experiments.

(Session 5 : Saturday from 5:00pm - 7:00pm)


SQuInT Chief Organizer
Akimasa Miyake, Associate Professor

SQuInT Co-Organizer
Brian Smith, Associate Professor UO

SQuInT Program Committee
Postdoctoral Fellows:
Markus Allgaier (UO OMQ)
Sayonee Ray (UNM CQuIC)
Pablo Poggi (UNM CQuIC)
Valerian Thiel (UO OMQ)

SQuInT Event Co-Organizers (Oregon)
Jorjie Arden
Holly Lynn

SQuInT Event Administrator (Oregon)
Brandy Todd

SQuInT Administrator (CQuIC)
Gloria Cordova
505 277-1850

SQuInT Founder
Ivan Deutsch, Regents' Professor, CQuIC Director

Tweet About SQuInT 2020!