Quantum computing compiling
AssigneeBull SAS
InventorsArnaud Gazda, Simon Martiel
Life of this patent
Estimating the term…
Abstract
Examples relate to a quantum computing compiling method that includes ordering quantum gates of a nearest neighbor quantum circuit in function of dependencies between the quantum gates to obtain a quantum gates hierarchical order. The hierarchical order includes a succession of front lines comprising multiple respective quantum gates of the nearest neighbor quantum circuit. The method includes successively selecting, for each front line, and following the hierarchical order, a shuttling for each respective quantum gate of the front line. The shuttling selection is, for each front line, based on a predefined constraint.
Claims15
A quantum computing compiling method, comprising:
- ordering quantum gates of a nearest neighbor quantum circuit in function of dependencies between the quantum gates to obtain a quantum gates hierarchical order, the hierarchical order comprising a succession of front lines comprising multiple respective quantum gates of the nearest neighbor quantum circuit;
- and
- successively selecting, for each front line, and following the hierarchical order, a shuttling for each respective quantum gate of the front line,
- wherein the shuttling selection is, for each front line, based on a predefined constraint.
A computer system comprising a processor, a storage coupled to the processor and an instruction set to cooperate with the processor and the storage, the processor configured to:
- order quantum gates of a nearest neighbor quantum circuit in function of dependencies between the quantum gates to obtain a quantum gates hierarchical order, the hierarchical order comprising a succession of front lines comprising multiple respective quantum gates of the nearest neighbor quantum circuit;
- and
- successively select, for each front line, and following the hierarchical order, a shuttling for each respective quantum gate of the front line, wherein the shuttling selection is, for each front line, based on a predefined constraint.
A non-transitory machine-readable storage medium executable by a processor, the machine-readable storage medium comprising:
- instructions to order quantum gates of a nearest neighbor quantum circuit in function of dependencies between the quantum gates to obtain a quantum gates hierarchical order, the hierarchical order comprising a succession of front lines comprising multiple respective quantum gates of the nearest neighbor quantum circuit;
- and
- instructions to successively select, for each front line, and following the hierarchical order, a shuttling for each respective quantum gate of the front line, wherein the shuttling selection is, for each front line, based on a predefined constraint.
Dependencies are inferred from the claim text.