Using Boolean Satisfiability for Exact Shuttling in Trapped-Ion Quantum Computers.
Daniel SchönbergerStefan HillmichMatthias BrandlRobert WillePublished in: ASPDAC (2024)
Keyphrases
- boolean satisfiability
- sat solvers
- probabilistic planning
- boolean optimization
- branch and bound algorithm
- randomly generated
- sat solving
- sat problem
- symmetry breaking
- maximum satisfiability
- max sat
- integer linear programming
- sat instances
- random sat instances
- combinatorial problems
- phase transition
- genetic algorithm
- boolean formula
- constraint programming
- orders of magnitude
- dynamic programming