公开(公告)号：US20250005424A1

公开(公告)日：2025-01-02

申请号：US18758727

申请日：2024-06-28

Applicant: Google LLC

Inventor： Michael Gabriel Newman ,  Kevin Satzinger ,  Daniel Thomas Sank ,  Nathan Cody Jones

IPC: G06N10/70 ,  G06N10/60

Abstract: Methods, systems, and apparatus for enhanced decoding using in-phase and quadrature information. In one aspect, a method includes obtaining in-phase and quadrature values for multiple measurement operations in a quantum error correction code for a quantum computation; classifying measurement outcomes of the multiple measurement operations using respective in-phase and quadrature values; generating a detector graph of nodes and edges, wherein the detector graph labels detection events that occur in the classified measurement outcomes; assigning weights to the edges of the detector graph using posterior probability distributions of the classified measurement outcomes to generate a weighted detector graph; and executing a decoding process on the weighted detector graph to compute a decoding output of the decoding process, wherein the decoding output predicts an occurrence of errors in the quantum computation.

公开(公告)号：US20220179737A1

公开(公告)日：2022-06-09

申请号：US17541433

申请日：2021-12-03

Applicant: Google LLC

Inventor： Nathan Cody Jones

IPC: G06F11/10 ,  G06N10/00 ,  G06F16/901

Abstract: A computer-implemented method for expanding a set of matched nodes in a partially-matched graph can include obtaining, by a computing system, a partially-matched graph having a matching set, the partially-matched graph including one or more edges and a plurality of nodes, the one or more edges having a matching label. The method can include obtaining at least two unmatched nodes. The method can include determining an alternating path from a first unmatched node of the at least two unmatched nodes to a second unmatched node of the at least two unmatched nodes, the alternating path including at least one edge of the one or more edges. The method can include inverting the matching label of the at least one edge of the alternating path such that the at least two unmatched nodes are included in the matching set of the partially-matched graph.

公开(公告)号：US12204406B2

公开(公告)日：2025-01-21

申请号：US18510754

申请日：2023-11-16

Applicant: Google LLC

Inventor： Nathan Cody Jones

IPC: G06N10/00 ,  G06F11/10 ,  G06F16/901

Abstract: A computer-implemented method for expanding a set of matched nodes in a partially-matched graph can include obtaining, by a computing system, a partially-matched graph having a matching set, the partially-matched graph including one or more edges and a plurality of nodes, the one or more edges having a matching label. The method can include obtaining at least two unmatched nodes. The method can include determining an alternating path from a first unmatched node of the at least two unmatched nodes to a second unmatched node of the at least two unmatched nodes, the alternating path including at least one edge of the one or more edges. The method can include inverting the matching label of the at least one edge of the alternating path such that the at least two unmatched nodes are included in the matching set of the partially-matched graph.

公开(公告)号：US12158807B2

公开(公告)日：2024-12-03

申请号：US17541433

申请日：2021-12-03

Applicant: Google LLC

Inventor： Nathan Cody Jones

IPC: G06N10/00 ,  G06F11/10 ,  G06F16/901

Abstract: A computer-implemented method for expanding a set of matched nodes in a partially-matched graph can include obtaining, by a computing system, a partially-matched graph having a matching set, the partially-matched graph including one or more edges and a plurality of nodes, the one or more edges having a matching label. The method can include obtaining at least two unmatched nodes. The method can include determining an alternating path from a first unmatched node of the at least two unmatched nodes to a second unmatched node of the at least two unmatched nodes, the alternating path including at least one edge of the one or more edges. The method can include inverting the matching label of the at least one edge of the alternating path such that the at least two unmatched nodes are included in the matching set of the partially-matched graph.

公开(公告)号：US20240086279A1

公开(公告)日：2024-03-14

申请号：US18510754

申请日：2023-11-16

Applicant: Google LLC

Inventor： Nathan Cody Jones

IPC: G06F11/10 ,  G06F16/901 ,  G06N10/00

CPC classification number: G06F11/1048 ,  G06F16/9024 ,  G06N10/00

Abstract: A computer-implemented method for expanding a set of matched nodes in a partially-matched graph can include obtaining, by a computing system, a partially-matched graph having a matching set, the partially-matched graph including one or more edges and a plurality of nodes, the one or more edges having a matching label. The method can include obtaining at least two unmatched nodes. The method can include determining an alternating path from a first unmatched node of the at least two unmatched nodes to a second unmatched node of the at least two unmatched nodes, the alternating path including at least one edge of the one or more edges. The method can include inverting the matching label of the at least one edge of the alternating path such that the at least two unmatched nodes are included in the matching set of the partially-matched graph.