INTELLIGENT PROVISIONING OF QUANTUM PROGRAMS TO QUANTUM HARDWARE

    公开(公告)号:US20240354615A1

    公开(公告)日:2024-10-24

    申请号:US18111649

    申请日:2023-02-20

    Inventor: Shailendra Singh

    CPC classification number: G06N10/40 G06N10/80

    Abstract: Arrangements for intelligent provisioning of quantum programs to quantum hardware are provided. In some aspects, a quantum program of a plurality of quantum programs to be executed on target quantum hardware may be received from a digital computing device. The quantum program may be scanned and optimized for minimum quantum bit (qubit) consumption using one or more machine learning models. Based on an accuracy requirement of a quantum program output, a criticality level of the quantum program may be identified. In addition, a qubit count associated with the quantum program, indicating a number of qubits used to perform quantum processing of the quantum program, may be identified. Based on the identified criticality level and qubit count, an allocation of qubits together with target quantum hardware may be assigned for deploying the quantum program. The target quantum hardware may ingest the quantum program and perform quantum processing of the quantum program.

    SIMULATED ANNEALING DEVICE AND SIMULATED ANNEALING METHOD

    公开(公告)号:US20240289640A1

    公开(公告)日:2024-08-29

    申请号:US18569705

    申请日:2021-06-18

    Inventor: Takuya ARAKI

    CPC classification number: G06N5/01 G06N10/80

    Abstract: A simulated annealing device includes a solving unit which solves a SAT (Boolean Satisfiability Testing) expressed in a CNF (Conjunctive Normal Form) form with constraint information indicating one or more constraints imposed on a combinatorial optimization problem converted, to obtain sets of values of multiple variables of the combinatorial optimization problem that satisfy the one or more constraints, which are candidate solutions to the combinatorial optimization problem.

    Accelerating hybrid quantum/classical algorithms

    公开(公告)号:US12056577B1

    公开(公告)日:2024-08-06

    申请号:US18180513

    申请日:2023-03-08

    CPC classification number: G06N10/80 G06F9/3001 G06F17/16 G06N10/00 G06N10/70

    Abstract: In a general aspect, hybrid quantum/classical algorithms are executed in a computing system. A first set of values representing a measurement of a reduced density matrix (RDM) is obtained. The first set of values is based on sampling quantum states generated by a quantum processor. A classical processor generates a second, different set of values to represent the measurement of the RDM. The second set of values is constructed based on the first set of values by a process that imposes one or more n-representability conditions on the second set of values to represent the measurement of the RDM.

    EDGE COMPUTING ORCHESTRATION
    8.
    发明公开

    公开(公告)号:US20240220846A1

    公开(公告)日:2024-07-04

    申请号:US18557763

    申请日:2021-04-30

    CPC classification number: G06N10/80

    Abstract: According to an example embodiment, an edge computing orchestration device is configured to obtain resource data indicating available edge computing resources, wherein the available edge computing resources comprises at least classical edge computing resources and quantum edge computing resources; obtain software to be executed using the edge computing resources, wherein the software comprises at least classical software and quantum software; identify classical tasks and quantum tasks in the software based on the at least classical software and quantum software; and assign the classical tasks and the quantum tasks to be executed on the available edge computing resources. Devices, methods and computer programs are disclosed.

    Partitioned template matching and symbolic peephole optimization

    公开(公告)号:US11983605B2

    公开(公告)日:2024-05-14

    申请号:US17082844

    申请日:2020-10-28

    Abstract: Systems and techniques that facilitate partitioned template matching and/or symbolic peephole optimization are provided. In various embodiments, a system can comprise a template component, which can perform template matching on a Clifford circuit associated with a set of qubits. In various aspects, the system can comprise a partition component, which can partition, prior to the template matching, the Clifford circuit into a computation stage, a Pauli stage, and a SWAP stage. In various instances, the template matching can be performed on the computation stage. In various embodiments, the system can comprise a symbolic component, which can select a subset of qubits from the set of qubits, rewrite at least one entangling gate in the computation stage such that a target of the at least one entangling gate is in the subset of qubits, and replace the at least one rewired entangling gate with a symbolic Pauli gate. In various cases, the symbolic Pauli gate can be a Pauli gate that is controlled by a symbolic variable. In various aspects, the system can comprise a peephole component, which can perform peephole optimization on the subset of qubits with the symbolic Pauli gate by implementing a dynamic programming algorithm.

Patent Agency Ranking