JQI-QuICS-CMTC Seminar

Date
Fri, Apr 26, 2019 12:00 pm - 12:40 pm
Location
PSC 2136

Description

Title: Nearly optimal lattice simulation by product formulas

Speaker: Yuan Su, QuICS

Abstract: Product formulas (aka Trotterization) provide a straightforward yet surprisingly efficient approach to quantum simulation. We show that this algorithm can simulate an $n$-qubit Hamiltonian with nearest-neighbor interactions evolving for time $t$ using only $(nt)^{1+o(1)}$ gates. While it is reasonable to expect this complexity---in particular, this was claimed without rigorous justification by Jordan, Lee, and Preskill---we are not aware of a straightforward proof. Our approach is based on an analysis of the local error structure of product formulas, as introduced by Descombes and Thalhammer and significantly simplified here. We prove error bounds for canonical product formulas, which include well-known constructions such as the Lie-Trotter-Suzuki formulas. We also develop a local error representation for time-dependent Hamiltonian simulation, and we discuss generalizations to periodic boundary conditions, constant-range interactions, and higher dimensions. Combined with a previous lower bound, our result implies that product formulas can simulate lattice Hamiltonians with nearly optimal gate complexity.

Notes: Lunch served at 12:00 pm, talk at 12:10 pm.

Upcoming Events

20 May
CMTC Spring Symposium
Mon, May 20, 2019 11:00 am - 4:15 pm
21 May
CMTC Spring Symposium
Tue, May 21, 2019 11:00 am - 4:15 pm
21 May
Physics Colloquium
Tue, May 21, 2019 4:00 pm - 5:00 pm
22 May
PChem/ANE/ChemPhys Seminar
Wed, May 22, 2019 11:00 am - 12:00 pm
22 May
CMTC Spring Symposium
Wed, May 22, 2019 11:00 am - 3:30 pm