Modeling the Costas array problem in QUBO for quantum annealing

DOI10.1007/978-3-031-04148-8_10MaRDI QIDQ2163794zbMATH OpenOpenAlexFDO

Authors Philippe Codognet

Publication date 11 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-04148-8_10

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Quantum computation (81P68)

Recommendations

• Penalty and partitioning techniques to improve performance of QUBO solvers
• Quantum annealing versus digital computing. An experimental comparison
• Building an iterative heuristic solver for a quantum annealer
• Quantum annealing learning search for solving QUBO problems
• A case study in programming a quantum annealer for hard operational planning problems

Cites work

• scientific article; zbMATH DE number 3473554 (Why is no real title available?)
• scientific article; zbMATH DE number 2083802 (Why is no real title available?)
• A general approach for constraint solving by local search
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• A review of Costas arrays
• Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
• Common distance vectors between Costas arrays
• Compact quadratizations for pseudo-Boolean functions
• Distributed Constraint-Based Local Search
• Generalised arc consistency for the AllDifferent constraint: an empirical survey
• Large-scale parallelism for constraint-based local search: the costas array case study
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Optimization by simulated annealing
• Quadratic reformulations of nonlinear binary optimization problems
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• Quantum spin glasses, annealing and computation
• Results of the enumeration of costas arrays of order 29
• The unconstrained binary quadratic programming problem: a survey

Cited in

(4)

• Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
• Penalty and partitioning techniques to improve performance of QUBO solvers
• Garden optimization problems for benchmarking quantum annealers
• FEqa: Finite element computations on quantum annealers

Describes a project that uses

Uses Software

• MiniZinc

This page was built for publication: Modeling the Costas array problem in QUBO for quantum annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163794)