IP Library Granted Patent US 12,333,379
Granted Patent B2
US 12,333,379 · App. 17/540,485 · Granted Jun 17, 2025

Optimized selection of data for quantum circuits

Inventors: Frederik Frank Flöther (Schlieren, CH); Michele Grossi (Prevessin-Möens, FR); Vaibhaw Kumar (Frederick, MD); Robert E. Loredo (North Miami Beach, FL)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
G06N10/00G06F11/3428G06F18/2135
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,333,379
App. No.
17/540,485
Granted
Jun 17, 2025
Kind
B2
Abstract

To obtain meaningful computational results despite limits on the amount of data that can be input to a quantum computer, a data selection system uses an iterative approach to select a suitable subset of data to be input to a quantum device for processing by a quantum algorithm. The system compresses and clusters a data set according to a task-specific distribution criteria and selects a subset of this clustered data corresponding to representative cases of the data. The selected subset is processed by the quantum device and the system generates a metric score based on the degree to which the results satisfy a performance criterion. The selected subset is refined over multiple iterations based on successive metric scores until a termination criterion is reached, and the final selected subset of data is used as input to the quantum computer for execution of the processing task.

Claims (44)

1. A system, comprising:

a processor that executes computer-executable components stored in memory, wherein the computer-executable components comprise:

a data selection component that, for an iteration of a data selection routine, selects, from a set of data, a subset of the data to be processed by a quantum algorithm on a quantum device; and

a metric assessment component that, for the iteration of the data selection routine, generates a metric score for a result of processing the subset of the data by the quantum algorithm, the metric score representing a degree to which the result satisfies a processing performance metric,

wherein

the data selection component modifies the subset of the data selected for a subsequent iteration of the data selection routine based on the metric score to yield a modified subset of the data, and the computer-executable components further comprise a device interface component that, in response to a determination that a termination criterion for the data selection routine is satisfied, outputs the modified subset of the data generated by a most recent iteration of the data selection routine as input to the quantum device, and wherein the device interface component, for the iteration of the data selection routine, selects the quantum device on which to process the subset of the clustered data from multiple available quantum devices, and the data selection component selects the subset of the data based on at least one of a capability or a constraint of the quantum device determined based on device property information for the quantum device.

2. The system of claim 1 , further comprising a clustering component that clusters the set of data to yield clustered data,

wherein the data selection component selects the subset of the data from the clustered data.

3. The system of claim 2 , further comprising a compression component that compresses the set of data or the clustered data.

4. The system of claim 3 , wherein the compression component compresses the set of data or the clustered data using at least one of principal component analysis or autoencoding.

5. The system of claim 2 , wherein the clustering component clusters the set of data into data clusters according to at least one of a characteristic, a feature, or a classification determined based on a type of the quantum algorithm.

6. The system of claim 5 , wherein the data selection component selects the subset of the data such that each of the data clusters is represented in the subset of the clustered data.

7. The system of claim 1 , wherein the processing performance metric is at least one of accuracy, execution time, calculation robustness.

8. The system of claim 1 , wherein the metric assessment component selects the processing performance metric based on a type of the quantum algorithm.

9. The system of claim 1 , wherein

the device determination component determines an upper limit on an amount of data that can be input to the quantum device based on device property information for the quantum device, and

the data selection component selects, as the subset of the data, an amount of the data equal to or less than the upper limit.

10. The system of claim 1 , wherein the data selection component modifies the subset of the data selected for the subsequent iteration based on a determination of whether the metric score has improved or worsened relative to a previous metric score generated for a previous iteration of the data selection routine.

11. The system of claim 1 , wherein the termination criterion is at least one of the metric score being within a defined range of a target value, execution of a specified number of iterations of the data selection routine, or expiration of a time limit for execution of the data selection routine.

12. The system of claim 1 , wherein the device interface component modifies selection of the quantum device for the subsequent iteration of the data selection routine based on the metric score.

13. A computer-implemented method, comprising:

for respective iterations of a data selection routine:

selecting, by a system operatively coupled to a processor, from a set of data, a subset of the data to be processed by an algorithm on a quantum device;

generating, by the system based on analysis of a result of processing the subset of the data by the algorithm, a metric score that represents a degree to which the result satisfies a processing performance metric; and

modifying, by the system, selection of the subset of the data for a next iteration of the data selection routine based on the metric score to yield a modified subset of the data; and

in response to determining that a termination criterion for the data selection routine is satisfied, outputting, by the system, the modified subset of the data generated by a most recent iteration of the data selection routine as input to the quantum device, and wherein for the iteration of the data selection routine, selecting the quantum device on which to process the subset of the clustered data from multiple available quantum devices, and selecting the subset of data based on at least one of a capability or a constraint of the quantum device determined based on device property information for the quantum device.

14. The computer-implemented method of claim 13 , further comprising clustering, by the system, the set of data to yield clustered data,

wherein the selecting of the subset of the data comprises selecting the subset of the data from the clustered data.

15. The computer-implemented method of claim 14 , further comprising at least one of:

compressing, by the system, the set of data prior to the clustering, or

compressing, by the system, the subset of the data prior to the sending.

16. The computer-implemented method of claim 14 , wherein

the clustering comprises clustering the set of data into data clusters according to at least one of a characteristic, a feature, or a classification determined based on a type of the algorithm, and

the selecting comprises selecting the subset of the data such that each of the data clusters is represented in the subset of the data.

17. The computer-implemented method of claim 13 , wherein the processing performance metric comprises at least one of accuracy, execution time, or calculation robustness.

18. A computer program product comprising a computer-readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:

for respective iterations of a data selection routine:

select, by the processor, from a set of data, a subset of the data to be processed by an algorithm on a quantum device;

generate, by the processor based on analysis of a result of processing the subset of the data by the algorithm, a metric score that represents a degree to which the result satisfies a processing performance metric; and

modify, by the processor, selection of the subset of the data for a next iteration of the data selection routine based on the metric score to yield a modified subset of the data; and

in response to determining that a termination criterion for the data selection routine is satisfied, output, by the processor, the modified subset of the data generated by a most recent iteration of the data selection routine as input to the quantum device, and wherein for the iteration of the data selection routine, selecting the quantum device on which to process the subset of the clustered data from multiple available quantum devices, and selecting the subset of data based on at least one of a capability or a constraint of the quantum device determined based on device property information for the quantum device.

19. The computer program product of claim 18 , wherein the program instructions executable by the processor further cause the processor to:

cluster, by the processor, the set of data to yield clustered data; and

select the subset of the data from the clustered data.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 2, 2021
From: FLÖTHER, FREDERIK FRANK; GROSSI, MICHELE; KUMAR, VAIBHAW; LOREDO, ROBERT E.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 058268/0043 →
Continuity (1)
Related Publication 20230177372A1 · Jun 8, 2023
References Cited (33)
US 7620672B2 · Tucci · 2009 [cited by applicant]
US 10275721B2 · Dukatz et al. · 2019 [cited by applicant]
US 10318881B2 · Rose et al. · 2019 [cited by applicant]
US 10803395B2 · Pistoia et al. · 2020 [cited by applicant]
US 11113621B2 · Cortese et al. · 2021 [cited by applicant]
US 11237807B1 · Rao · 2022 [cited by examiner]
US 11651276B2 · Ravizza et al. · 2023 [cited by applicant]
US 20180276555A1 · Weichenberger · 2018 [cited by examiner]
US 20200234172A1 · King · 2020 [cited by examiner]
US 20200265333A1 · Toresh et al. · 2020 [cited by applicant]
US 20200285947A1 · Gunnels et al. · 2020 [cited by applicant]
US 20200311107A1 · Crawford · 2020 [cited by examiner]
US 20210056455A1 · Shehab · 2021 [cited by applicant]
US 20210374862A1 · Ramanathan · 2021 [cited by examiner]
US 20220318664A1 · Gadi · 2022 [cited by examiner]
US 20220374655A1 · Lowe · 2022 [cited by examiner]
US 20240311668A1 · Jones · 2024 [cited by examiner]
CN 112862104A · 2021 [cited by applicant]
KR 20210081859A · 2021 [cited by applicant]
WO 2014210368A1 · 2014 [cited by applicant]
Khan et al., “K-means clustering on noisy intermediate scale quantum computers.” arXiv preprint arXiv:1909.12183 (2019). 12 pages. [cited by applicant]
Harrow “Small quantum computers and large classical data sets.” arXiv preprint arXiv:2004.00026 (2020). 25 pages. [cited by applicant]
Ruslan et al., “A hybrid approach for solving optimization problems on small quantum computers.” Computer 52, No. 6 (2019): 18-26. 7 pages. [cited by applicant]
Sim et al., “A framework for algorithm deployment on cloud-based quantum computers.” arXiv preprint arXiv:1810_10576 (2018). 10 pages. [cited by applicant]
McCaskey et al., “XACC: a system-level software infrastructure for heterogeneous quantum-classical computing.” Quantum Science and Technology 5, No. 2 (2020): 024002. 17 pages. [cited by applicant]
Cerezo et al., “Variational quantum algorithms.” Nature Reviews Physics (2021): 1-20. 33 pages. [cited by applicant]
Zoufal et al., “Quantum generative adversarial networks for learning and loading random distributions.” npj Quantum Information 5, No. 1 (2019): 1-9. 9 pages. [cited by applicant]
Karimi et al., “Boosting quantum annealer performance via sample persistence.” Quantum Information Processing 16, No. 7 (2017): 166. [cited by applicant]
Bian et al., “Mapping constrained optimization problems to quantum annealing with application to fault diagnosis.” Frontiers in ICT 3 (2016): 14. [cited by applicant]
Yoshioka et al., “Transforming generalized Ising models into Boltzmann machines.” Physical Review E 99, No. 3 (2019): 032113. [cited by applicant]
Bursac, et al., Purposeful Selection of Variables in Logistic Regression, Source Code for Biology and Medicine, Dec. 16, 2008 vol. 3, Article 17, pages. [cited by applicant]
Recursive Feature Elimination with Cross-Validation, Retrieved from: Recursive feature elimination with cross-validation—scikit-learn 1.6.1 documentation, 2007, 4 pages. [cited by applicant]
Schuld, et al., Quantum Ensembles of Quantum Classifiers, Scientific Reports, vol. 8, Article 2772, Feb. 9, 2018, 12 pages. [cited by applicant]