Local optimization of quantum circuits
AssigneeInternational Business Machines Corporation
InventorPaul Nation
Life of this patent
Estimating the term…
Abstract
Techniques facilitating local optimization of quantum circuits are provided. In one example, a computer-implemented method comprises applying, by a device operatively coupled to a processor, respective weights to matrix elements of a first matrix corresponding to a quantum circuit according to respective numbers of quantum gates between respective pairs of qubits in the quantum circuit; transforming, by the device, the first matrix into a second matrix based on the respective weights of the matrix elements; and permuting, by the device, respective qubits in the quantum circuit according to the second matrix, resulting in a permuted quantum circuit.
Claims20
A system comprising:
- a memory that stores computer executable components;
- and
- a processor that executes computer executable components stored in the memory, wherein the computer executable components comprise:
- a matrix weighting component that applies respective weights to matrix elements of a first matrix corresponding to a quantum circuit according to respective numbers of quantum gates between respective pairs of qubits in the quantum circuit;
- a bandwidth reduction component that transforms the first matrix into a second matrix based on the respective weights of the matrix elements;
- and
- a permutation component that permutes respective qubits in the quantum circuit according to the second matrix, resulting in a permuted quantum circuit, wherein the bandwidth reduction component comprises a search component that generates an ordered list of qubits based on the respective weights of the matrix elements, and wherein the bandwidth reduction component transforms the first matrix into the second matrix based on the ordered list of qubits.
A computer-implemented method comprising:
- applying, by a device operatively coupled to a processor, respective weights to matrix elements of a first matrix corresponding to a quantum circuit according to respective numbers of quantum gates between respective pairs of qubits in the quantum circuit;
- transforming, by the device, the first matrix into a second matrix based on the respective weights of the matrix elements;
- and
- permuting, by the device, respective qubits in the quantum circuit according to the second matrix, resulting in a permuted quantum circuit, wherein the transforming comprises:
- generating an ordered list of qubits based on the respective weights of the matrix elements;
- and
- transforming the first matrix into the second matrix based on the ordered list of qubits.
A computer program product for local optimization of a quantum circuit, 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:
- apply respective weights to matrix elements of a first matrix corresponding to a quantum circuit according to respective numbers of quantum gates between respective pairs of qubits in the quantum circuit;
- transform the first matrix into a second matrix based on the respective weights of the matrix elements;
- permute respective qubits in the quantum circuit according to the second matrix, resulting in a permuted quantum circuit;
- generate an ordered list of qubits based on the respective weights of the matrix elements;
- and
- transform the first matrix into the second matrix based on the ordered list of qubits.
A system comprising:
- a memory that stores computer executable components;
- and
- a processor that executes computer executable components stored in the memory, wherein the computer executable components comprise:
- a graph weighting component that applies respective weights to edges of a graph corresponding to a quantum circuit according to respective numbers of quantum gates between respective pairs of qubits in the quantum circuit;
- a graph modification component that repositions vertexes of the graph based on degrees of respective ones of the vertexes in the graph and the weights of respective ones of the edges of the graph, resulting in a modified graph;
- and
- a permutation component that permutes respective qubits in the quantum circuit according to the modified graph, resulting in a permuted quantum circuit, wherein the graph modification component comprises a search component that generates an ordered list of qubits based on the degrees of the respective ones of the vertexes of the graph and the weights of the respective ones of the edges of the graph, and wherein the graph modification component repositions the vertexes of the graph based on the ordered list of qubits.
A computer-implemented method comprising:
- applying, by a device operatively coupled to a processor, respective weights to edges of a graph corresponding to a quantum circuit according to respective numbers of quantum gates between respective pairs of qubits in the quantum circuit;
- repositioning, by the device, vertexes of the graph based on degrees of respective ones of the vertexes of the graph and the weights of respective ones of the edges of the graph, resulting in a modified graph;
- and
- permuting, by the device, respective qubits in the quantum circuit according to the modified graph, resulting in a permuted quantum circuit, wherein the repositioning comprises:
- generating an ordered list of qubits based on the degrees of the respective ones of the vertexes of the graph and the weights of the respective ones of the edges of the graph;
- and
- repositioning the vertexes of the graph based on the ordered list of qubits.
Dependencies are inferred from the claim text.