Details
| Titel in Übersetzung | Tensorierter Paulizerlegungsalgorithmus |
|---|---|
| Originalsprache | Englisch |
| Aufsatznummer | 085128 |
| Fachzeitschrift | Physica scripta |
| Jahrgang | 99 |
| Ausgabenummer | 8 |
| Frühes Online-Datum | 17 Juli 2024 |
| Publikationsstatus | Veröffentlicht - 26 Juli 2024 |
Abstract
This paper introduces a novel general-purpose algorithm for Pauli decomposition that employs matrix slicing and addition rather than expensive matrix multiplication, significantly accelerating the decomposition of multi-qubit matrices. In a detailed complexity analysis, we show that the algorithm admits the best known worst-case scaling and more favorable runtimes for many practical examples. Numerical experiments are provided to validate the asymptotic speed-up already for small instance sizes, underscoring the algorithm’s potential significance in the realm of quantum computing and quantum chemistry simulations.
Schlagwörter
- Paulizerlegung, Quantensimulation, Quantenchemie
ASJC Scopus Sachgebiete
- Physik und Astronomie (insg.)
- Physik der kondensierten Materie
- Physik und Astronomie (insg.)
- Atom- und Molekularphysik sowie Optik
- Mathematik (insg.)
- Mathematische Physik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Physica scripta, Jahrgang 99, Nr. 8, 085128, 26.07.2024.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Tensorized Pauli decomposition algorithm
AU - Hantzko, Lukas
AU - Binkowski, Lennart
AU - Gupta, Sabhyata
N1 - Publisher Copyright: © 2024 The Author(s). Published by IOP Publishing Ltd
PY - 2024/7/26
Y1 - 2024/7/26
N2 - This paper introduces a novel general-purpose algorithm for Pauli decomposition that employs matrix slicing and addition rather than expensive matrix multiplication, significantly accelerating the decomposition of multi-qubit matrices. In a detailed complexity analysis, we show that the algorithm admits the best known worst-case scaling and more favorable runtimes for many practical examples. Numerical experiments are provided to validate the asymptotic speed-up already for small instance sizes, underscoring the algorithm’s potential significance in the realm of quantum computing and quantum chemistry simulations.
AB - This paper introduces a novel general-purpose algorithm for Pauli decomposition that employs matrix slicing and addition rather than expensive matrix multiplication, significantly accelerating the decomposition of multi-qubit matrices. In a detailed complexity analysis, we show that the algorithm admits the best known worst-case scaling and more favorable runtimes for many practical examples. Numerical experiments are provided to validate the asymptotic speed-up already for small instance sizes, underscoring the algorithm’s potential significance in the realm of quantum computing and quantum chemistry simulations.
KW - Paulizerlegung
KW - Quantensimulation
KW - Quantenchemie
KW - Pauli decomposition
KW - quantum simulation
KW - quantum chemistry
KW - complexity analysis
UR - http://www.scopus.com/inward/record.url?scp=85199718381&partnerID=8YFLogxK
U2 - 10.1088/1402-4896/ad6499
DO - 10.1088/1402-4896/ad6499
M3 - Article
VL - 99
JO - Physica scripta
JF - Physica scripta
SN - 0031-8949
IS - 8
M1 - 085128
ER -