|Name||Quantum Information and Quantum Computing working group|
|Title||Models of quantum complexity growth|
The quantum complexity of a unitary or state is defined as the size of the shortest quantum computation that implements the unitary or prepares the state. The notion has far-reaching implications spanning computer science, quantum many-body physics, and high energy theory. Complexity growth in time is a phenomenon expected to occur in holographic theories and strongly-interacting many-body systems more generally, but deriving lower bounds on the complexity of a state or unitary is notoriously difficult. By establishing a rigorous relation between quantum complexity and unitary designs, ensembles which emulate fully Haar random unitaries, we will prove statements about complexity growth in various models. Specifically, we prove a linear growth of complexity in random quantum circuits, using a recent result about their design growth.
Zoom meeting details
Topic: Quantum Information and Quantum Computing Working Group
Time: Apr 16, 2020, 04:00 PM Warsaw
If you encounter any problems with connecting to the Zoom meeting, please email email@example.com directly.
|Time||Thursday, 16 April 2020, at 16:00 CEST The seminar was held!|
Dr Nick Hunter-Jones (Perimeter Institute)
|Organisers||Michał Oszmaniec; Filip Maciejewski;|