Providing reusable quantum circuit components as a curated service

Patent metadata

Field	Value
Publication number	US-11983471-B2
Application number	US-202217715234-A
Country	US
Kind code	B2
Filing date	Apr 7, 2022
Priority date	May 29, 2019
Publication date	May 14, 2024
Grant date	May 14, 2024

Abstract

A repository is configured in a hybrid data processing environment comprising a classical computing system and a quantum computing system, to hold a plurality of quantum circuit components (QCC(s)). A degree of difficulty in simulating the received QCC in the classical computing system is transformed into a classical hardness score. A degree of difficulty in implementing the received QCC in the quantum computing system is transformed into a quantum hardness score. A first parameter in a metadata data structure associated with the received QCC is populated with the classical hardness score. A second parameter in the metadata data structure associated with the received QCC is populated with the quantum hardness score. The received QCC is transformed into a library element by at least augmenting the received QCC with the metadata data structure. The library element is added to the repository.

First claim

What is claimed is:

1. A method comprising:
configuring, in a hybrid data processing environment comprising a classical computing system and a quantum computing system, a repository to hold a plurality of quantum circuit components (QCC(s));
transforming a received QCC into a library element in the repository, the library element comprising:
a classical hardness score corresponding to a degree of difficulty in simulating the received QCC in the classical computing system;
a quantum hardness score corresponding to a degree of difficulty in implementing the received QCC in the quantum computing system; and

adding the library element to the repository.

2. The method of claim 1 , further comprising:
simulating the received QCC in the classical computing system, the simulating producing the degree of difficulty in simulating the received QCC.

3. The method of claim 1 , further comprising:
receiving a quantum circuit (QC); and
partitioning the QC into a set of QCCs, the received QCC being a member of the set of QCCs.

4. The method of claim 3 , further comprising:
receiving descriptive information in conjunction with the QC, the descriptive information comprising a contributor's degree of difficulty in simulating the QC in a contributor's classical system, and wherein the contributor's degree of difficulty is used as the degree of difficulty in simulating the received QCC in the classical computing system.

5. The method of claim 3 , further comprising:
receiving descriptive information in conjunction with the QC, the descriptive information comprising a contributor's degree of difficulty in simulating the QC in a contributor's classical system; and
validating the contributor's degree of difficulty by simulating the QCC in the classical computing system, and wherein the degree of difficulty in simulating the received QCC in the classical computing system overrides the contributor's degree of difficulty.

6. The method of claim 3 , further comprising:
receiving descriptive information in conjunction with the QC, the descriptive information comprising a contributor's degree of difficulty in implementing the QC in a contributor's quantum system, and wherein the contributor's degree of difficulty is used as the degree of difficulty in implementing the received QCC in the quantum computing system.

7. The method of claim 3 , further comprising:
receiving descriptive information in conjunction with the QC, the descriptive information comprising a contributor's degree of difficulty in implementing the QC in a contributor's quantum system; and
validating the contributor's degree of difficulty by implementing the QCC in the quantum computing system, and wherein the degree of difficulty in implementing the received QCC in the quantum computing system overrides the contributor's degree of difficulty.

8. The method of claim 1 , further comprising:
implementing the received QCC in the quantum computing system, the implementing producing the degree of difficulty in implementing the received QCC.

9. The method of claim 1 , further comprising:
associating with the received QCC, a metadata data structure, the metadata data structure comprising a plurality of parameters, the plurality of parameters including a first parameter storing the classical hardness score and a second parameter storing the quantum hardness score.

10. The method of claim 9 , wherein the metadata data structure comprises a plurality of instances of a third parameter, each instance of the third parameter being a new data structure.

11. The method of claim 1 , wherein the library element further comprises a value corresponding to a computational functionality implemented by the received QCC.

12. The method of claim 11 , wherein the computational functionality is described as a graph, the value comprising a set of vertices and angles between pairs of vertices.

13. The method of claim 1 , wherein the library element further comprises a value corresponding to a circuit specification of the received QCC.

14. The method of claim 13 , wherein the circuit specification is specified in a quantum assembly language (QASM).

15. The method of claim 1 , wherein the library element further comprises a figure of merit of the received QCC.

16. The method of claim 15 , wherein the figure of merit is a gate count of the received QCC.

17. The method of claim 16 , wherein the figure of merit comprises an expected gate count at runtime of the received QCC.

18. The method of claim 16 , wherein the figure of merit is a circuit depth of the received QCC.

19. The method of claim 16 , wherein the figure of merit an expected circuit depth at runtime of the received QCC.

20. The method of claim 1 , further comprising:
optimizing the received QCC, as a part of transforming the received QCC, to form an optimized QCC, wherein the library element comprises the optimized QCC, wherein the classical hardness score corresponding to the received QCC is a classical hardness score corresponding to the optimized QCC, and wherein the classical hardness score corresponding to the received QCC is a classical hardness score corresponding to the optimized QCC.

21. The method of claim 1 , wherein the adding causes one operation from a set of operations, the set of operations comprising (i) an older version of the library element is deleted, (ii) the older version of the library element is overwritten, and (iii) the older version of the library element is preserved and the library element is added as a new version of the older library element.

22. A computer usable program product comprising one or more non-transitory computer-readable storage media, and program instructions stored on at least one of the one or more storage media, the stored program instructions comprising:
program instructions to configure, in a hybrid data processing environment comprising a classical computing system and a quantum computing system, a repository to hold a plurality of quantum circuit components (QCC(s));
program instructions to transform a received QCC into a library element in the repository, the library element comprising:
a classical hardness score corresponding to a degree of difficulty in simulating the received QCC in the classical computing system;
a quantum hardness score corresponding to a degree of difficulty in implementing the received QCC in the quantum computing system; and

program instructions to add the library element to the repository.

23. The computer usable program product of claim 22 , wherein the computer usable code is stored in a non-transitory computer readable storage device in a data processing system, and wherein the computer usable code is transferred over a network from a remote data processing system.

24. The computer usable program product of claim 22 wherein the computer usable code is stored in a non-transitory computer readable storage device in a server data processing system, and wherein the computer usable code is accessed over a network to a remote data processing system for use in a computer readable storage device associated with the remote data processing system, further comprising:
program instructions to meter use of the computer usable code associated with a request; and
program instructions to generate an invoice based on the metered use.

25. A computer system comprising one or more processors, one or more computer-readable memories, and one or more non-

Assignees

• IBM

Inventors

• Gambetta Jay M
• Cross Andrew W
• Javadiabhari Ali
• Maslov Dmitri

Classifications

• G06N10/80

  Quantum programming, e.g. interfaces, languages or software-development kits for creating or handling programs capable of running on quantum computers; Platforms for simulating or accessing quantum computers, e.g. cloud-based quantum computing · CPC title

• G06N10/20

  Models of quantum computing, e.g. quantum circuits or universal quantum computers · CPC title

• G06F30/20 Primary

  Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30) · CPC title

• G06N10/00

  Quantum computing, i.e. information processing based on quantum-mechanical phenomena · CPC title

• G06F30/32 Primary

  Circuit design at the digital level (reconfigurable circuits G06F30/34) · CPC title