Quantum circuit mapping based on incremental and parallel SAT solving

DOI10.4230/LIPICS.SAT.2024.29MaRDI QIDQ6864409zbMATH OpenFDO

Authors Jiong Yang, Yaroslav A. Kharkov, Yunong Shi, Marijn J. H. Heule, Bruno Dutertre

Publication date 3 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2024.29

zbMATH Keywords

incremental solvingparallel solvingquantum compilationquantum computingSAT solving

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• Chinese remainder encoding for Hamiltonian cycles
• Distributed cube and conquer with Paracooba
• Efficient CNF encoding of Boolean cardinality constraints
• scientific article; zbMATH DE number 799789 (Why is no real title available?)
• Learning rate based branching heuristic for SAT solvers
• ManySAT: a parallel SAT solver
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• PSATO: A distributed propositional prover and its application to quasigroup problems
• QMaxSAT: A partial Max-SAT solver
• Quantum computation and quantum information. 10th anniversary edition
• Scalable SAT solving in the cloud

This page was built for publication: Quantum circuit mapping based on incremental and parallel SAT solving

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