Boolean satisfiability in quantum compilation

DOI10.1098/rsta.2019.0161zbMath1462.81065OpenAlexW2996201965WikidataQ92182027 ScholiaQ92182027MaRDI QIDQ4993497

Giovanni De Micheli, Giulia Meuli, Mathias Soeken, Heinz Riener, F. Mozafari, 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

quantum computingBoolean satisfiabilitylogic synthesiscomputer-aided designquantum programming languagesquantum compilation

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (1)

Deterministic algorithms for compiling quantum circuits with recurrent patterns

Cites Work

• A continuous approach to inductive inference
• Quantum resource estimates for computing elliptic curve discrete logarithms
• SAT-based {CNOT, \(T\)} quantum circuit synthesis
• Complexity of reversible circuits and their quantum implementations
• Synthesis and optimization of reversible circuits—a survey
• SAT-Based Model Checking without Unrolling
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Time/Space Trade-Offs for Reversible Computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Efficient quantum circuits for diagonal unitaries without ancillas
• Evaluating ESOP Optimization Methods in Quantum Compilation Flows
• The complexity of theorem-proving procedures
• Logical Reversibility of Computation
• Principles and Practice of Constraint Programming – CP 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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