Tensor Network enhanced Dynamic Multiproduct Formulas
ORAL
Abstract
Tensor networks and quantum computation are two of the most powerful tools for the simulation of quantum many-body systems. Rather than viewing them as competing approaches, here we consider how these two methods can work in tandem. We introduce a novel algorithm that combines tensor networks and quantum computation to produce results that are more accurate than what could be achieved by either method used in isolation. Our algorithm is based on multiproduct formulas (MPF) - a technique that linearly combines Trotter product formulas to reduce algorithmic error. Our algorithm uses a quantum computer to calculate the expectation values and tensor networks to calculate the coefficients used in the linear combination. We present a detailed error analysis of the algorithm and demonstrate the full workflow on a one-dimensional quantum simulation problem on 50 qubits using two IBM quantum computers: ibm_torino and ibm_kyiv.
–
Publication: arxiv:2407.17405
Presenters
-
Niall F Robertson
IBM Quantum
Authors
-
Niall F Robertson
IBM Quantum
-
Bibek B Pokharel
IBM Thomas J. Watson Research Center
-
Bryce G Fuller
IBM Thomas J. Watson Research Center, IBM Quantum
-
Eric D Switzer
National Institute of Standards and Technology
-
Oles Shtanko
IBM Quantum
-
Mirko Amico
IBM Thomas J. Watson Research Center
-
Adam Byrne
IBM Quantum
-
Andrea D'Urbano
IBM Quantum
-
Salome Hayes-Shuptar
IBM Quantum
-
Albert Akhriev
IBM Quantum
-
Nathan Keenan
IBM Quantum, IBM Quantum, IBM Research Europe - Dublin
-
Sergey Bravyi
IBM Thomas J. Watson Research Center
-
Sergiy Zhuk
IBM Quantum