Results 221 to 230 of about 825 (258)

Molecular quantum-dot cellular automata

2003 Third IEEE Conference on Nanotechnology, 2003. IEEE-NANO 2003., 2004
Quantum-dot cellular automata (QCA) is an approach to computing which eliminates the need for transistors by representing binary digits as charge configurations rather than current levels. Coulomb interactions provide device-device coupling without current flow.
B. Isaksen, C.S. Lent
openaire   +1 more source

Quantum-dot cellular automata: computing by filed polarization

Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451), 2003
As CMOS technology continues its monotonic shrink, computing with quantum dots remains a goal in nanotechnology research. Quantum-dot cellular automata (QCA) is a paradigm for low-power, high-speed, highly dense computing that could be realized in a variety of materials systems.
openaire   +1 more source

Structures in quantum cellular automata

Physica B+C, 1988
Abstract For cellular automaton machines getting increasingly smaller in size, a regime will be entered where effects due to matter waves may become dominant. Studying the evolution of one-dimensional and locally interacting cellular automata governed by generalized quantum mechanical rules, we discuss irreversibility as it appears in the evolution ...
Gerhard Grössing, Anton Zeilinger
openaire   +1 more source

Quantum-dot cellular automata adders

2003 Third IEEE Conference on Nanotechnology, 2003. IEEE-NANO 2003., 2004
In this paper, a novel quantum-dot cellular automata (QCA) adder design is presented that reduces the number of QCA cells compared to previously reported designs. The proposed one-bit QCA adder structure is based on a new algorithm that requires only three majority gates and two inverters for the QCA addition. By connecting n one-bit QCA adders, we can
null Wei Wang, K. Walus, G.A. Jullien
openaire   +1 more source

One-Dimensional Quantum Cellular Automata

2011
We define and study quantum cellular automata (QCA). We show that they are reversible and that the neighborhood of the inverse is the opposite of the neighborhood. We also show that QCA always admit, modulo shifts, a two-layered block representation. Note that the same two-layered block representation result applies also over infinite configurations ...
Arrighi, Pablo, Nesme, Vincent, Werner, Reinhard F.   +2 more
openaire   +2 more sources

Cellular automata for quantum systems

Journal of Physics A: Mathematical and General, 1993
Cellular automata for modelling quantum systems are presented. The mass at each site is updated according to rules that depend on the masses of neighbouring sites. An essential feature of these local rules is that mass and probability are conserved.
openaire   +1 more source

Quantum Walks and Quantum Cellular Automata

2008
The quantum walk is a generalization of classical random walks. Considerable work has been recently investigated on quantum walks in connection with quantum computing. The walk can be considered as a class of quantum cellular automata. There exists a one-to-one correspondence between them in a more general setting. Moreover we consider another class of
openaire   +1 more source

Periodicity in Quantum Cellular Automata

2012
Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures are based on the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical systems and processes.
Georgios I. Tsormpatzoglou, Ioannis G. Karafyllidis   +1 more
openaire   +1 more source

Metabolomics in cancer research and emerging applications in clinical oncology

Ca-A Cancer Journal for Clinicians, 2021
Daniel R Schmidt, David G Kirsch, Caroline A Lewis   +2 more
exaly  

Radiation therapy‐associated toxicity: Etiology, management, and prevention

Ca-A Cancer Journal for Clinicians, 2021
Kyle Wang
exaly