In this talk, I'll motivate studying the complexity of quantum states and transformations. I'll discuss how this general study is related to a seminal theoretical computer science concept: search vs. decision. I'll show how to construct a form of search-to-decision reductions for QMA problems and show why it is unlikely that we can do (much) better. I'll conclude by discussing a parametrized notion of QMA and the notion of QMA solutions in this context.

This talk will be based on a work with Irani, Natarajan, Rao and Yuen (https://arxiv.org/abs/2111.02999) and a work with Arunachalam, Bravyi, and O'Gorman (https://arxiv.org/abs/2202.08119).

Join Zoom Meeting

https://umd.zoom.us/j/96845698894

Meeting ID: 968 4569 8894

One tap mobile

+13017158592,,96845698894# US (Washington DC)

+13126266799,,96845698894# US (Chicago)

Dial by your location

 +1 301 715 8592 US (Washington DC)

 +1 312 626 6799 US (Chicago)

 +1 929 436 2866 US (New York)

 +1 669 900 6833 US (San Jose)

 +1 253 215 8782 US (Tacoma)

 +1 346 248 7799 US (Houston)

Meeting ID: 968 4569 8894