Boolean satisfiability in quantum compilation

DOI10.1098/RSTA.2019.0161MaRDI QIDQ4993497zbMATH OpenOpenAlexWikidataFDO

Authors Mathias Soeken, Giulia Meuli, F. Mozafari, Heinz Riener, Giovanni De Micheli, Bruno V. Schmitt

Publication date 15 June 2021

Published in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1098/rsta.2019.0161

zbMATH Keywords

Boolean satisfiabilitycomputer-aided designlogic synthesisquantum compilationquantum computingquantum programming languages

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• \(Qcompiler\): quantum compilation with the CSD method
• Basic circuit compilation techniques for an ion-trap quantum machine
• Technology mapping for single target gate based circuits using Boolean functional decomposition
• SAT-based {CNOT, \(T\)} quantum circuit synthesis
• Analyzing heuristic-based randomized search strategies for the quantum circuit compilation problem

Cites work

• A continuous approach to inductive inference
• Complexity of reversible circuits and their quantum implementations
• Constant-optimized quantum circuits for modular multiplication and exponentiation
• Efficient CNF encoding of Boolean cardinality constraints
• Efficient quantum circuits for diagonal unitaries without ancillas
• Evaluating ESOP Optimization Methods in Quantum Compilation Flows
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5863326 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2080928 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• scientific article; zbMATH DE number 3325539 (Why is no real title available?)
• Logical Reversibility of Computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum resource estimates for computing elliptic curve discrete logarithms
• SAT-based {CNOT, \(T\)} quantum circuit synthesis
• SAT-Based Model Checking without Unrolling
• Synthesis and optimization of reversible circuits -- a survey
• The complexity of theorem-proving procedures
• Time/Space Trade-Offs for Reversible Computation
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

Cited in

(3)

• Certified quantum computation in Isabelle/HOL
• Deterministic algorithms for compiling quantum circuits with recurrent patterns
• Architecture-aware synthesis of phase polynomials for NISQ devices

This page was built for publication: Boolean satisfiability in quantum compilation

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