2026-07-20T14:48:48Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16692 2024-03-06T10:58:04Z ddc:004 open_access

Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond Berent, Lucas Burgholzer, Lukas Wille, Robert Satisfiability Quantum Computing Design Automation Clifford Circuits Boolean Satisfiability (SAT) techniques are well-established in classical computing where they are used to solve a broad variety of problems, e.g., in the design of classical circuits and systems. Analogous to the classical realm, quantum algorithms are usually modelled as circuits and similar design tasks need to be tackled. Thus, it is natural to pose the question whether these design tasks in the quantum realm can also be approached using SAT techniques. To the best of our knowledge, no SAT formulation for arbitrary quantum circuits exists and it is unknown whether such an approach is feasible at all. In this work, we define a propositional SAT encoding that, in principle, can be applied to arbitrary quantum circuits. However, we show that, due to the inherent complexity of representing quantum states, constructing such an encoding is not feasible in general. Therefore, we establish general criteria for determining the feasibility of the proposed encoding and identify classes of quantum circuits fulfilling these criteria. We explicitly demonstrate how the proposed encoding can be applied to the class of Clifford circuits as a representative. Finally, we empirically demonstrate the applicability and efficiency of the proposed encoding for Clifford circuits. With these results, we lay the foundation for continuing the ongoing success of SAT in classical circuit and systems design for quantum circuits. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Lucas Berent and Lukas Burgholzer and Robert Wille 2022 Is Part Of LIPIcs, Volume 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SAT.2022.18 urn:nbn:de:0030-drops-166927 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.18 eng https://creativecommons.org/licenses/by/4.0/legalcode