Complexity of reversible circuits and their quantum implementations

DOI10.1016/j.tcs.2016.01.011zbMath1335.68093OpenAlexW2247222799WikidataQ59242186 ScholiaQ59242186MaRDI QIDQ2634672

Mathias Soeken, Nabila Abdessaied, Matthew Amy, Rolf Drechsler

Publication date: 18 February 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.011

zbMATH Keywords

synthesisupper boundscomplexity analysisreversible circuitsquantum circuitsreversible functionstechnology mapping

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits ⋮ Simulation of a multidimensional input quantum perceptron ⋮ OR-Toffoli and OR-Peres Reversible Gates ⋮ Efficient Realization of Toffoli and NCV Circuits for IBM QX Architectures ⋮ Boolean satisfiability in quantum compilation ⋮ An improved and cost reduced quantum circuit generator approach for image encoding applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Young subgroups for reversible computers.
• On figures of merit in reversible and quantum logic designs
• Upper bounds for reversible circuits based on Young subgroups
• Reversible Computing
• Quantum Circuit Optimization by Hadamard Gate Reduction
• A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis

This page was built for publication: Complexity of reversible circuits and their quantum implementations