QBSolv-like Tabu Search

QBSolv Like Tabu Search breaks down the problem and solves the parts individually using a classic solver that uses Tabu Search. This particular implementation uses hybrid.TabuSubproblemSampler as a sampler for the subproblems to achieve a QBSolv like behaviour.

Note

This solver is only available for commercial and academic licenses.

Compatible Backends

Backend	Default
DWave

Initialization

Python

from luna_quantum.solve.parameters.algorithms.base_params.tabu_search_params import TabuSearchBaseParams
from luna_quantum.solve.parameters.algorithms.search_algorithms.qbsolv_like_tabu_search import QBSolvLikeTabuSearch

algorithm = QBSolvLikeTabuSearch(
    backend=None,
    decomposer_size=50,
    rolling=True,
    rolling_history=0.15,
    max_iter=100,
    max_time=5,
    convergence=3,
    target=None,
    rtol=1e-05,
    atol=1e-08,
    tabu_search_params=TabuSearchBaseParams(
        num_reads=None,
        tenure=None,
        timeout=100
    )
)

Usage

Python

from luna_quantum.algorithms import QBSolvLikeTabuSearch

algorithm = QBSolvLikeTabuSearch()
solve_job = algorithm.run(model, name="my-solve-job")