Some content of this application is unavailable at the moment.
If this situation persist, please contact us atFeedback&Contact
1. (WO2019064050) METHOD AND SYSTEM FOR SOLVING A MINIMUM CONNECTED DOMINATING SET PROBLEM USING QUANTUM ANNEALING FOR DISTANCE OPTIMIZATION AND USE THEREOF
Latest bibliographic data on file with the International Bureau    Submit observation

Pub. No.: WO/2019/064050 International Application No.: PCT/IB2017/055916
Publication Date: 04.04.2019 International Filing Date: 27.09.2017
IPC:
G06F 17/11 (2006.01) ,G06F 19/12 (2011.01) ,G06N 99/00 (2010.01) ,H04B 10/27 (2013.01) ,H04L 12/751 (2013.01) ,H04W 40/24 (2009.01) ,H04W 84/18 (2009.01)
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
F
ELECTRIC DIGITAL DATA PROCESSING
17
Digital computing or data processing equipment or methods, specially adapted for specific functions
10
Complex mathematical operations
11
for solving equations
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
F
ELECTRIC DIGITAL DATA PROCESSING
19
Digital computing or data processing equipment or methods, specially adapted for specific applications
10
Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
12
for modelling or simulation in systems biology, e.g. probabilistic or dynamic models, gene-regulatory networks, protein interaction networks or metabolic networks
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
N
COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
99
Subject matter not provided for in other groups of this subclass
H ELECTRICITY
04
ELECTRIC COMMUNICATION TECHNIQUE
B
TRANSMISSION
10
Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
27
Arrangements for networking
H ELECTRICITY
04
ELECTRIC COMMUNICATION TECHNIQUE
L
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
12
Data switching networks
70
Packet switching systems
701
Routing or path finding
751
Topology update or discovery
H ELECTRICITY
04
ELECTRIC COMMUNICATION TECHNIQUE
W
WIRELESS COMMUNICATION NETWORKS
40
Communication routing or communication path finding
24
Connectivity information management, e.g. connectivity discovery or connectivity update
H ELECTRICITY
04
ELECTRIC COMMUNICATION TECHNIQUE
W
WIRELESS COMMUNICATION NETWORKS
84
Network topologies
18
Self-organising networks, e.g. ad hoc networks or sensor networks
Applicants:
1QB INFORMATION TECHNOLOGIES INC. [CA/CA]; 458-550 Burrard Street Vancouver, British Columbia V6C 2B5, CA
Inventors:
CHANGIZ REZAEI, Seyed Saeed; CA
WOODS, Brad; CA
RONAGH, Pooya; CA
SAMLI, Kausar; CA
Agent:
FASKEN MARTINEAU DUMOULIN LLP; 800 Place Victoria, Suite 3700 P.O. Box 242, Stock Exchange Tower Montréal, Québec H4Z 1E9, CA
Priority Data:
Title (EN) METHOD AND SYSTEM FOR SOLVING A MINIMUM CONNECTED DOMINATING SET PROBLEM USING QUANTUM ANNEALING FOR DISTANCE OPTIMIZATION AND USE THEREOF
(FR) PROCÉDÉ ET SYSTÈME DE RÉSOLUTION DE PROBLÈME D'ENSEMBLE DOMINANT CONNECTÉ MINIMAL PAR RECUIT QUANTIQUE POUR OPTIMISATION DE DISTANCE ET UTILISATION DE CELUI-CI
Abstract:
(EN) A method and an apparatus are disclosed for determining a minimum connected dominating set in a graph, the method comprising obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other nodes of the plurality of nodes; generating a corresponding constrained binary quadratic programming problem using the generated distance table; providing the corresponding constrained binary quadratic programming problem to a quantum annealing solver; obtaining at least one approximate solution from the quantum annealing solver; post-processing the at least one approximate solution and providing the post-processed at least one approximate solution.
(FR) L'invention concerne un procédé et un appareil permettant de déterminer un ensemble dominant connecté minimal dans un graphe, le procédé consistant à obtenir une indication d'un graphe d'entrée, le graphe d'entrée comprenant une pluralité de nœuds et une pluralité d'arêtes ; produire une table de distances comprenant pour chaque nœud du graphe d'entrée, une indication d'une distance entre le nœud donné et chacun des autres nœuds de la pluralité de nœuds ; produire un problème de programmation quadratique binaire avec contraintes correspondant en utilisant la table de distances produite ; fournir le problème de programmation quadratique binaire avec contraintes correspondant à un résolveur par recuit quantique ; obtenir au moins une solution approximative par le résolveur par recuit quantique ; post-traiter la ou les solutions approximatives et fournir la ou les solutions approximatives post-traitées.
front page image
Designated States: AE, AG, AL, AM, AO, AT, AU, AZ, BA, BB, BG, BH, BN, BR, BW, BY, BZ, CA, CH, CL, CN, CO, CR, CU, CZ, DE, DJ, DK, DM, DO, DZ, EC, EE, EG, ES, FI, GB, GD, GE, GH, GM, GT, HN, HR, HU, ID, IL, IN, IR, IS, JO, JP, KE, KG, KH, KN, KP, KR, KW, KZ, LA, LC, LK, LR, LS, LU, LY, MA, MD, ME, MG, MK, MN, MW, MX, MY, MZ, NA, NG, NI, NO, NZ, OM, PA, PE, PG, PH, PL, PT, QA, RO, RS, RU, RW, SA, SC, SD, SE, SG, SK, SL, SM, ST, SV, SY, TH, TJ, TM, TN, TR, TT, TZ, UA, UG, US, UZ, VC, VN, ZA, ZM, ZW
African Regional Intellectual Property Organization (ARIPO) (BW, GH, GM, KE, LR, LS, MW, MZ, NA, RW, SD, SL, ST, SZ, TZ, UG, ZM, ZW)
Eurasian Patent Office (AM, AZ, BY, KG, KZ, RU, TJ, TM)
European Patent Office (EPO) (AL, AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HR, HU, IE, IS, IT, LT, LU, LV, MC, MK, MT, NL, NO, PL, PT, RO, RS, SE, SI, SK, SM, TR)
African Intellectual Property Organization (BF, BJ, CF, CG, CI, CM, GA, GN, GQ, GW, KM, ML, MR, NE, SN, TD, TG)
Publication Language: English (EN)
Filing Language: English (EN)