Title:
WEIGHTED ALTERNATING PATHS IN GRAPHS FOR QUANTUM COMPUTING
Document Type and Number:
WIPO Patent Application WO/2022/119764
Kind Code:
A3
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.
More Like This:
Inventors:
JONES NATHAN CODY (US)
Application Number:
PCT/US2021/060965
Publication Date:
July 14, 2022
Filing Date:
November 29, 2021
Export Citation:
Assignee:
GOOGLE LLC (US)
International Classes:
G06N10/20; G06N10/60; G06N10/70
Other References:
GABOW HAROLD N HAL@CS COLORADO EDU: "Data Structures for Weighted Matching and Extensions to b-matching and f-factors", ACM TRANSACTIONS ON ALGORITHMS, ACM, US, vol. 14, no. 3, 22 June 2018 (2018-06-22), pages 1 - 80, XP058673555, ISSN: 1549-6325, DOI: 10.1145/3183369
Attorney, Agent or Firm:
WORKMAN, J. Parks (US)
Download PDF:
Previous Patent: SYSTEMS AND METHODS FOR PLANNING A MEDICAL ENVIRONMENT
Next Patent: COMBINATION PILLOW AND CLOTHING ARTICLE
Next Patent: COMBINATION PILLOW AND CLOTHING ARTICLE