Tensor Network Enhanced Dynamic Multiproduct Formulas

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 qu...

Full description

Saved in:
Bibliographic Details
Main Authors: Niall F. Robertson, Bibek Pokharel, Bryce Fuller, Eric Switzer, Oles Shtanko, Mirko Amico, Adam Byrne, Andrea D’Urbano, Salome Hayes-Shuptar, Albert Akhriev, Nathan Keenan, Sergey Bravyi, Sergiy Zhuk
Format: Article
Language:English
Published: American Physical Society 2025-06-01
Series:PRX Quantum
Online Access:http://doi.org/10.1103/8bzc-dlgt
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 (MPFs)—a technique that linearly combines Trotter product formulas to reduce algorithmic error. It 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.
ISSN:2691-3399