Ottimizzazione binaria quadratica non vincolata (QUBO)
Da R2023a
Molti problemi di ottimizzazione combinatoria possono essere formulati come problemi di ottimizzazione binaria quadratica non vincolata (QUBO). Questi problemi includono gli Traveling Salesperson Problem with QUBO, Capacitated Vehicle Routing Problem e Feature Selection QUBO (Quadratic Unconstrained Binary Optimization). Per informazioni di background, vedere What Is a QUBO Problem?
Inoltre, molti computer quantistici attuali e proposti utilizzano QUBO (o un Ising equivalente) come tipo di problema. Per provare a trovare una soluzione quantistica a un problema di ottimizzazione combinatoria, si formula un problema QUBO, quindi si passa il problema all'hardware quantistico per la soluzione. Attualmente, MATLAB® Support Package for Quantum Computing non supporta direttamente alcun hardware quantistico per la risoluzione di problemi QUBO.
Oggetti
qubo | Quadratic Unconstrained Binary Optimization |
quboResult | Result of solving QUBO problem |
tabuSearch | Tabu search algorithm for QUBO
solve |
tabuSearchResult | Result of solve for Tabu search algorithm |
qaoa | Quantum approximate optimization algorithm (QAOA) for solving QUBO problem (Da R2024b) |
qaoaResult | Result of solving QUBO problem using QAOA (Da R2024b) |
Funzioni
evaluateObjective | Evaluate QUBO (Quadratic Unconstrained Binary Optimization) objective |
solve | Solve QUBO (Quadratic Unconstrained Binary Optimization) problem |
maxcut2qubo | Convert max-cut problem to QUBO (Quadratic Unconstrained Binary Optimization) (Da R2024b) |
qubo2ising | Convert QUBO problem to Ising observable (Da R2024b) |
Argomenti
- What Is a QUBO Problem?
This topic introduces the basics of Quadratic Unconstrained Binary Optimization (QUBO) problems.
- Workflow for QUBO Problems
Learn the steps for formulating and solving a QUBO problem.
- Constraints in QUBO Problems
Include constraints in a QUBO problem by adding penalty terms.
- Tabu Search Algorithm
Learn about the tabu search heuristic algorithm used to solve QUBO problems.
- Verify Optimality by Solving QUBO as MILP
Convert a QUBO problem to a mixed-integer linear programming (MILP) problem, and solve the problem using
intlinprog. - Traveling Salesperson Problem with QUBO
Convert a Traveling Salesperson Problem (TSP) to a QUBO problem and solve the problem.
- Capacitated Vehicle Routing Problem
Express and solve a capacitated vehicle routing problem using QUBO.
- Feature Selection QUBO (Quadratic Unconstrained Binary Optimization)
Find the most relevant predictors in a data set using a QUBO problem formulation.
Esempi in primo piano
Solve Max-Cut Problem Using QAOA
Use the Quantum Approximate Optimization Algorithm (QAOA) to solve max-cut problems.
