chair: Andreas Kronfeld
Dr Stephen Jordan (NIST / University of Maryland)
9/12/18, 10:35 AM
In this talk I will describe quantum algorithms by which universal fault-tolerant quantum computers can simulate quantum and classical field theories. In the case of quantum field theories the number of quantum degrees of freedom is extensive in the volume of the system to be simulated and the speedup over classical algorithms is exponential. As specific applications we consider phi-fourth...
Joe Carlson (LANL)
9/12/18, 11:15 AM
Dynamics in quantum systems is notoriously difficult to treat. We demonstrate an exponential speed-up for quantum linear response as measured in electron and neutrino scattering. I will discuss some very preliminary work we have done and prospects for further studies using both classical computers to simulate quantum computers and quantum computer applications.
Zhang Jiang (Google, inc)
9/12/18, 11:40 AM
I will briefly introduce the current hardware at Google and their limitations. I will give examples on how to construct quantum circuits to simulate model Hamiltonians, such as the Fermi-Hubbard model and the Sachdev-Ye-Kitaev (SYK) model. Spatially local fermionic problems can become nonlocal after being mapped to qubit Hamiltonians. I will discuss how lattice gauge field theory can be used...
9/12/18, 12:05 PM
At the LHC, theory uncertainties are starting to become the dominant uncertainty for certain processes. One of the limiting factors is the ability to calculate loop diagrams for high number of loops. Here I propose a quantum algorithm that can be used to work towards removing this barrier.