Unitary Complexity and the Uhlmann Transformation Problem

Speaker: Alexandar Poremba , MIT

Date: Friday, November 10, 2023

Time: 12:00 PM to 1:00 PM Note: all times are in the Eastern Time Zone

Public: Yes

Location: G-882, Hewlett Room

Event Type: Seminar

Room Description:

Host: Vinod Vaikuntanathan , CSAIL MIT

Contact:

Relevant URL:

Speaker URL: None

Speaker Photo:
None

Reminders to: seminars@csail.mit.edu, cis-seminars@csail.mit.edu

Reminder Subject: TALK: Unitary Complexity and the Uhlmann Transformation Problem

State transformation problems such decoding noisy quantum channels or breaking quantum commitments are fundamental quantum tasks. However, their computational difficulty cannot easily be characterized using traditional complexity theory, which focuses on tasks with classical inputs and outputs. In this talk, I will discuss how the ``Uhlmann Transformation Problem’’, an algorithmic version of Uhlmann’s theorem, serves as a useful framework to study the complexity of state transformation tasks. I will mainly focus on cryptographic applications of the Uhlmann Transformation Problem, such as the task of breaking quantum commitment schemes and one-way state generators, and even falsifiable quantum cryptographic assumptions more generally.

No quantum background required. This talk is based on recent joint work with John Bostanci, Yuval Efron, Tony Metger, Luowen Qian and Henry Yuen:
https://arxiv.org/abs/2306.13073

Research Areas:

Impact Areas:

See other events that are part of the CSAIL Security Seminar Series 2023 - 2024.

Created by Felicia Raton at Tuesday, November 07, 2023 at 8:58 AM.