An efficient quantum circuit for block encoding a pairing Hamiltonian

We present an efficient quantum circuit for block encoding a pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and representing the Hamiltonian as a linear combination of unitaries. Instead, we show how to encode the Hamiltonian directly using controlled swap operations. We analyze the gate complexity of the block encoding circuit and show that it scales polynomially with respect to the number of qubits required to represent a quantum state associated with the pairing Hamiltonian. We also show how the block encoding circuit can be combined with the quantum singular value transformation to construct an efficient quantum circuit for approximating the density of states of a pairing Hamiltonian. The techniques presented can be extended to encode more general second-quantized Hamiltonians.

Authors

Institutions

Publication Details

Journal
Journal of Computational Science
Published
2024-11-26
DOI
https://doi.org/10.1016/j.jocs.2024.102480
Citations
6
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.08

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An efficient quantum circuit for block encoding a pairing Hamiltonian

Weijie Du, James P. Vary, Yang Chao, Diyi Liu et al.
6 citations
Journal of Computational Science
Quantum Computing Algorithms and Architecture
2.08
article

An efficient quantum circuit for block encoding a pairing Hamiltonian

Weijie Du, James P. Vary, Yang Chao, Diyi Liu, Lin Lin
article en
6 citations

Abstract

We present an efficient quantum circuit for block encoding a pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and representing the Hamiltonian as a linear combination of unitaries. Instead, we show how to encode the Hamiltonian directly using controlled swap operations. We analyze the gate complexity of the block encoding circuit and show that it scales polynomially with respect to the number of qubits required to represent a quantum state associated with the pairing Hamiltonian. We also show how the block encoding circuit can be combined with the quantum singular value transformation to construct an efficient quantum circuit for approximating the density of states of a pairing Hamiltonian. The techniques presented can be extended to encode more general second-quantized Hamiltonians.

Journal of Computational ScienceVol. 85
Lawrence Berkeley National Laboratory (US), Iowa State University (US), Twin Cities Orthopedics (US), University of California, Berkeley (US)
National Science Foundation, U.S. Department of Energy, Advanced Scientific Computing Research, Nuclear Physics, Lawrence Berkeley National Laboratory
Affordable and clean energy
Openalex Percentile: Top 11%
Quantum Computing Algorithms and Architecture
2.08
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.

An efficient quantum circuit for block encoding a pairing Hamiltonian — Weijie Du, James P. Vary, et al. · Journal of Computational Science (2024) | TGRS Research Map | TGRS