IP Library Granted Patent US 12,561,594
Granted Patent B2
US 12,561,594 · App. 17/863,508 · Granted Feb 24, 2026

Quantum circuits for matrix trace estimation

Inventors: Shashanka Ubaru (Ossining, NY); Kenneth Lee Clarkson (Madison, NJ); Ismail Yunus Akhalwaya (Emmarentia, ZA); Mark S. Squillante (Greenwich, CT); Vasileios Kalantzis (White Plains, NY); Lior Horesh (North Salem, NY)
Assignee: International Business Machines Corporation
G06N10/40G06F17/16G06N10/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,561,594
App. No.
17/863,508
Granted
Feb 24, 2026
Kind
B2
Abstract

Systems and methods for operating a quantum system are described. A controller of a quantum system can generate a command signal. The quantum system can include quantum hardware having a plurality of qubits. An interface of the quantum system can control the quantum hardware based on the command signal to generate a random state vector represented by the plurality of qubits. The random state vector can include a specific number of independent entries. The interface can control the quantum hardware to determine moments of a matrix based on the random state vector. The controller can be further configured to output the moments of the matrix to a computing device to estimate a trace of the matrix using the moments.

Claims (56)

1 . An apparatus comprising:

a controller configured to generate a command signal;

quantum hardware including at least a first set of qubits, a second set of qubits, and a plurality of Hadamard gates; and

an interface connected to the controller and the quantum hardware, the interface being configured to convert the command signal received from the controller into a quantum operation to control the quantum hardware to:

generate a random state vector represented by a plurality of qubits, wherein the random state vector comprises a specific number of independent entries of independent states of the random state vector, and the random state vector is a superposition of multiple states of the random state vector having different Hamming weights;

determine moments of a matrix based on the random state vector, wherein elements of the matrix are inaccessible to the apparatus; and

the controller being further configured to output the moments of the matrix to a computing device to estimate a trace of the matrix using the moments.

2 . The apparatus of claim 1 , wherein the specific number of independent entries is four entries.

3 . The apparatus of claim 1 , wherein the matrix corresponds to a Laplacian of simplices of a specific order in a simplicial complex, and a determination of Betti numbers of the simplicial complex is based on the estimated trace.

4 . The apparatus of claim 1 , wherein the matrix is a Hermitian matrix.

5 . The apparatus of claim 1 , wherein the matrix is an n×n matrix representing a dataset of n data points.

6 . The apparatus of claim 1 , wherein the matrix is an n×n matrix, and the quantum circuit is configured to generate the random state vector by randomly sampling a column of a 2{circumflex over ( )}n×2{circumflex over ( )}n Hadamard matrix.

7 . The apparatus of claim 1 , wherein the quantum hardware comprises a quantum t-design circuit including a layer of parallel Hadamard gates followed by a set of Toffoli gates, the interface is configured to control the quantum t-design circuit to output pseudo-random states that are indistinguishable from states drawn from a random Haar measure to sample the random state vector.

8 . The apparatus of claim 1 , wherein the interface is configured to control the quantum hardware to:

determine a quantum state that represents an application of the matrix to the random state vector;

determine a complex conjugate of the random state vector; and

determine an inner product between the quantum state and the complex conjugate to determine the moments.

9 . The apparatus of claim 1 , wherein the matrix corresponds to a Laplacian of simplices of a specific order in a simplicial complex, and the quantum circuit is configured to:

determine a quantum state that represents an application of the Laplacian to the random state vector; and

determine a norm of the quantum state to determine the moments.

10 . The apparatus of claim 1 , wherein estimation of the trace comprises averaging the moments over a number of samples used for generating the random state vector.

11 . A system comprising:

a first computing device configured to process data encoded in binary data;

a second computing device configured to be in communication with the first computing device, the second computing device being configured to process data encoded in qubits, the second computing device comprises:

a controller configured to generate a command signal;

quantum hardware including at least a first set of qubits, a second set of qubits, and a plurality of Hadamard gates; and

an interface connected to the controller and the quantum hardware, the interface being configured to convert the command signal received from the controller into a quantum operation to control the quantum hardware to:

generate a random state vector represented by a plurality of qubits, wherein the random state vector comprises a specific number of independent entries of independent states of the random state vector, and the random state vector is a superposition of multiple states of the random state vector having different Hamming weights;

determine moments of a matrix based on the random state vector, wherein elements of the matrix are inaccessible to the apparatus; and

the controller being further configured to output the moments of the matrix to the first computing device to estimate a trace of the matrix using the moments.

12 . The system of claim 11 , wherein the specific number of independent entries is four entries.

13 . The system of claim 11 , wherein the matrix corresponds to a Laplacian of simplices of a specific order in a simplicial complex, and a determination of Betti numbers of the simplicial complex is based on the estimated trace.

14 . The system of claim 11 , wherein the matrix is a Hermitian matrix.

15 . The system of claim 11 , wherein the matrix is an n×n matrix representing a dataset of n data points.

16 . The system of claim 11 , wherein the matrix is an n×n matrix, and the quantum circuit is configured to generate the random state vector by randomly sampling a column of a 2{circumflex over ( )}n×2{circumflex over ( )}n Hadamard matrix.

17 . The system of claim 11 , wherein the second computing device comprises a quantum t-design circuit including a layer of parallel Hadamard gates followed by a set of Toffoli gates, and the interface is configured to control the quantum t-design circuit to output pseudo-random states that are indistinguishable from states drawn from a random Haar measure to sample the random state vector.

18 . The system of claim 11 , wherein the second computing device is configured to:

determine a quantum state that represents an application of the matrix to the random state vector;

determine a complex conjugate of the random state vector; and

determine an inner product between the quantum state and the complex conjugate to determine the moments.

19 . The system of claim 11 , wherein the matrix corresponds to a Laplacian of simplices of a specific order in a simplicial complex, and the second computing device is configured to:

determine a quantum state that represents an application of the Laplacian to the random state vector; and

determine a norm of the quantum state to determine the moments.

20 . The system of claim 11 , wherein the first computing device is configured to determine an average of the moments over a number of samples used for the generation of the random state vector to estimate the trace.

21 . A method of operating a quantum system, the method comprising:

receiving, by a controller of a quantum system, an instruction;

generating, by the controller of the quantum system, a command signal based on the instruction;

converting, by an interface of the quantum system, the command signal into a quantum operation; and

based on the quantum operation, controlling, by the interface of the quantum system, quantum hardware of the quantum system including a plurality of Hadamard gates to:

generate a random state vector represented by a plurality of qubits, the random state vector comprising a specific number of independent entries of independent states of the random state vector, and the random state vector is a superposition of multiple states of the random state vector having different Hamming weights;

determine moments of a matrix based on the random state vector, wherein elements of the matrix are inaccessible to the apparatus; and

outputting, by the controller of the quantum system, the moments of the matrix to a computing device to estimate a trace of the matrix using the moments.

22 . The method of claim 21 wherein the specific number of independent entries is four entries.

23 . The method of claim 21 , wherein the matrix corresponds to a Laplacian of simplices of a specific order in a simplicial complex, and a determination of Betti numbers of the simplicial complex is based on the estimated trace.

24 . The method of claim 21 , wherein an estimation of the trace comprises determining an average of the moments over a number of samples used for the generation of the random state vector.

25 . The method of claim 21 , wherein the matrix is a Hermitian matrix.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 13, 2022
From: UBARU, SHASHANKA; CLARKSON, KENNETH LEE; AKHALWAYA, ISMAIL YUNUS; SQUILLANTE, MARK S.; KALANTZIS, VASILEIOS; HORESH, LIOR
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 060492/0065 →
Continuity (1)
Related Publication 20240020564A1 · Jan 18, 2024
References Cited (79)
US 9275011B2 · Svore et al. · 2016 [cited by applicant]
US 9430688B1 · Ray · 2016 [cited by applicant]
US 10311370B2 · Bravyi · 2019 [cited by examiner]
US 10977546B2 · Gambetta et al. · 2021 [cited by applicant]
US 11625637B2 · Gidney · 2023 [cited by examiner]
US 12001925B2 · Barber et al. · 2024 [cited by applicant]
US 20070036434A1 · Saveliev · 2007 [cited by applicant]
US 20150363708A1 · Amin et al. · 2015 [cited by applicant]
US 20160191060A1 · McDermott, III · 2016 [cited by examiner]
US 20170147946A1 · Umeda · 2017 [cited by applicant]
US 20180025073A1 · Singh et al. · 2018 [cited by applicant]
US 20180287788A1 · Pitalúa García · 2018 [cited by examiner]
US 20190164034A1 · Gambetta et al. · 2019 [cited by applicant]
US 20200265274A1 · Kachman · 2020 [cited by examiner]
US 20200342380A1 · Selina et al. · 2020 [cited by applicant]
US 20200349050A1 · Ghobadi · 2020 [cited by examiner]
US 20200349459A1 · Cao et al. · 2020 [cited by applicant]
US 20210058244A1 · Jacak et al. · 2021 [cited by applicant]
US 20210089953A1 · Bocharov · 2021 [cited by examiner]
US 20210232960A1 · Scott N. et al. · 2021 [cited by applicant]
US 20210256410A1 · Bravyi et al. · 2021 [cited by applicant]
US 20210256414A1 · Kachman et al. · 2021 [cited by applicant]
US 20210272009A1 · Gidney et al. · 2021 [cited by applicant]
US 20210329601A1 · Li · 2021 [cited by applicant]
US 20210383022A1 · Bennati et al. · 2021 [cited by applicant]
US 20220058435A1 · Ou et al. · 2022 [cited by applicant]
US 20220084398A1 · Zhang et al. · 2022 [cited by applicant]
US 20220172050A1 · Dalli · 2022 [cited by examiner]
US 20220180214A1 · Cervantes et al. · 2022 [cited by applicant]
US 20220299341A1 · Zhang · 2022 [cited by applicant]
US 20230040289A1 · Sels · 2023 [cited by examiner]
US 20230080319A1 · Zhang et al. · 2023 [cited by applicant]
US 20230104188A1 · Zilberman et al. · 2023 [cited by applicant]
US 20230401792A1 · Hofmann · 2023 [cited by applicant]
US 20240020563A1 · Akhalwaya et al. · 2024 [cited by applicant]
US 20240020565A1 · Ubaru et al. · 2024 [cited by applicant]
US 20240022247A1 · Ubaru et al. · 2024 [cited by applicant]
US 20240028939A1 · Akhalwaya et al. · 2024 [cited by applicant]
US 20240037304A1 · Akhalwaya et al. · 2024 [cited by applicant]
US 20240296367A1 · Rubin et al. · 2024 [cited by applicant]
CN 110443785A · 2019 [cited by applicant]
CN 110612540A · 2019 [cited by applicant]
CN 112651418A · 2021 [cited by applicant]
CN 113204738A · 2021 [cited by applicant]
WO 2014081882A2 · 2014 [cited by applicant]
WO 2020164772A1 · 2020 [cited by applicant]
WO 2020263146A1 · 2020 [cited by applicant]
Ubaru, Shashanka et al., “Quantum Topological Data Analysis with Linear Depth and Exponential Speedup,” arXiv preprint arXiv:2108.02811, Aug. 5, 2021, 27 pages (Grace Period Disclosure). [cited by applicant]
Hayakawa, Ryu, “Quantum Algorithm for Persistent Betti Nos. and Topological Data Analysis,” arXiv preprint arXiv:2111.00433, Oct. 31, 2021, 25 pages. [cited by applicant]
Seth Lloyd,“Quantum algorithms for topological and geometric analysis of data.” arXiv:1408.3106v2 [quant-ph] Dec. 15, 2015 20 pages https://arxiv.org/abs/1408.3106. [cited by applicant]
Grover L.K.: A fast quantum mechanical algorithm for database search, Proceedings, 28th Annual ACM Symposium on the Theory of Computing, (May 1996) p. 212-219 https://arxiv.org/abs/quant-ph/9605043. [cited by applicant]
Hajij, Mustafa et al., “Simplicial Complex Representation Learning,” arXiv preprint arXiv:2103.04046, Feb. 22, 2022, 10 pages. [cited by applicant]
NIST, “NIST Cloud Computing Program”, http://csrc.nist.gov/groups/SNS/cloud-computing/index.html, Created Dec. 1, 2016, Updated Oct. 6, 2017, 9 pages. [cited by applicant]
Horesh, L., et al., “Quantum Computing Algorithms for Decision Making Under Uncertainty”, Jul. 14, 2021, 111 pages (Grace Period Disclosure). [cited by applicant]
Low, G.H., et al., “Optimal Hamiltonian Simulation by Quantum Signal Processing”, arXiv:1606.02685v2, Dec. 20, 2016, 6 pages. [cited by applicant]
Van Den Berg, E., et al., “Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters”, arXiv:2003.13599v2, Sep. 5, 2020, 28 pages. [cited by applicant]
Cade, Chris, and Ashley Montanaro. “The Quantum Complexity of Computing Schatten norms.” arXiv preprint arXiv:1706.09279 (Jun. 28, 2017). 28 Pages. [cited by applicant]
Luongo, Alessandro, and Changpeng Shao. “Quantum algorithms for spectral sums.” arXiv preprint arXiv:2011.06475 (Nov. 12, 2020). 24 Pages. [cited by applicant]
Gyurik, Casper, Chris Cade, and Vedran Dunjko. “Towards quantum advantage for topological data analysis.” arXiv e-prints (Mar. 1, 2020): arXiv-2005. 29 Pages. [cited by applicant]
Avron, Haim, and Sivan Toledo. “Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix.” Journal of the ACM (JACM) 58.2 (Apr. 2010): 16 Pages. [cited by applicant]
Hutchinson, M.F., 1989. A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines. Communications in Statistics—Simulation and Computation, 18(3), pp. 1059-1076. [cited by applicant]
Brakerski, Zvika, and Shmueli, Omri “(Pseudo) Random Quantum States with Binary Phase.” Theory of Cryptography Conference. Springer, Cham, Jun. 26, 2019, 21 pages. [cited by applicant]
Fitzsimons, Jack K. et al., “Improved Stochastic Trace Estimation using Mutually Unbiased Bases,” arXiv preprint arXiv:1608.00117, Jul. 30, 2016, 5 pages. [cited by applicant]
Fika, Paraskevi et al., “Estimation of the Bilinear Form y□ f (A) x for Hermitian Matrices,” Linear Algebra and its Applications 502, 2016, pp. 140-158. (See article history for dates). [cited by applicant]
Ubaru, Shashanka, and Yousef Saad. “Fast methods for estimating the numerical rank of large matrices.” International Conference on Machine Learning. PMLR, 2016. 10 Pages. [cited by applicant]
Han, I., Malioutov, D., Avron, H., & Shin, J. (2017). Approximating spectral sums of large-scale matrices using stochastic chebyshev approximations. SIAM Journal on Scientific Computing, 39(4), A1558-A1585. Mar. 9, 2017… [cited by applicant]
Fan, Li et al., “Spectrum-Adapted Polynomial Approximation for Matrix Functions,” arXiv preprint arXiv:1808.09506, Aug. 28, 2018, 5 pages. [cited by applicant]
Han, Insu et al., “Stochastic Chebyshev Gradient Descent for Spectral Optimization,” Advances in Neural Information Processing Systems 31, 2018, 11 pages. [cited by applicant]
Akhalwaya, Ismail Yunus et al., “Don't Count the Shots, Make the Shots Count: Efficient Quantum Computation of the Fermionic Boundary Operator”, arXiv:2201.11510v1, Jan. 27, 2022, 16 pages. [cited by applicant]
Non-Final Rejection Mailed on Apr. 11, 2025 for U.S. Appl. No. 17/863,449, 8 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Apr. 10, 2025 for U.S. Appl. No. 17/863,524, 9 page(s). [cited by applicant]
Non-Final Rejection Mailed on Aug. 22, 2025 for U.S. Appl. No. 17/863,484, 6 page(s). [cited by applicant]
A Holzner et al., “Chebyshev matrix product state approach for spectral functions”, published to Physical Review B 83, 195115, May 10, 2011, 20 pages. [cited by applicant]
C. Bekas, et al., “An Estimator for the Diagonal of a Matrix”, Jun. 1, 2005, 22 pages, https://www-users.cse.umn.edu/˜saad/PDF/umsi-2005-082.pdf. [cited by applicant]
Cortinovis et al., “On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants”, published to Foundations of Computational Mathematics, Jul. 9, 2021, 29 pages. [cited by applicant]
Costa et al., “Topological data analysis and applications”, published via MIPRO, May 22-26, 2017, 06 pages. [cited by applicant]
Jonnadula et al., “On the moments of characteristic polynomials”, Jun. 22, 2021, 26 pages. [cited by applicant]
Marco Taboga, “Trace of a matrix”, Mar. 13, 2019, 04 pages, https://www.statlect.com/matrix-algebra/trace-of-a-matrix. [cited by applicant]
United States Non-Final Rejection dated Oct. 16, 2025, 17 pages, in U.S. Appl. No. 17/863,554. [cited by applicant]