Automated optimization of large-scale quantum circuits with continuous parameters

Patent metadata

Field	Value
Publication number	US-11580283-B2
Application number	US-202117165707-A
Country	US
Kind code	B2
Filing date	Feb 2, 2021
Priority date	Oct 19, 2017
Publication date	Feb 14, 2023
Grant date	Feb 14, 2023

Abstract

The disclosure describes the implementation of automated techniques for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers. The disclosure shows how to handle continuous gate parameters and report a collection of fast algorithms capable of optimizing large-scale-scale quantum circuits. For the suite of benchmarks considered, the techniques described obtain substantial reductions in gate counts. In particular, the techniques in this disclosure provide better optimization in significantly less time than previous approaches, while making minimal structural changes so as to preserve the basic layout of the underlying quantum algorithms. The results provided by these techniques help bridge the gap between computations that can be run on existing quantum computing hardware and more advanced computations that are more challenging to implement in quantum computing hardware but are the ones that are expected to outperform what can be achieved with classical computers.

First claim

What is claimed is:

1. A method for optimizing quantum circuits, comprising:
receiving a netlist representation and building a corresponding directed acyclic graph (DAG) representation from the netlist representation, the netlist representation and the DAG representation containing information about a first list of quantum gates that form the quantum circuits;
performing, based on the netlist representation and the DAG representation, a phase-polynomial reduction operation on the information about the first list of quantum gates to produce a second list of quantum gates that has functional equivalence to the first list of quantum gates, a number of quantum gates in the second list of quantum gates being smaller than a number of quantum gates in the first list of quantum gates, at least some of a reduction in the number of quantum gates between the first list of quantum gates and the second list of quantum gates being based on a continuous range of rotation angles, and the netlist representation and the DAG representation being updated concurrently whenever a reduction in the number of quantum gates in the first list of quantum gates is found as part of the phase-polynomial reduction operation;
generating a new netlist representation containing information about the second list of quantum gates; and
providing the new netlist representation to implement a functionality of the quantum circuits using the second list of quantum gates.

2. The method of claim 1 , further comprising performing a pre-processing operation prior to performing the phase-polynomial reduction operation.

3. The method of claim 2 , wherein the information about the first list of quantum gates to which the pre-processing operation is applied includes information about NOT gates, CNOT gates, Toffoli gates, Hadamard gates, and R z (θ) gates.

4. The method of claim 1 , further comprising performing a Hadamard gate reduction operation prior to performing the phase-polynomial reduction operation.

5. The method of claim 1 , further comprising performing a single qubit gate cancelation operation prior to performing the phase-polynomial reduction operation.

6. The method of claim 1 , further comprising performing a two-qubit gate cancelation operation prior to performing the phase-polynomial reduction operation.

7. The method of claim 1 , wherein:
performing the phase-polynomial reduction operation includes implementing a set of rewriting rules, and
the set of rewriting rules includes one or both of gate count preserving rewriting rules or gate count reducing rewriting rules.

8. The method of claim 1 , wherein the phase-polynomial reduction operation includes a reduction of R z (θ) gates where a rotation angle θ is any value in a range between 0 and 2π.

9. The method of claim 1 , further comprising iteratively performing one or more gate cancelation operations or gate reduction operations along with the phase-polynomial reduction operation.

10. The method of claim 1 , further comprising iteratively performing a fixed sequence of optimization operations that includes the phase-polynomial reduction operation, wherein the phase-polynomial reduction operation is not the first optimization operation in the fixed sequence and is performed only once in the fixed sequence.

11. A non-transitory computer-readable storage medium storing code that when executed by a processor causes the processor to perform an optimization of quantum circuits, comprising:
code for receiving a netlist representation and building a corresponding directed acyclic graph (DAG) representation from the netlist representation, the netlist representation and the DAG representation containing information about a first list of quantum gates that form the quantum circuits;
code for performing, based on the netlist representation and the DAG representation, a phase-polynomial reduction operation on the information about the first list of quantum gates to produce a second list of quantum gates that has functional equivalence to the first list of quantum gates, a number of quantum gates in the second list of quantum gates being smaller than a number of quantum gates in the first list of quantum gates, at least some of a reduction in the number of quantum gates between the first list of quantum gates and the second list of quantum gates being based on a continuous range of rotation angles, and the netlist representation and the DAG representation being updated concurrently whenever a reduction in the number of quantum gates in the first list of quantum gates is found as part of the phase-polynomial reduction operation;
code for generating a new netlist representation containing information about the second list of quantum gates; and
code for providing the new netlist representation to implement a functionality of the quantum circuits using the second list of quantum gates.

12. The non-transitory computer-readable storage medium of claim 11 , further comprising code for performing a pre-processing operation prior to performing the phase-polynomial reduction operation.

13. The non-transitory computer-readable storage medium of claim 11 , wherein the information about the first list of quantum gates to which the pre-processing operation is applied includes information about NOT gates, CNOT gates, Toffoli gates, Hadamard gates, and R z (θ) gates.

14. The non-transitory computer-readable storage medium of claim 11 , further comprising code for performing a Hadamard gate reduction operation prior to performing the phase-polynomial reduction operation.

15. The non-transitory computer-readable storage medium of claim 11 , further comprising code for performing a single qubit gate cancelation operation prior to performing the phase-polynomial reduction operation.

16. The non-transitory computer-readable storage medium of claim 11 , further comprising code for performing a two-qubit gate cancelation operation prior to performing the phase-polynomial reduction operation.

17. The non-transitory computer-readable storage medium of claim 11 , wherein:
the code for performing the phase-polynomial reduction operation includes code for implementing a set of rewriting rules, and
the set of rewriting rules includes one or both of gate count preserving rewriting rules or gate count reducing rewriting rules.

18. The non-transitory computer-readable storage medium of claim 11 , wherein the phase-polynomial reduction operation includes a reduction of R z (θ) gates where a rotation angle θ is any value in a range between 0 and 2π.

19. The non-transitory computer-readable storage medium of claim 11 , further comprising code for iteratively performing one or more gate cancelation operations or gate reduction operations along with the phase-polynomial reduction operation.

20. The non-transitory computer-readable storage medium of claim 11 , further comprising code for iteratively performing a fixed sequence of optimization operations that includes the phase-polynomial reduction operation, wherein the phase-polynomial reduction operation is not the first optimization operation in the fixed sequence and is performed only once in the fixed sequence.

Assignees

• Univ Maryland
• Ionq Inc

Inventors

• Nam Yunseong
• Maslov Dmitri
• Childs Andrew
• Ross Neil Julien
• Su Yuan

Classifications

• G06N10/60

  Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms · CPC title

• G06N10/20 Primary

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

• G06F30/327 Primary

  Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist · CPC title

• G06F30/39

  Circuit design at the physical level (physical level design for reconfigurable circuits G06F30/347) · CPC title

• B82Y10/00

  Nanotechnology for information processing, storage or transmission, e.g. quantum computing or single electron logic · CPC title