Welcome to the ProvideQ Toolbox! ProvideQ aims to enable the Enablers by providing Quantum Readiness for Optimization Providers. We collect quantum and classical algorithms for well-known optimization problems and implement solution strategies to decide which algorithms can provide the best solutions for a specific problem instance. This website represents the current prototype of our toolbox. It is currently in active development.
Feel free to try it out!
Our GitHub: @ProvideQ API documentation: OpenAPI definition Contact: provideq@lists.kit.edu
Solve a problem Demonstrators
For a given Boolean formula, this algorithm checks if there exists an interpretation that satisfies it.
Solve this problem→
For a given Boolean formula, this algorithm counts the number of satisfying assignments.
Solve this problem→
For a given undirected, weighted graph, this algorithm finds a cut that is a maximum in some way or another.
Solve this problem→
Check whether a given feature model in the UVL format is void or if it has dead features.
Solve this problem→
For a quadratic term with binary decision variables, find the variable assignment minimizing the term.
Solve this problem→
sub-routines QUBO Clustering
What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?
Solve this problem→
Given a list of cities and the distances between them, find the shortest possible route that visits each city exactly once and returns to the origin city.
Solve this problem→
Given a list of items with weights and values, find a subset of items with the highest total value up to a certain weight limit.
Solve this problem→
Enter a molecule to get chemical information about its behavior on a quantum scale.
Solve this problem→
New! execute optimize mitigate
Process an OpenQASM circuit, including execution, optimization and mitigation.
Solve this problem→
Find optimal routing paths to fulfill customer orders through a Time-Expanded Network without splitting an order's demand.
Solve this problem→
The MIP problem is a mathematical optimization problem where some or all of the variables are restricted to be integers.
Demonstrate→
This demonstrator will compute the ground state energy for a given molecule using VQE algorithm.
Demonstrate→