Weyl's relations, integrable matrix models, and quantum computation

Starting from a generalization of Weyl's relations in finite dimension $N$, we show that the Heisenberg commutation relations can be satisfied in a specific $N-1$ dimensional subspace, and display a linear map for projecting operators to this subspace. This setup is used to construct a hierarchy of parameter-dependent commuting matrices in $N$ dimensions. This family of commuting matrices is then related to Type-1 matrices representing quantum integrable models. The commuting matrices find an interesting application in quantum computation, specifically in Grover's database search problem. Each member of the hierarchy serves as a candidate Hamiltonian for quantum adiabatic evolution and, in some cases, achieves higher fidelity than standard choices -- thus offering improved performance.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2026-02-12
DOI
https://doi.org/10.1103/vvky-3ghn
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

Weyl's relations, integrable matrix models, and quantum computation

Aniket Patra, Emil A. Yuzbashyan, B. Sriram Shastry
Physical review. A/Physical review, A
Quantum Computing Algorithms and Architecture
article

Weyl's relations, integrable matrix models, and quantum computation

Aniket Patra, Emil A. Yuzbashyan, B. Sriram Shastry
article en

Abstract

Starting from a generalization of Weyl's relations in finite dimension $N$, we show that the Heisenberg commutation relations can be satisfied in a specific $N-1$ dimensional subspace, and display a linear map for projecting operators to this subspace. This setup is used to construct a hierarchy of parameter-dependent commuting matrices in $N$ dimensions. This family of commuting matrices is then related to Type-1 matrices representing quantum integrable models. The commuting matrices find an interesting application in quantum computation, specifically in Grover's database search problem. Each member of the hierarchy serves as a candidate Hamiltonian for quantum adiabatic evolution and, in some cases, achieves higher fidelity than standard choices -- thus offering improved performance.

Physical review. A/Physical review, AVol. 113(3)
University of California, Santa Cruz (US), Rutgers Sexual and Reproductive Health and Rights (NL), Institute for Basic Science (KR)
Openalex Percentile: Top 99%
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.