Finding Optimal Implementations of Non-native CNOT Gates Using SAT

DOI10.1007/978-3-030-79837-6_15MaRDI QIDQ5162614zbMATH OpenOpenAlexFDO

Authors Philipp Niemann, Luca Müller, Rolf Drechsler

Publication date 3 November 2021

Published in Reversible Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-79837-6_15

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites work

• A new universal and fault-tolerant quantum basis
• Quantum computation and quantum information. 10th anniversary edition
• The complexity of theorem-proving procedures

Cited in

(2)

• SAT-based {CNOT, \(T\)} quantum circuit synthesis
• Physical synthesis of quantum circuits using Q-learning

This page was built for publication: Finding Optimal Implementations of Non-native CNOT Gates Using SAT

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