Quantum simulation
AssigneeUchicago Argonne, LLC
InventorsYuri Alexeev, Alexey Galda, Danylo Lykov
Life of this patent
Estimating the term…
Abstract
A method for reducing computation time while simulating quantum computation on a classical computer by performing an algorithm used to determine the most efficient input contraction, the method including receiving, by a processor, a tensor network representing a quantum circuit, computing, by the processor, an ordering for the tensor network by an ordering algorithm, contracting, by the processor, the tensor network by eliminating indices according to the ordering resulting in a contracted tensor network, and returning, by the processor, the contracted tensor network.
Claims15
A method for reducing computation time while simulating quantum computation on a classical computer by performing an algorithm used to determine a most efficient input contraction, the method comprising:
- receiving, by a processor, a read-in of a quantum approximate optimization algorithm (QAOA) circuit having a first plurality of gates;
- reduce, by a gate-optimizing system, gates in the QAOA circuit to a second plurality of gates which is less than the first plurality of gates;
- represent the QAOA having the second plurality of gates as a tensor network;
- computing, by the processor, an ordering for the tensor network by an ordering algorithm;
- contracting, by the processor, the tensor network by eliminating indices according to the ordering resulting in a contracted tensor network;
- and
- returning, by the processor, the contracted tensor network.
A system for reducing computation time while simulating quantum computation on a classical computer by performing an algorithm used to determine the most efficient input contraction, the system comprising:
- a computer comprising a processor and a memory, wherein the processor is set up to perform operations, embodied in instructions on computer readable medium, to:
- receive a read-in of a quantum approximate optimization algorithm (QAOA) circuit having a first plurality of gates;
- reduce, by a gate-optimizing system, gates in the QAOA circuit to a second plurality of gates which is less than the first plurality of gates;
- represent the QAOA having the second plurality of gates as a tensor network;
- optimize tensor network through implementation of diagonal gates;
- compute an index contraction ordering for the tensor network;
- merge a portion of indices of the tensor network to contract the tensor network according to the index contraction ordering;
- compute a contracted tensor network;
- and
- return the contracted tensor network.
Dependencies are inferred from the claim text.