Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
From MaRDI portal
Publication:5919301
DOI10.1007/s10288-019-00424-yzbMath1428.90143OpenAlexW2990475267WikidataQ126662356 ScholiaQ126662356MaRDI QIDQ5919301
Gary A. Kochenberger, Yu Du, Fred Glover
Publication date: 13 January 2020
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-019-00424-y
combinatorial optimizationquantum computingquadratic unconstrained binary optimization (QUBO)quantum bridge analytics
Related Items
Leveraging special-purpose hardware for local search heuristics, Applications and Computational Advances for Solving the QUBO Model, Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, Modeling the Costas array problem in QUBO for quantum annealing, Penalty weights in QUBO formulations: permutation problems, Penalty and partitioning techniques to improve performance of QUBO solvers, An introduction to variational quantum algorithms for combinatorial optimization problems, Optimization via rejection-free partial neighbor search, Optimal Seating Assignment in the COVID-19 Era via Quantum Computing, Garden optimization problems for benchmarking quantum annealers, Combinatorial optimization through variational quantum power method, Models in quantum computing: a systematic review, QBoost for regression problems: solving partial differential equations, A QUBO formulation for the tree containment problem, Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, 4OR comes of age. Editorial note, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem, Statistical quality assessment of Ising-based annealer outputs, Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing, Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
Uses Software
Cites Work
- The unconstrained binary quadratic programming problem: a survey
- Quadratic reformulations of nonlinear binary optimization problems
- Efficiently embedding QUBO problems on adiabatic quantum computers
- Pseudo-Boolean optimization
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- How probability arises in quantum mechanics
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The maximum clique problem
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- Path relinking for unconstrained binary quadratic programming
- Quantum adiabatic machine learning
- A new modeling and solution approach for the set-partitioning problem
- A new approach for modeling and solving set packing problems
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
- QUBO formulation for the contact map overlap problem
- Quantum adiabatic Markovian master equations
- Aggregating inconsistent information
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
