Diagrammatic Quantum Circuit Compression for Hamiltonian Simulation

One of the promising applications for early quantum computers is the simulation of of dynamical quantum systems. Due to the limited coherence time of such devices, the depth-compression of quantum circuits is crucial to facilitate useful results. It has been shown that certain quantum models can even be compressed to constant depth, meaning it is only linearly dependent on the number of qubits, but independent of the simulation time and the number of Trotter steps. This has been done by extracting the circuit structure derived from the model characteristics via Hamiltonian simulation. Based on these results, we present a diagrammatic approach to circuit compression utilizing a powerful technique for reasoning about quantum circuits called ZX-calculus. We demonstrate our approach by deriving constant-depth circuit compressions for quantum models known to be constant-depth, as well as novel models previously unstudied. Our method could serve as a first step toward the development of more advanced circuit compression methods, that could be employed to enable Hamiltonian simulation of a larger variety of quantum models, and beyond.

Publication Details

Journal
Gesellschaft für Informatik (GI)
Published
2025-01-01
DOI
https://doi.org/10.18420/se2025-ws-24
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Diagrammatic Quantum Circuit Compression for Hamiltonian Simulation

Gesellschaft für Informatik (GI)
Quantum Computing Algorithms and Architecture
article

Diagrammatic Quantum Circuit Compression for Hamiltonian Simulation

article en

Abstract

One of the promising applications for early quantum computers is the simulation of of dynamical quantum systems. Due to the limited coherence time of such devices, the depth-compression of quantum circuits is crucial to facilitate useful results. It has been shown that certain quantum models can even be compressed to constant depth, meaning it is only linearly dependent on the number of qubits, but independent of the simulation time and the number of Trotter steps. This has been done by extracting the circuit structure derived from the model characteristics via Hamiltonian simulation. Based on these results, we present a diagrammatic approach to circuit compression utilizing a powerful technique for reasoning about quantum circuits called ZX-calculus. We demonstrate our approach by deriving constant-depth circuit compressions for quantum models known to be constant-depth, as well as novel models previously unstudied. Our method could serve as a first step toward the development of more advanced circuit compression methods, that could be employed to enable Hamiltonian simulation of a larger variety of quantum models, and beyond.

Gesellschaft für Informatik (GI)
Openalex Percentile: Top 74%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Diagrammatic Quantum Circuit Compression for Hamiltonian Simulation · Gesellschaft für Informatik (GI) (2025) | TGRS Research Map | TGRS