QIP2021 | Optimal universal programming of unitary gates (Yuxiang Yang)

(29:9)

QIP2021 | Optimal State Transfer and Entanglement Generation... (Minh Tran)

(29:12)

QIP2021 | Near-optimal ground state preparation (Yu Tong)

(31:19)

QIP2021 | An Optimal Separation of Randomized and Quantum Query Complexity (Pei Wu)

(27:18)

QIP2021 | 3XOR Games with Perfect Commuting Operator Strategies... (Bene Watts)

(30:3)

QIP2021 | Nearly tight Trotterization of interacting electrons (Yuan Su)

(28:57)

QIP2021 | Subsystem codes with high thresholds (Oscar Higgott)

(28:27)

QIP2021 | Compilation of Fault-Tolerant Q-Heuristics for Combinatorial Optimization (Yuval Sanders)

(26:45)

QIP2021 | Fiber Bundle Codes: Breaking the N^{1/2} polylog(N) Barrier... (Matthew Hastings)

(59:40)

QIP2021 No quantum speedup over gradient descent for non-smooth convex optimization (Suhail Sherif)

(29:4)

QIP2021 | The Quantum Approximate Optimization Algorithm (Leo Zhou)

(27:58)

QIP2021 | Challenges and Directions of Quantum Information Technology (Jay Gambetta)

(59:31)

QIP2021 | (Sub)Exponential advantage of adiabatic quantum computation... (András Gilyén)

(32:57)

QIP2021 | The quantum Wasserstein distance of order 1 (Giacomo De Palma)

(28:10)

QIP2021 | Quantum Computer Science at Google (Cody Jones \u0026 Ryan Babbush)

(45:30)

QIP2021 | Limitations of the Macaulay matrix approach for using the HHL algorithm... (Jianqiang Li)

(28:20)

QIP2021 | The cost of universality: A comparative study of the overhead of... (Michael Beverland)

(30:29)

QIP2021 | Epsilon-nets, unitary designs and random quantum circuits (Michal Oszmaniec)

(29:2)

QIP2021 | k-Forrelation Optimally Separates Quantum and Classical Query Complexity (Makrand Sinha)

(26:45)