Quantum-circuit packing
AssigneeColdQuanta, Inc.
InventorJoshua Johnathon Cherek
Life of this patent
Estimating the term…
Abstract
A quantum computer system packs quantum circuits into quantum memory so the circuits can be run concurrently. A quantum-circuit packer includes a resource mapper and a packing evaluator. The resource mapper characterizes the task of identifying candidate packings of pending quantum circuits as an integer linear problem (ILP), for which solutions are known. The packing evaluator applies an optimization criterion to select an optimum packing from the candidate packings. The optimum packing is run; the results are assigned to respective circuits that make up the packing.
Claims26
A quantum-circuit-packing process comprising:
- identifying candidate packings, each candidate packing including one or more quantum circuits required resources of which constitute respective disjoint subsets of resources of a quantum memory;
- selecting an optimal packing from the candidate packings based on an optimization criterion;
- and
- running the optimal packing on hardware including the quantum memory,
- wherein the identifying includes:
- characterizing the identifying as an integer linear problem (ILP) regarding mappings of register resources required by the quantum circuits to available register resources;
- and solving the ILP to yield the candidate packings.
A quantum computer system comprising:
- a quantum-circuit packer that
- identifies candidate packings, each candidate packing including one or more circuits required resources of which constitute disjoint subsets of resources of a quantum memory, and
- selects an optimal packing from the candidate packings based on an optimization criterion;
- and
- a quantum-circuit engine that runs the optimal packing on hardware including the quantum memory
- wherein the quantum-circuit packer includes a resource mapper for mapping resource requirements of quantum circuits to available quantum-memory resources, the quantum-circuit packer expressing the identifying of candidate packings as an integer linear problem (ILP) based on the mapping, and solving the ILP to yield the candidate packings.
Dependencies are inferred from the claim text.