US 2025/0061360 A1 · QUANTUM ORACLE DECOMPOSITION FOR SIMULATING QUANTUM COMPUTING SYSTEMS AND APPLICATIONS

Abstract

In various examples, systems and methods for decomposition of quantum oracles for simulating quantum circuits are provided. A simulation platform may receive as input a representation of a quantum circuit that comprises decomposable Boolean functions that define a quantum oracle and convert a Boolean representation of the quantum oracle to a set of Boolean functions. The Boolean functions may be used to create an oracle tensor network (e.g., a MPO sub-tensor network) comprising an exact representation of the Boolean representation of the quantum oracle. The oracle tensor network representation may be incorporated into a tensor network representation of the quantum circuit and passed to the simulation platform in order to simulate the quantum circuit.

Claims21

Dependent claims

A processor comprising:

one or more circuits to generate, using a representation of at least one quantum oracle for a quantum circuit, a tensor network corresponding to the at least one quantum oracle, the tensor network comprising:
a root control qubit tensor of at least three modes;
one or more intermediate control qubit tensors of at least four modes, and at least one target qubit tensor of three modes,
wherein the one or more intermediate control qubit tensors form a chain between the root control qubit tensor and the at least one target qubit tensor based at least on a plurality of Boolean functions corresponding to the representation of the at least one quantum oracle.

1 more element

Dependencies are inferred from the claim text.

Quantum oracle decomposition for simulating quantum computing systems and applications

Life of this patent

Quantum oracle decomposition for simulating quantum computing systems and applications

Life of this patent

Abstract

Claims21