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.
Tensor Network Enhanced Dynamic Multiproduct Formulas
Andrea D'Urbano;
2025-01-01
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 (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.| File | Dimensione | Formato | |
|---|---|---|---|
|
Tensor_network_paper.pdf
accesso aperto
Descrizione: Articolo
Tipologia:
Versione editoriale
Licenza:
Creative commons
Dimensione
2.11 MB
Formato
Adobe PDF
|
2.11 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


