IP Library Granted Patent US 12,579,459
Granted Patent B2
US 12,579,459 · App. 17/863,449 · Granted Mar 17, 2026

Quantum circuit for transformation of mixed state vectors

Inventors: Ismail Yunus Akhalwaya (Emmarentia, ZA); Shashanka Ubaru (Ossining, NY); Kenneth Lee Clarkson (Madison, NJ); Mark S. Squillante (Greenwich, CT); Vasileios Kalantzis (White Plains, NY); Lior Horesh (North Salem, NY)
Assignee: International Business Machines Corporation
G06N10/40G06N10/20
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,579,459
App. No.
17/863,449
Granted
Mar 17, 2026
Kind
B2
Abstract

Systems and methods for operating quantum systems 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 sample an input vector represented by the first set of qubits, where the input vector includes mixed states with different Hamming weights. The interface can control the quantum hardware to entangle the first set of qubits to the second set of qubits, where the second set of qubits represent a count of nonzero elements in the input vector. The interface can control the quantum hardware to generate an output vector based on the entanglement of the first set of qubits to the second set of qubits, where the output vector includes one or more states having a specific Hamming weight.

Claims (98)

1 . An apparatus comprising:

a controller configured to generate a command signal;

quantum hardware including at least a first set of qubits and a second set of qubits; and

an interface connected to the controller and the quantum hardware, the interface being configured to control the quantum hardware based on the command signal received from the controller to:

sample an input vector represented by the first set of qubits, wherein the input vector includes mixed states with different Hamming weights;

entangle the first set of qubits to the second set of qubits, wherein the second set of qubits represent a count of nonzero elements in the input vector; and

generate an output vector based on the entanglement of the first set of qubits to the second set of qubits, wherein the output vector includes one or more states having a specific Hamming weight.

2 . The apparatus of claim 1 , wherein:

the input vector corresponds to a dataset comprising a plurality of data points, and a topology of the dataset is represented by a simplicial complex;

the simplicial complex comprises n vertices;

the first set of qubits comprises n qubits; and

the second set of qubits comprises log(n) qubits.

3 . The apparatus of claim 2 , wherein the output vector projects simplices of an order k the simplicial complex based on the entanglement of the first set of qubits and the second set of qubits.

4 . The apparatus of claim 1 , wherein the quantum hardware comprises a set of controlled-NOT (CNOT) gates that entangles the first set of qubits to the second set of qubits.

5 . The apparatus of claim 1 , wherein the quantum hardware comprises:

a set of Hadamard gates configured to transform the first set of qubits into superposition quantum state;

a set of controlled-NOT (CNOT) gates configured to entangle the first set of qubits to the second set of qubits; and

a set of phase gates configured to perform phase change on the second set of qubits based on states of the first set of qubits, wherein the phase change increments the count represented by the second set of qubits.

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

receive a set of random binary numbers;

generate a set of random state vectors based on the set of random binary numbers; and

iteratively sample a random state vector among the set of random state vectors, wherein the sampled random state vector is the input vector.

7 . The apparatus of claim 6 , wherein the interface is configured to control the quantum hardware to sample the random state vector by:

randomly inverting one or more of the first set of qubits; and

applying the set of Hadamard gates to the first set of qubits to produce the random state vector.

8 . The apparatus of claim 1 , wherein the quantum circuit comprises a set of measurement circuits configured to measure the second set of qubits.

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

generate a vector that includes one or more states having a random Hamming weight;

measure the second set of qubits;

in response to a result of the measurement indicating the random Hamming weight is same as the specific Hamming weight, output the generated vector as the output vector; and

in response to a result of the measurement indicating the random Hamming weight is different from the specific Hamming weight, sample a next input vector without generating the output vector.

10 . 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,

wherein the second computing device comprises:

a controller configured to at least:

receive an instruction from the first computing device; and

generate a command signal based on the instruction;

quantum hardware including a plurality of qubits; and

an interface connected to the controller and the quantum hardware, the interface being configured to control the quantum hardware based on the command signal received from the controller to:

sample an input vector represented by the first set of qubits, wherein the input vector includes mixed states with different Hamming weights;

entangle the first set of qubits to the second set of qubits, wherein the second set of qubits represent a count of nonzero elements in the input vector; and

generate an output vector based on the entanglement of the first set of qubits to the second set of qubits, wherein the output vector includes one or more states having a specific Hamming weight.

11 . The system of claim 10 , wherein:

the input vector corresponds to a dataset comprising a plurality of data points, and a topology of the dataset is represented by a simplicial complex;

the simplicial complex comprises n vertices;

the first set of qubits comprises n qubits; and

the second set of qubits comprises log(n) qubits.

12 . The system of claim 11 , wherein the output vector projects simplices of an order k the simplicial complex based on the entanglement of the first set of qubits and the second set of qubits.

13 . The system of claim 10 , wherein the second computing device comprises a set of controlled-NOT (CNOT) gates that entangles the first set of qubits to the second set of qubits.

14 . The system of claim 10 , wherein the second computing device comprises:

a set of Hadamard gates configured to transform the first set of qubits into superposition quantum state;

a set of controlled-NOT (CNOT) gates configured to entangle the first set of qubits to the second set of qubits; and

a set of phase gates configured to perform phase change on the second set of qubits based on states of the first set of qubits, wherein the phase change increments the count represented by the second set of qubits.

15 . The system of claim 14 , wherein the second computing device is configured to:

receive a set of random binary numbers from the first computing device;

generate a set of random state vectors based on the set of random binary numbers; and

iteratively sample a random state vector among the set of random state vectors, wherein the sampled random state vector is the input vector.

16 . The system of claim 15 , wherein the second computing device is configured to sample the random state vector by:

randomly inverting one or more of the first set of qubits; and

applying the set of Hadamard gates to the first set of qubits to produce the random state vector.

17 . The system of claim 15 , wherein the first computing device is configured to generate the set of random binary numbers.

18 . The system of claim 10 , wherein the second computing device comprises a set of measurement circuits configured to measure the second set of qubits.

19 . The system of claim 10 , wherein the second computing device is configured to:

generate a vector that includes one or more states having a random Hamming weight;

measure the second set of qubits;

in response to a result of the measurement indicating the random Hamming weight is same as the specific Hamming weight, the second computing device outputs the generated vector as the output vector; and

in response to a result of the measurement indicating the random Hamming weight is different from the specific Hamming weight, the second computing device samples a next input vector without generating the output vector.

20 . A method for 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 to:

sample an input vector having mixed states with different Hamming weights;

entangle a first set of qubits to a second set of qubits, wherein the first set of qubits represents elements of the input vector, and the second set of qubits represent a count of nonzero elements in the input vector; and

generate an output vector based on the entanglement of the first set of qubits to the second set of qubits, wherein the output vector includes one or more states having a specific Hamming weight.

21 . The method of claim 20 , wherein:

the input vector corresponds to a dataset comprising a plurality of data points, and a topology of the dataset is represented by a simplicial complex;

the simplicial complex comprises n vertices;

the first set of qubits comprises n qubits;

the second set of qubits comprises log(n) qubits; and

the output vector projects simplices of an order k the simplicial complex based on the entanglement of the first set of qubits and the second set of qubits.

22 . The method of claim 20 , further comprising:

transforming the first set of qubits into superposition quantum state;

entangling the first set of qubits in superposition quantum state to the second set of qubits; and

performing phase change on the second set of qubits based on states of the first set of qubits, wherein the phase change increments the count represented by the second set of qubits.

23 . The method of claim 22 , further comprising:

receiving a set of random binary numbers;

generating a set of random state vectors based on the set of random binary numbers; and

iteratively sampling a random state vector among the set of random state vectors, wherein the sampled random state vector is the input vector.

24 . The method of claim 23 , wherein sampling the input vector comprises:

randomly inverting one or more of the first set of qubits; and

applying the set of Hadamard gates to the first set of qubits to produce the random state vector.

25 . The method of claim 20 , further comprising:

generating a vector that includes one or more states having a random Hamming weight;

measuring the second set of qubits;

in response to a result of the measurement indicating the random Hamming weight is same as the specific Hamming weight, outputting the generated vector as the output vector; and

in response to a result of the measurement indicating the random Hamming weight is different from the specific Hamming weight, sampling a next input vector without generating the output vector.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 13, 2022
From: AKHALWAYA, ISMAIL YUNUS; UBARU, SHASHANKA; CLARKSON, KENNETH LEE; SQUILLANTE, MARK S.; KALANTZIS, VASILEIOS; HORESH, LIOR
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 060490/0843 →
Continuity (1)
Related Publication 20240020563A1 · Jan 18, 2024
References Cited (80)
US 9275011B2 · Svore et al. · 2016 [cited by applicant]
US 9430688B1 · Ray · 2016 [cited by applicant]
US 10311370B2 · Bravyi et al. · 2019 [cited by applicant]
US 10977546B2 · Gambetta et al. · 2021 [cited by applicant]
US 11625637B2 · Gidney · 2023 [cited by examiner]
US 12001925B2 · Barber · 2024 [cited by examiner]
US 20070036434A1 · Saveliev · 2007 [cited by applicant]
US 20150363708A1 · Amin et al. · 2015 [cited by applicant]
US 20160191060A1 · Mcdermott et al. · 2016 [cited by applicant]
US 20170147946A1 · Umeda · 2017 [cited by applicant]
US 20180025073A1 · Singh et al. · 2018 [cited by applicant]
US 20180287788A1 · Pitala Garca · 2018 [cited by applicant]
US 20190164034A1 · Gambetta et al. · 2019 [cited by applicant]
US 20200265274A1 · Kachman et al. · 2020 [cited by applicant]
US 20200342380A1 · Selina et al. · 2020 [cited by applicant]
US 20200349050A1 · Ghobadi et al. · 2020 [cited by applicant]
US 20200349459A1 · Cao et al. · 2020 [cited by applicant]
US 20210058244A1 · Jacak · 2021 [cited by examiner]
US 20210089953A1 · Bocharov et al. · 2021 [cited by applicant]
US 20210232960A1 · Genin et al. · 2021 [cited by applicant]
US 20210256410A1 · Bravyi · 2021 [cited by examiner]
US 20210256414A1 · Kachman et al. · 2021 [cited by applicant]
US 20210272009A1 · Gidney · 2021 [cited by examiner]
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 et al. · 2022 [cited by applicant]
US 20220180214A1 · Cervantes et al. · 2022 [cited by applicant]
US 20220299341A1 · Zhang · 2022 [cited by applicant]
US 20230040289A1 · Sels et al. · 2023 [cited by applicant]
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 20240020564A1 · Ubaru 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 · 2024 [cited by examiner]
US 20240037304A1 · Akhalwaya et al. · 2024 [cited by applicant]
US 20240296367A1 · Rubin · 2024 [cited by examiner]
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 Numbers 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□ 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]
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 Jun. 30, 2025 for U.S. Appl. No. 17/863,508, 25 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]
United States Notice of Allowance dated Nov. 4, 2025, 17 pages, in U.S. Appl. No. 17/863,508. [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]