Implementing a one-bit reversible full adder using quantum-dot cellular automata

DOI10.1007/s11128-014-0782-2zbMath1305.81054OpenAlexW1992995103MaRDI QIDQ481653

Zahra Mohammadi, Majid Mohammadi

Publication date: 12 December 2014

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-014-0782-2

zbMATH Keywords

QCAreversiblefull adderQCA1 gate

Mathematics Subject Classification ID

Quantum computation (81P68) Cellular automata (computational aspects) (68Q80) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (4)

User authentication based on quantum-dot cellular automata using reversible logic for secure nanocommunication ⋮ Toward efficient design of reversible logic gates in quantum-dot cellular automata with power dissipation analysis ⋮ Fault-tolerant design of a shift register at the nanoscale based on quantum-dot cellular automata ⋮ Modular design of ultra-efficient reversible full adder-subtractor in QCA with power dissipation analysis

Cites Work

• Unnamed Item
• Heuristic methods to use don't cares in automated design of reversible and quantum logic circuits
• On figures of merit in reversible and quantum logic designs
• Irreversibility and Heat Generation in the Computing Process
• Logical Reversibility of Computation

This page was built for publication: Implementing a one-bit reversible full adder using quantum-dot cellular automata