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

Contact: provideq@lists.kit.edu

New

23 qubits • superpolynomial speedup

For a given Boolean formula, this algorithm checks if there exists an interpretation that satisfies it.

Solve this problem →

12 qubits • polynomial speedup

For a given undirected, weighted graph, this algorithm finds a cut that is a maximum in some way or another.

Solve this problem →

12 qubits • polynomial speedup

For a given feature model, check for Void Feature Model, Dead Features, False-Optional Features, Redundant Constraints..

Solve this problem →

ProvideQ is made possible by these partners: