Method and system for identifying at least one community in a dataset comprising a plurality of elements

A digital computer comprising:

• a central processing unit;
• a display device;
• a communication port for operatively connecting the digital computer to an optimization oracle comprising a quantum processor;
• a memory unit comprising an application for identifying at least one community in a dataset comprising a plurality of elements, the application comprising:
• instructions for providing an indication of a graph, the graph comprising a plurality of nodes and edges, wherein each node is representative of a given element and each edge is representative of a relationship between two given elements of the dataset;
• instructions for providing a metric indicative of an underlying community detection algorithm;
• instructions for obtaining an indication of an upper bound value for a given maximum number of communities to identify in the dataset;
• instructions for encoding each node of the graph using a one-hot encoding method and the indication of an upper bound value for the given maximum number of communities to identify in the dataset;
• instructions for generating a quadratic unconstrained binary optimization problem using the metric indicative of an underlying community detection algorithm and the encoded nodes of the graph;
• instructions for providing the generated quadratic unconstrained binary optimization problem to an optimization oracle;
• instructions for obtaining a solution to the generated quadratic unconstrained binary optimization problem from the optimization oracle, the solution being indicative of the identified communities in the dataset;
• and
• instructions for providing an indication of the identified communities in the dataset.

A non-transitory computer readable storage medium for storing computer-executable instructions which, when executed, cause a digital computer to perform a method for identifying at least one community in a dataset comprising a plurality of elements, the method comprising:

• providing an indication of a graph, the graph comprising a plurality of nodes and edges, wherein each node is representative of a given element and each edge is representative of a relationship between two given elements of the dataset;
• providing a metric indicative of an underlying community detection algorithm;
• obtaining an indication of an upper bound value for a given maximum number of communities to identify in the dataset;
• encoding each node of the graph using a one-hot encoding method and the indication of an upper bound value for the given maximum number of communities to identify in the dataset;
• generating a quadratic unconstrained binary optimization problem using the metric indicative of an underlying community detection algorithm and the encoded nodes of the graph;
• providing the generated quadratic unconstrained binary optimization problem to an optimization oracle;
• obtaining a solution to the generated quadratic unconstrained binary optimization problem from the optimization oracle, the solution being indicative of the identified communities in the dataset;
• and
• providing an indication of the identified communities in the dataset.

A method for identifying at least one community in a dataset comprising a plurality of elements, the method comprising:

• providing an indication of a graph, the graph comprising a plurality of nodes and edges, wherein each node is representative of a given element and each edge is representative of a relationship between two given elements of the dataset;
• providing a metric indicative of an underlying community detection algorithm;
• obtaining an indication of an upper bound value for a given maximum number of communities to identify in the dataset;
• encoding each node of the graph using a one-hot encoding method and the indication of an upper bound value for the given maximum number of communities to identify in the dataset;
• generating a quadratic unconstrained binary optimization problem using the metric indicative of an underlying community detection algorithm and the encoded nodes of the graph;
• providing the generated quadratic unconstrained binary optimization problem to an optimization oracle;
• solving the generated quadratic unconstrained binary optimization problem using the optimization oracle to provide a solution to the generated quadratic unconstrained binary optimization problem, the solution being indicative of the identified communities in the dataset;
• and
• providing an indication of the identified communities in the dataset.