Рет қаралды 1,972
Episode 162
Classical simulation algorithms of noisy quantum tasks
When do quantum computations become easier to simulate classically, in the presence of a finite level of errors?
In this talk I will discuss recent progress on constructing polynomial-time classical algorithms that simulate the truncated evolution of observables in the Heisenberg picture for noisy quantum circuits. These techniques enable rigorous trade-offs between complexity, average approximation error and physical noise. Harmonic analysis on groups facilitates a unifying framework of operator truncated classical simulations for noisy quantum tasks such as sampling and estimating expectation values. Through this lens, we recover previous results on classical simulability of a series of applications in certain noisy regimes including variational algorithms [1], dynamical simulations [2] and random circuit sampling [3].
[1]arXiv:2306.05400, arXiv:2206.08811, arXiv:2208.05958
[2] arXiv:2308.09109
[3] arXiv:2211.03999
Bio:
Cristina Cirstoiu is a Senior Research Scientist at Quantinuum. Her research spans quantum and classical algorithms, error characterisation and mitigation. Before joining Quantinuum she was a researcher in Computer Science at Oxford University. She obtained a PhD in Physics from Imperial College London on quantum information theory and a B.A/Masters in Mathematics from Cambridge University.