Modeling the Costas array problem in QUBO for quantum annealing

DOI10.1007/978-3-031-04148-8_10zbMath1499.90179OpenAlexW4226302134MaRDI QIDQ2163794

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)

Uses Software

• MiniZinc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The unconstrained binary quadratic programming problem: a survey
• Quadratic reformulations of nonlinear binary optimization problems
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Results of the enumeration of costas arrays of order 29
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• A general approach for constraint solving by local search
• Common distance vectors between Costas arrays
• Compact quadratizations for pseudo-Boolean functions
• Large-scale parallelism for constraint-based local search: the costas array case study
• Generalised arc consistency for the AllDifferent constraint: an empirical survey
• A review of Costas arrays
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Distributed Constraint-Based Local Search
• Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models