Quantum-dot cellular automata: computing with coupled quantum dots

Porod, Wolfgang; Lent, Craigs; Bernstein, Gary H.; Orlov, Alexei O.; Hamlani, Islamsha; Snider, Gregory L.; Merz, J. L.

doi:10.1080/002072199133265

Cited by 125 publications

(61 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such type of adder appears in several publications, particularly in construction of the arithmetical circuits in quantumdot cellular automata [37]. Original version of the adder using not-majority gates was suggested by Minsky in his designs of artificial neural networks [31].…”

Section: Construction Of Adder Via Not-majority Gatesmentioning

confidence: 99%

See 1 more Smart Citation

Computation with Competing Patterns in Life-Like Automaton

Mart́ınez

Adamatzky²,

Morita³

et al. 2010

Game of Life Cellular Automata

View full text Add to dashboard Cite

Summary. We study a Life-like cellular automaton rule B2/S2345 where a cell in state '0' takes state '1' if it has exactly two neighbors in state '1' and the cell remains in the state '1' if it has between two and five neighbors in state '1.' This automaton is a discrete analog spatially extended chemical media, combining both properties of sub-excitable and precipitating chemical media. When started from random initial configuration B2/S2345 automaton exhibits chaotic behavior. Configurations with low density of state '1' show emergence of localized propagating patterns and stationary localizations. We construct basic logical gates and elementary arithmetical circuits by simulating logical signals with mobile localizations reaction propagating geometrically restricted by stationary non-destructible localizations. Values of Boolean variables are encoded into two types of patterns -symmetric (False) and asymmetric (True) patterns -which compete for the 'empty' space when propagate in the channels. Implementations of logical gates and binary adders are illustrated explicitly.

show abstract

Section: Construction Of Adder Via Not-majority Gatesmentioning

confidence: 99%

“…The resultant pattern is recorded at the output channel. Similarly gates in quantum-dot cellular automata are designed [37].…”

Section: Implementation Of Logic Gates and Beyondmentioning

confidence: 99%

Computation with Competing Patterns in Life-Like Automaton

Mart́ınez

Adamatzky²,

Morita³

et al. 2010

Game of Life Cellular Automata

View full text Add to dashboard Cite

show abstract

“…Such type of adder appears in several publications, particularly in construction of the arithmetical circuits in quantum-dot cellular automata [29,36]. Original version of the adder using not-majority gates was suggested by Minsky in his designs of artificial neural networks [24].…”

Section: Implementation Of Binary Adder With Not-majority Gatesmentioning

confidence: 99%

Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345

Mart́ınez

Morita

Adamatzky

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behavior yet capable for purposeful computation. The automaton implements Boolean gates via patterns which compete for the space when propagate in channels. Values of Boolean variables are encoded into two types of patterns -symmetric (False) and asymmetric (True). We construct basic logical gates and elementary arithmetical circuits by simulating logical signals using glider reactions taking place in the channels built of non-destructible still lifes. We design a binary adder of majority gates realised in rule B2/S2345.

show abstract

“…The electrons are allowed to jump between the individual quantum dots in a cell by the mechanism of quantum mechanical tunneling. Tunnelling is possible on the nanometer scale when the electronic wavefunction sufficiently `leaks" out of the confining potential of each dot, and the rate of these jumps may be controlled during fabrication by the physical separation between neighbouring dots [10][11] . When an input is applied to the input cell, the binary information propagates from left to the right due to the coulomb repulsion between the electrons of neighboring cells.…”

Section: Qca Basicmentioning

confidence: 99%