公开(公告)号：US20230133198A1

公开(公告)日：2023-05-04

申请号：US17517072

申请日：2021-11-02

Applicant: International Business Machines Corporation

Inventor： Antonio MEZZACAPO ,  Charles HADFIELD ,  Rudy Raymond HARRY PUTRA ,  Toshinari ITOKO ,  Takashi IMAMICHI

IPC: G06F17/17 ,  G06N10/00 ,  G06F17/16

Abstract: Systems and techniques that facilitate max-cut approximate solution via quantum relaxation are provided. In various embodiments, a system can comprise a receiver component that can access a graph having a set of vertices and a set of edges. In various instances, the system can comprise a rounding component that can compute a max-cut approximate solution for the graph based on a quantum Hamiltonian relaxation of the graph.

公开(公告)号：US20230142419A1

公开(公告)日：2023-05-11

申请号：US18096108

申请日：2023-01-12

Applicant: International Business Machines Corporation

Inventor： Shaohan Hu ,  Rudy Raymond HARRY PUTRA ,  Stephen WOOD ,  Marco PISTOLA ,  Jay M. GAMBETTA

IPC: G06F8/41 ,  G06N10/20 ,  G06N10/40

CPC classification number: G06F8/41 ,  G06N10/20 ,  G06N10/40

Abstract: In an embodiment, a method includes measuring a first number of control qubits in a quantum algorithm, wherein a quantum circuit representation of the quantum algorithm includes a multiple-controlled-NOT gate. In an embodiment, a method includes measuring a second number of ancilla qubits in a quantum computer. In an embodiment, a method includes comparing the first number and the second number to determine an optimum compilation method for a quantum circuit. In an embodiment, a method includes compiling, in response to the comparison determining the second number is greater than one and less than the difference of the first number and 2, a quantum circuit from the quantum algorithm using a hybrid method.