Quantum circuit topology selection based on frequency collisions between qubits

Patent metadata

Field	Value
Publication number	US-11615333-B2
Application number	US-201916449976-A
Country	US
Kind code	B2
Filing date	Jun 24, 2019
Priority date	Jun 24, 2019
Publication date	Mar 28, 2023
Grant date	Mar 28, 2023

Abstract

Systems, computer-implemented methods, and computer program products that can facilitate quantum circuit topology selection based on frequency collisions between qubits, are described. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a simulation component that simulates operation of qubits in a subgraph topology of a graph representing a topology of a quantum circuit to determine a quantity of frequency collisions between the qubits. The computer executable components can further comprise a selection component that selects a quantum circuit topology based on the quantity of frequency collisions between the qubits.

First claim

What is claimed is:

1. A system, comprising:
a memory that stores computer executable components; and
a processor that executes the computer executable components stored in the memory, wherein the computer executable components comprise:
a simulation component that simulates operation of qubits in a subgraph topology of a graph representing a topology of a quantum circuit to determine a quantity of frequency collisions between the qubits; and
a selection component that selects a quantum circuit topology based on the quantity of frequency collisions between the qubits.

2. The system of claim 1 , wherein the subgraph topology comprises at least one of a two graph node topology, a three graph node topology, a multiple graph node topology, a rotated version of the subgraph topology, or a defined collision generating topology.

3. The system of claim 1 , wherein the computer executable components further comprise:
a model component that generates the graph, and wherein the graph comprises graph nodes representing the qubits and one or more graph edges coupled to the graph nodes representing one or more qubit coupling devices coupled to the qubits.

4. The system of claim 1 , wherein the computer executable components further comprise:
a match component that matches the subgraph topology to a collision generating topology.

5. The system of claim 1 , wherein the computer executable components further comprise:
a scale component that determines a quantity of one or more instances of the subgraph topology in the graph and determines a total quantity of frequency collisions corresponding to the topology of the quantum circuit based on the quantity of the one or more instances of the subgraph topology in the graph and the quantity of frequency collisions between the qubits in the subgraph topology.

6. The system of claim 1 , wherein the computer executable components further comprise:
a parameter component that determines one or more parameters corresponding to at least one of the qubits, the topology of the quantum circuit, or the quantum circuit that provide a defined yield.

7. The system of claim 1 , wherein the selection component selects the quantum circuit topology from a plurality of quantum circuit topologies based on at least one of a defined yield or a defined quantity of frequency collisions between at least two qubits of one or more of the plurality of quantum circuit topologies, thereby facilitating at least one of improved efficiency or performance of at least one of the simulation component or the processor.

8. The system of claim 1 , wherein the computer executable components further comprise:
a scale component that determines a total quantity of frequency collisions corresponding to the topology of the quantum circuit.

9. A computer-implemented method, comprising:
simulating, by a system operatively coupled to a processor, operation of qubits in a subgraph topology of a graph representing a topology of a quantum circuit to determine a quantity of frequency collisions between the qubits; and
selecting, by the system, a quantum circuit topology based on the quantity of frequency collisions between the qubits.

10. The computer-implemented method of claim 9 , wherein the subgraph topology comprises at least one of a two graph node topology, a three graph node topology, a multiple graph node topology, a rotated version of the subgraph topology, or a defined collision generating topology.

11. The computer-implemented method of claim 9 , further comprising:
generating, by the system, the graph, wherein the graph comprises graph nodes representing the qubits and one or more graph edges coupled to the graph nodes representing one or more qubit coupling devices coupled to the qubits.

12. The computer-implemented method of claim 9 , further comprising:
matching, by the system, the subgraph topology to a collision generating topology.

13. The computer-implemented method of claim 9 , further comprising:
determining, by the system, a quantity of one or more instances of the subgraph topology in the graph; and
determining, by the system, a total quantity of frequency collisions corresponding to the topology of the quantum circuit based on the quantity of the one or more instances of the subgraph topology in the graph and the quantity of frequency collisions between the qubits in the subgraph topology.

14. The computer-implemented method of claim 9 , further comprising:
determining, by the system, one or more parameters corresponding to at least one of the qubits, the topology of the quantum circuit, or the quantum circuit that provide a defined yield.

15. The computer-implemented method of claim 9 , wherein the selecting comprises:
selecting, by the system, the quantum circuit topology from a plurality of quantum circuit topologies based on at least one of a defined yield or a defined quantity of frequency collisions between at least two qubits of one or more of the plurality of quantum circuit topologies, thereby facilitating at least one of improved efficiency or performance of the processor.

16. The computer-implemented method of claim 9 , further comprising:
determining, by the system, a total quantity of frequency collisions corresponding to the topology of the quantum circuit.

17. A computer program product facilitating quantum circuit topology selection based on frequency collisions between qubits, the 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:
simulate, by the processor, operation of qubits in a subgraph topology of a graph representing a topology of a quantum circuit to determine a quantity of frequency collisions between the qubits; and
select, by the processor, a quantum circuit topology based on the quantity of frequency collisions between the qubits.

18. The computer program product of claim 17 , wherein the subgraph topology comprises at least one of a two graph node topology, a three graph node topology, a multiple graph node topology, a rotated version of the subgraph topology, or a defined collision generating topology.

19. The computer program product of claim 17 , wherein the program instructions are further executable by the processor to cause the processor to:
generate, by the processor, the graph, and wherein the graph comprises graph nodes representing the qubits and one or more graph edges coupled to the graph nodes representing one or more qubit coupling devices coupled to the qubits.

20. The computer program product of claim 17 , wherein the program instructions are further executable by the processor to cause the processor to:
match, by the processor, the subgraph topology to a collision generating topology.

21. The computer program product of claim 17 , wherein the program instructions are further executable by the processor to cause the processor to:
determine, by the processor, a quantity of one or more instances of the subgraph topology in the graph; and
determine, by the processor, a total quantity of frequency collisions corresponding to the topology of the quantum circuit based on the quantity of the one or more instances of the subgraph topology in the graph and the quantity of frequency collisions between the qubits in the subgraph topology.

22. The computer program product of claim 17 , wherein the program instructions are further executable by the processor to c

Assignees

• IBM

Inventors

• Hertzberg Jared Barney
• Topaloglu Rasit Onur

Classifications

• G06N10/20 Primary

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

• G06F16/9024 Primary

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• G06F30/30

  Circuit design · CPC title

• G06F30/20

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

• G06N10/00 Primary

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