Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a 47-minute lecture on the complexity of implementing Trotter steps in quantum simulation, presented by Yuan Su from Microsoft at IPAM's Quantum Algorithms for Scientific Computation Workshop. Delve into advanced methods for performing faster Trotter steps with sublinear complexity in the number of Hamiltonian terms, focusing on power-law decaying interactions. Discover techniques based on recursive block encoding and average-cost simulation that overcome normalization-factor barriers. Learn about improved gate complexity for simulating uniform electron gas and systems with external nuclear potentials. Examine a circuit lower bound proof for generic n-qubit 2-local Hamiltonians with commuting terms, based on the approximate synthesis of diagonal unitaries. Gain insights into the importance of Hamiltonian structural properties for implementing efficient Trotter steps in quantum algorithms for scientific computation.
