Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 17 of 17 for “"Quantum Cellular Automata"”.
-
Quantum Cellular Automata: Theory and Applications
This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. …
-
Quantum cellular automata: Theory and applications
This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. …
-
Quantum cellular automata and few-donor devices in silicon
… The novel devices presented are the silicon quantum cellular automata cell and the few-donor device implanted with controlled numbers of phosphorous donors. In addition, the thesis presents novel measurements of a phosphorous implanted silicon double-dot device, a crucial building block of a …
-
Quantum complexity: quantum mutual information, complex networks, and emergent phenomena in quantum cellular automata
Emerging quantum simulator technologies provide a new challenge to quantum many body theory. Quantifying the emergent order in and predicting the dynamics of such complex quantum systems requires a new approach. We develop such an approach based on complex network analysis of quantum mutual …
-
Aspects of quantum game theory
Quantum game theory is an exciting new topic that combines the physical behaviour of information in quantum mechanical systems with game theory, the mathematical description of conflict and competition situations, to shed new light on the fields of quantum control and quantum information. This …
-
Symmetry protected subspaces in quantum simulations
… to identify symmetry protected subspaces of quantum unitary operators in the σz basis. The algorithm’s time complexity is linear to the size of the subspace. This subspace constrains states in quantum time evolution to a smaller subspace. If this subspace is small enough, a classical computer …
-
Causality and the arrow of time in process theories
… and its interplay with the arrow of time in quantum process theories and beyond. The framework of process theories is particularly intuitive since it is accompanied by a diagrammatic formalism. Its formal underpinnings lie in Categorical Quantum Mechanics, a field which has recently seen …
-
Entanglement and complexity in quantum elementary cellular automata
… level, or can it be found at the underlying quantum level as well? We approach these questions by exploring models consistent with basic quantum theory but which also hold promise for exhibiting complex behaviors -- a set of models we call the quantum elementary cellular automata (QECA). …
-
Thereshold logic technology mapping for emerging nanotechnologies
… technologies, such as memristors, spintronic, quantum cellular automata (QCA) and resonant tunneling devices (RTD), such a logic design strategy seems to be more appropriate than the traditional switch-based CMOS circuitry. Thus, research and development of synthesis and verification methods …
-
Sampling combinatorial energy landscapes by classical and quantum computation
… high-performance computers and near-term quantum computers. Such sampling techniques not only provide effective heuristics for solving combinatorial optimization problems, but also enable an explanation of physical phenomena that rely on features of the energy landscape other than the …
-
Σχεδιασμός και προσομοίωση νανοηλεκτρικών κυκλωμάτων κβαντικών κυψελιδωτών αυτομάτων
… from their extremely reduced feature sizes. Quantum Cellular Automata (QCA) is one of the most promising emerging technologies in the fast growing area of nanoelectronics. QCA relies mostly on Coulombic interactions and uses innovative processing techniques which are very different from the …
-
On Algorithms, Separability and Cellular Automata in Quantum Computing
… Part I of this thesis, we present a new model of quantum cellular automata (QCA) based on local unitary operations. We will describe a set of desirable properties for any QCA model, and show that all of these properties are satisfied by the new model, while previous models of QCA do not. We will …
-
Density functional theory and model-based studies of charge transfer and molecular self-organization on surfaces:
Molecular-based quantum cellular automata (m-QCA), as an extension of quantum-dot QCAs, offer a novel alternative in which binary information can be encoded in the molecular charge configuration of a cell and propagated via nearest-neighbor Coulombic cell-cell interactions. Appropriate …
-
Coherence of Coupled Dangling-Bond Pairs on the Silicon Surface
… bond is an atomic-scale entity that acts like a quantum dot. By shrinking the scale of the quantum dots and the spacing between them, we expect that the excess-electron tunneling rate increases dramatically with decreasing inter-dot separation, while decoherence scales weakly. Our analysis of the …
-
Simulace kvantových celulárních automatů
Tato bakalářská práce popisuje vznik a účel kvantových celulárních automatů (QCA), jejich funkci a fyzikální zhotovení. Popisuje také kvantově celulární buňku a zhotovení jednoduchých obvodů pomocí těchto buněk. Práce obsahuje přehled použitých simulátorů, detailně popisuje simulátor QCAD a …
-
Field-Coupled Nano-Magnetic Logic Systems
… to the proper functionality of Magnetic Cellular Automata (MCA) devices (p. 36). It was significant to explore how fabrication defects affected the coupling reliability of MCA architectures. Both ferromagnetic and anti-ferromagnetic coupling architectures were found to be robust to common …
-
Μελέτη υλοποίησης κβαντικών υπολογιστικών συστημάτων
… a set of alternative ways of representing quantum information has been studied to lead to more efficient implementation schemes for quantum computers. The two approaches studied were two. The first one was based on nearest-neighbor grids, which can execute quantum computation by applying …