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 16 of 16 for “"Universal computation"”.
-
NOISE-ADAPTED AND HARDWARE-EFFICIENT FAULT TOLEARANCE
… on the Bacon-Shor codes, which are capable of universal computation and can tolerate multiple amplitude-damping errors. In the hardware-efficient approach, I analyze teleportation-based EC circuits for rotationally symmetric bosonic codes, taking into account noise affecting qubits, control …
-
Error-free stable computation with polymer-supplemented chemical reaction networks
… chemical reaction networks are very limited in computational power: Angluin et al. and Chen et al. showed that only semilinear predicates and functions are stably computable by CRNs. Qian et al. and others have shown that polymer-supplemented chemical reaction networks are capable of …
-
Complexity Properties of the Cellular Automaton <i>Game of Life</i>
… local structures, and the ability to support universal computation. We examine in this thesis questions about the geometry and criticality of Life. We find that Life has two different regimes with different dimensionalities. In the small scale regime Life shows a fractal dimensionality with Ds …
-
Lorentz Lattice Gases on Graphs
… in showing that these models are not capable of universal computation. Some statistical properties of these models are also analyzed. In the third part (chapter VI) we attempt to partition a pool of workers into teams that will function as independent TSS lines. Such partitioning may be aimed to …
-
Information Processing in Two-Dimensional Cellular Automata
… and as models of massively parallel distributed computation devices. Despite their wide range of applications and the fact that CA are capable of universal computation (under particular constraints), the full potential of these models is unrealized to-date. This is for two reasons: (1) the …
-
Efficient Computation Using Near-Memory Processing and High-Level Synthesis
… the explosion of data, the need for efficient computation—both in terms of performance and energy consumption—has become paramount. This is particularly crucial for processing large-scale data across various workloads. While a universal computation method is highly desirable, the inherent …
-
Quantum Computation with Superconducting Parametric Cavity
… look to explore exciting applications in quantum computation and simulation. In this thesis, we study the use of the parametric cavity to realize continuous variable (CV) quantum computation. We propose and examine in detail the scheme to compute with the microwave photons in the orthogonal …
-
Fault-tolerant Quantum Circuits and Computation Architectures for Image Processing Applications
… after the image points have undergone some computational transformations. While color interpolation has received some attention in Quantum Image Processing, coordinate interpolation has not been explored. In this work, a novel quantum architecture that does image coordinate interpolation is …
-
Powers and Behaviors of Directed Self-assembly
… non-determinism in simulation. It shows that the universal simulation of directed aTAM systems requires undirectedness. A tile assembly model is said to be directed if it always assembles the same final assembly. We distinguish between two types of aTAM systems: cooperative systems and …
-
Exploring the computational power of chemical reaction networks and more deterministic / mechanistic models of molecular computing
… begun to seriously look at molecular systems as computational devices. Molecular computing systems are a particularly promising approach to nanotechnology, as they operate in wet environments (where traditional electronics typically struggle) and they have the potential to easily interface with …
-
Architectures for fault-tolerant quantum computation
… surface code, do not allow for fault-tolerant universal computation without the addition of extra gadgets. One method of achieving universality is through a process of distilling and then consuming high quality 'magic states'. This process adds additional overhead to quantum computation over …
-
Four qubits in two ions: demonstrating a universal gate set with polyqubits
… been manipulated as qudits, which require computation to be carried out in base-<em>d</em> rather than binary. While this is advantageous for problems that naturally deal with <em>d</em>-level variables, most algorithms are agnostic to the numeric base used. In such cases, computation using …
-
TWO PHASE MICROFLUIDICS: NEW TREND IN MODEL IDENTIFICATION
… of numerical solutions for the flow field by Computational Modeling (CM) issue studies devoted to standard droplet generator for separation and segmented flow, bubble and drop formation, breakup and coalescence and then with increasing complexity in large scale microfluidic processors, bubble …
-
On Algebraic Structures and Automaton for Optimal Computer Network Design and Performance Study
… computing environment where CPU-time-extensive computation loads need to get distributed among computing machines through high-speed networks. Instead of relying on empirical models and years of simulation runs needed to the design, verification, and performance evaluation of computer networks, …
-
Designing Quantum Channels Induced by Diagonal Gates
… computing is to combine error resilience with universal computation. Diagonal gates such as the transversal T gate play an important role in implementing a universal set of quantum operations. We introduce a framework that describes the process of preparing a code state, applying a diagonal …
-
Návrh výpočetních struktur v celulárních automatech
za pomocí celulárních automatů. Práce popisuje principy fungování celulárních automatů a zabývá se jejich způsoby jejich využítí pro stanovený cíl. Na 1D a 2D rozměrných celulárních automatech vybraných typů jsou ukázány možné způsoby jak Turingovsky univerzálního výpočtu tak i další řešící …