hhtong

airline-hubs

Determine which airports should be hub locations for an airline. Solved using the LeapHybridDQMSampler.

antenna-selection

Demonstrate a max independent set problem with antennas

circuit-equivalence

This demonstration addresses the task of verifying the equivalence of two representations of the design of an electronic circuit, which is of interest in the field of electronic design automation. By converting the representation of each circuit into a graph, the problem can be reduced to that of determining whether the two graphs are isomorphic.

circuit-fault-diagnosis

Find possible failing components on a circuit

clustering

Using a quantum computer to cluster data points

crop-rotation

Finds optimal crop rotations for a set of crops to be planted in a connected set of plots using the LeapHybridDQMSampler.

cryptarithmetic

Cryptarithmetic puzzles are logical puzzles where the goal is to have unique assignments of digits to letters, such that the mathematical expression holds true. This demo only runs with addition puzzles.

D-Wave-VRP

dimod

A shared API for QUBO/Ising samplers.

n-queens

The n-queens problem refers to the problem of placing n queens on an n*n chessboard, such that no two queens are able to attack each other.

hhtong/airline-hubs

Determine which airports should be hub locations for an airline. Solved using the LeapHybridDQMSampler.

hhtong/antenna-selection

Demonstrate a max independent set problem with antennas

hhtong/circuit-equivalence

This demonstration addresses the task of verifying the equivalence of two representations of the design of an electronic circuit, which is of interest in the field of electronic design automation. By converting the representation of each circuit into a graph, the problem can be reduced to that of determining whether the two graphs are isomorphic.

hhtong/clustering

Using a quantum computer to cluster data points

hhtong/cryptarithmetic

Cryptarithmetic puzzles are logical puzzles where the goal is to have unique assignments of digits to letters, such that the mathematical expression holds true. This demo only runs with addition puzzles.

hhtong/D-Wave-VRP

hhtong/dwave-cloud-client

A minimal implementation of the REST interface used to communicate with D-Wave Solver API (SAPI) servers.

hhtong/dwave-hybrid

Hybrid Asynchronous Decomposition Sampler prototype framework.

hhtong/dwavebinarycsp

Map constraint satisfaction problems with binary variables to binary quadratic models.

hhtong/employee-scheduling

Schedule employees using a discrete quadratic model with a hybrid solver.

hhtong/factoring

Factor numbers using a quantum computer

hhtong/graph-coloring

A demo of graph coloring using Leap's hybrid discrete quadratic model (DQM) solver.

hhtong/graph-partitioning

Split a graph into two groups

hhtong/job-shop-scheduling

Determine a schedule for running a set of jobs

hhtong/map-coloring

Select the colors used on the different regions of a map

hhtong/maximum-cut

Solve a max-cut problem using a quantum computer

hhtong/minorminer

minorminer is a heuristic tool for minor embedding: given a minor and target graph, it tries to find a mapping that embeds the minor into the target.

hhtong/nurse-scheduling

A demo of a nurse scheduling model

hhtong/penaltymodel

Utilities and interfaces for using penalty models.

hhtong/pipelines

A minimum vertex problem with pipelines

hhtong/qboost

Solve a binary classification problem with Qboost

hhtong/simple-ocean-programs

Examples of introductory Ocean programs and concepts.

hhtong/sudoku

Solve a Sudoku puzzle with a quantum computer