Quantum Matrix Arithmetics with Hamiltonian Evolution
ACM Transactions on Quantum Computing · 31.12.2026 · 7 (4) · 1-86
DOI: 10.1145/3816436 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Quantum Computing, online erschienen am 13.08.2026. Verfasst von Christopher Kang und 1 weiteren Autor:innen. Die Arbeit nennt 110 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NSF, US Department of Energy Office of Advanced Scientific Computing Research, Accelerated Research for Quantum Computing Program, NSF Quantum Leap Challenge Institute for Hybrid Quantum Architectures and Networks.
Abstract (Originalsprache)
The efficient implementation of matrix arithmetic operations underpins the speedups of many quantum algorithms. We develop a suite of methods to perform matrix arithmetics—with the result encoded in the off-diagonal blocks of a Hamiltonian—using Hamiltonian evolutions of input operators. We show how to maintain this Hamiltonian block encoding , so that matrix operations can be composed one after another, and the entire quantum computation takes ≤ 2 ancilla qubits. We achieve this for matrix multiplication, matrix addition, matrix inversion, Hermitian conjugation, fractional scaling, integer scaling, complex phase scaling, as well as singular value transformation for both odd and even polynomials. We also present an overlap estimation algorithm to extract classical properties of Hamiltonian block encoded operators, analogous to the well known Hadamard test, at no extra cost of qubit. Our Hamiltonian matrix multiplication uses the Lie group commutator product formula and its higher-order generalizations due to Childs and Wiebe. Our Hamiltonian singular value transformation employs a dominated polynomial approximation, where the approximation holds within the domain of interest, while the constructed polynomial is upper bounded by the target function over the entire unit interval. We describe a circuit for simulating a class of sum-of-squares Hamiltonians, attaining a commutator scaling in step count, while leveraging the power of matrix arithmetics to reduce the cost of each simulation step. In particular, we apply this to the doubly factorized tensor hypercontracted Hamiltonians from recent studies of quantum chemistry, obtaining further improvements for initial states with a fixed number of particles. We achieve this with 1 ancilla qubit.
Förderung
- NSF
- US Department of Energy Office of Advanced Scientific Computing Research, Accelerated Research for Quantum Computing Program
- NSF Quantum Leap Challenge Institute for Hybrid Quantum Architectures and Networks
- NSF National Virtual Quantum Laboratory program
- U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers
- Army Research Office
Zitieren
APA
Kang, C., & Su, Y. (2026). Quantum Matrix Arithmetics with Hamiltonian Evolution. ACM Transactions on Quantum Computing, 7(4), 1-86. https://doi.org/10.1145/3816436
Vancouver
Kang C, Su Y. Quantum Matrix Arithmetics with Hamiltonian Evolution. ACM Transactions on Quantum Computing. 2026;7(4):1-86. doi:10.1145/3816436
BibTeX
@article{Kang2026,
author = {Kang, Christopher and Su, Yuan},
title = {Quantum Matrix Arithmetics with Hamiltonian Evolution},
journal = {ACM Transactions on Quantum Computing},
year = {2026},
volume = {7},
number = {4},
pages = {1--86},
doi = {10.1145/3816436}
}
EUVIMED