Michal Oszmaniec: Saturation and recurrence of quantum complexity in random quantum circuits

Fermion Sampling - Michal OszmaniecПодробнее

Michał Oszmaniec "Fermion Sampling: a robust quantum computational advantage scheme using FLO..."Подробнее

WQCG XXIX, 31.05.2021, Michał Oszmaniec, "Using fermions to attain quantum computational advantage"Подробнее

Michał Oszmaniec "Fermion Sampling: a robust quantum computational advantage scheme using..."Подробнее

QIP2021 | Epsilon-nets, unitary designs and random quantum circuits (Michal Oszmaniec)Подробнее

PHYSICS 268R: Quantum Phases of Matter: 34. Dualities (contd) oldПодробнее

Beyond classical computing via randomized low‐depth quantum circuitsПодробнее

QGI Virtual Seminar: Nick Hunter-Jones "Models of quantum complexity growth"Подробнее

Noise vs Imprecision in the Hardness of Random Quantum CircuitsПодробнее

Linear growth of the quantum circuit complexity of random quantum circuitsПодробнее

Linear Growth of Quantum Circuit Complexity | Seminar Series with Nicole Yunger HalpernПодробнее