QIP2023 | Mean estimation when you have the source code; or, quantum Monte Carlo methods (R.Kothari)

preview_player
Показать описание
Robin Kothari and Ryan O'Donnell.
  1. QIP2023
  2. #qip2023
Рекомендации по теме
QIP2023 | Mean 0:24:44

QIP2023 | Mean estimation when you have the source code; or, quantum Monte Carlo methods (R.Kothari)

QIP2023 | Quantum 0:26:15

QIP2023 | Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Norm. Constants

Quantum Monte Carlo: 0:56:34

Quantum Monte Carlo: Mean Estimation when you have the source code

QIP2023 | Quantum 0:27:54

QIP2023 | Quantum Worst-Case to Average-Case Reductions for All Linear Problems (Vahid Asadi)

QIP2023 | Improved 0:25:34

QIP2023 | Improved Hardness Results for the Guided Local Hamiltonian Problem (Weggemans + Getachew)

QIP2023 | Limitations 0:25:05

QIP2023 | Limitations of VQAs: a quantum optimal transport approach (Daniel Stilck França)

QIP2023 | Solving 0:25:14

QIP2023 | Solving boolean satisfiability problems with the quantum approx. optimization algorithm

QIP2023 | Tighter 0:24:37

QIP2023 | Tighter bounds on error mitigation: hardness at log log (n) depth (Yihui Quek)

QIP2023 | Complete 0:25:26

QIP2023 | Complete order implies tight relative entropy decay rate (Haojian Li)

QIP2023 | Exact 0:26:01

QIP2023 | Exact solution for the quantum and private capacities of bosonic dephasing channels (Lami)

QIP2023 | Testing 0:25:34

QIP2023 | Testing and Learning Quantum Juntas Nearly Optimally (Thomas Chen)

QIP2023 | Achieving 0:27:09

QIP2023 | Achieving a super-Grover quantum speedup by jumping to the end (Alexander Dalzell)

QIP2023 | Learning 0:25:31

QIP2023 | Learning to predict arbitrary quantum processes (Hsin-Yuan Huang)

QIP2023 | Sparse 0:29:48

QIP2023 | Sparse random Hamiltonians are quantumly easy (Chi-Fang Chen)

QIP2023 | Learning 0:27:59

QIP2023 | Learning many-body Hamiltonians with Heisenberg-limited scaling (Hsin-Yuan Huang)

QIP2023 | Quantum 1:15:29

QIP2023 | Quantum advantage - part 1 (Bill Fefferman)

QIP2023 | A 0:24:52

QIP2023 | A Sublinear-Time Quantum Algorithm for Approximating Partition Functions (Yassine Hamoudi)

QIP2023 | Subpol-time 0:25:03

QIP2023 | Subpol-time algorithm for the free energy of 1D quantum systems in the thermodynamic limit

QIP2023 | Classical 0:24:13

QIP2023 | Classical shadows of fermions with particle number symmetry (Guang Hao Low)

QIP2023 | Optimal 0:21:05

QIP2023 | Optimal light cone and digital quantum simulation of interacting bosons (T. Kuwahara)

QIP2023 | General 0:25:57

QIP2023 | General guarantees for randomized benchmarking with random quantum circuits

QIP2023 | Multidimensional 0:25:22

QIP2023 | Multidimensional Quantum Walks, with Application to k-Distinctness (Sebastian Zur)

QIP2023 | Quantifying 0:24:43

QIP2023 | Quantifying Quantum Advantage in Topological Data Analysis (Vedran Dunjko)

QIP2023 | Optimal 0:21:48

QIP2023 | Optimal Second-Order Rates for Quantum Information Decoupling (Yu-Chen Shen, Li Gao)