Results 11 to 20 of about 2,342 (247)
Molecular Quantum-Dot Cellular Automata
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.
Beth Claire Isaksen (17548176)
core +3 more sources
Quantum cloning by cellular automata [PDF]
We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1-to-2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations for improving the performance with given resources.
D'ARIANO, GIACOMO +2 more
openaire +3 more sources
Ergodicity of quantum cellular automata [PDF]
We define a class of dynamical maps on the quasi-local algebra of a quantum spin system, which are quantum analogues of probabilistic cellular automata. We develop criteria for such a system to be ergodic, i.e., to possess a unique invariant state. Intuitively, ergodicity obtains if the local transition operators exhibit sufficiently large disorder ...
Richter, S., Werner, R. F.
openaire +3 more sources
The Group Structure of Quantum Cellular Automata [PDF]
25 pages, 10 ...
Freedman, Michael +2 more
openaire +2 more sources
Quantum Dot Cellular Automata Check Node Implementation for LDPC Decoders [PDF]
The quantum dot Cellular Automata (QCA) is an emerging nanotechnology that has gained significant research interest in recent years. Extremely small feature sizes, ultralow power consumption, and high clock frequency make QCA a potentially attractive ...
Ruo Roch, Massimo +4 more
core +1 more source
Classical artificial neural networks, built from elementary units, possess enormous expressive power. Here we investigate a quantum neural network architecture, which follows a similar paradigm.
Carollo, Federico +5 more
core +1 more source
Quantum cellular automata for quantum error correction and density classification
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant manner on all ...
Guedes, Thiago L. M. +2 more
core +1 more source
Quantum walks and reversible cellular automata [PDF]
15 pages, minor corrections, some references ...
Konno, N. +3 more
openaire +2 more sources
Cellular Automata and Kan Extensions [PDF]
In this paper, we formalize precisely the sense in which the application of cellular automaton to partial configuration is a natural extension of its local transition function through the categorical notion of Kan extension.
Spicher, Antoine +2 more
core +1 more source

