Quantum circuit complexity lower bounds
Masterarbeit
Im Rahmen des Projekts Information Measures

Description

Quantum circuit complexity asks how many elementary gates are needed to implement a given unitary, and it is notoriously hard to determine exactly. A more tractable approach is to derive lower bounds. Building on arXiv:2204.12051, which provides such bounds via resource measures, this project (i) relates the resource measures used there to more conventional resource quantifiers, and (ii) explores how other resource theories are related to quantum circuit complexity.

Requirements

Linear algebra, analysis

Contact person: Oxana Shaya