Qbsolv,a decomposing solver, finds a minimum value of a large quadratic unconstrained binary optimization (QUBO) problem by splitting it into pieces solved either via a D-Wave system or a classical tabu solver. (Note that qbsolv by default uses its internal classical solver. Access to a D-Wave system must be arranged separately.)
Features
- Access to a D-Wave system must be arranged separately
- qbsolv executes a quadratic unconstrained binary optimization (QUBO) problem represented in a file
- qbsolv QUBO Input File Format
- A decomposing solver that finds a minimum value of a large quadratic unconstrained binary optimization (QUBO) problem
- The pieces are solved using a classical solver running the tabu algorithm
- qbsolv also enables configuring a D-Wave system as the solver
Project Samples
Categories
Quantum ComputingLicense
Apache License V2.0Follow Qbsolv
You Might Also Like
Gen AI apps are built with MongoDB Atlas
MongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Qbsolv!