A characterization of important algorithms for quantum-dot cellular automata

DOI10.1016/S0020-0255(98)10033-6MaRDI QIDQ1818954zbMATH OpenWikidataFDO

Authors John C. Lusth, Brandon Dixon

Publication date 22 November 2000

Published in Information Sciences (Search for Journal in Brave)

zbMATH Keywords

quantum-dot Cellular Automata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Foundations, quantum information and its processing, quantum axioms, and philosophy (81P99) Cellular automata (computational aspects) (68Q80)

Recommendations

• Computing with random quantum dot repulsion
• Quantum-dot devices and quantum-dot cellular automata.
• Quantum-Dot Devices and Quantum-Dot Cellular Automata
• scientific article; zbMATH DE number 1530473
• Cellular automata for nanometer-scale computation

Cites work

• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines

Cited in

(3)

• Fluctuation-driven computing on number-conserving cellular automata
• On behavior of two-dimensional cellular automata with an exceptional rule
• Computing with random quantum dot repulsion

This page was built for publication: A characterization of important algorithms for quantum-dot cellular automata

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