Layered architecture for quantum computing

We develop a layered quantum computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent techniques for implementing circuit-model quantum computing and introduce several new methods, with an emphasis on employing surface code quantum error correction. In doing so, we propose a new quantum computer architecture based on optical control of quantum dots. The timescales of physical hardware operations and logical, error-corrected quantum gates differ by several orders of magnitude. By dividing functionality into layers, we can design and analyze subsystems independently, demonstrating the value of our layered architectural approach. Using this concrete hardware platform, we provide resource analysis for executing fault-tolerant quantum algorithms for integer factoring and quantum simulation, finding that the quantum dot architecture we study could solve such problems on the timescale of days.Comment: 27 pages, 20 figure

Low-cost, high-resolution, fault-robust position and speed estimation for PMSM drives operating in safety-critical systems

In this paper it is shown how to obtain a low-cost, high-resolution and fault-robust position sensing system for permanent magnet synchronous motor drives operating in safety-critical systems, by combining high-frequency signal injection with binary Hall-effect sensors. It is shown that the position error signal obtained via high-frequency signal injection can be merged easily into the quantization-harmonic-decoupling vector tracking observer used to process the Hall-effect sensor signals. The resulting algorithm provides accurate, high-resolution estimates of speed and position throughout the entire speed range; compared to state-of-the-art drives using Hall-effect sensors alone, the low speed performance is greatly improved in healthy conditions and also following position sensor faults. It is envisaged that such a sensing system can be successfully used in applications requiring IEC 61508 SIL 3 or ISO 26262 ASIL D compliance, due to its extremely high mean time to failure and to the very fast recovery of the drive following Hall-effect sensor faults at low speeds. Extensive simulation and experimental results are provided on a 3.7 kW permanent magnet drive

Decoupling and iterative approaches to the control of discrete linear repetitive processes

This paper reports new results on the analysis and control of discrete linear repetitive processes which are a distinct class of 2D discrete linear systems of both systems theoretic and applications interest. In particular, we first propose an extension to the basic state-space model to include a coupling term previously neglected but which arises in some applications and then proceed to show how computationally efficient control laws can be designed for this new model

Prototyping a Capacitive Sensing Device for Gesture Recognition

Capacitive sensing is a technology that can detect proximity and touch. It can also be utilized to measure position and acceleration of gesture motions. This technology has many applications, such as replacing mechanical buttons in a gaming device interface, detecting respiration rate without direct contact with the skin, and providing gesture sensing capability for rehabilitation devices. In this thesis, an approach to prototype a capacitive gesture sensing device using the Eagle PCB design software is demonstrated. In addition, this paper tested and evaluated the resulting prototype device, validating the effectiveness of the approach

Polynomial bounds for decoupling, with applications

Let f(x) = f(x_1, ..., x_n) = \sum_{|S| <= k} a_S \prod_{i \in S} x_i be an n-variate real multilinear polynomial of degree at most k, where S \subseteq [n] = {1, 2, ..., n}. For its "one-block decoupled" version, f~(y,z) = \sum_{|S| <= k} a_S \sum_{i \in S} y_i \prod_{j \in S\i} z_j, we show tail-bound comparisons of the form Pr[|f~(y,z)| > C_k t] t]. Our constants C_k, D_k are significantly better than those known for "full decoupling". For example, when x, y, z are independent Gaussians we obtain C_k = D_k = O(k); when x, y, z, Rademacher random variables we obtain C_k = O(k^2), D_k = k^{O(k)}. By contrast, for full decoupling only C_k = D_k = k^{O(k)} is known in these settings. We describe consequences of these results for query complexity (related to conjectures of Aaronson and Ambainis) and for analysis of Boolean functions (including an optimal sharpening of the DFKO Inequality).Comment: 19 pages, including bibliograph

Single Value Devices

We live in a world of continuous information overflow, but the quality of information and communication is suffering. Single value devices contribute to the information and communication quality by fo- cussing on one explicit, relevant piece of information. The information is decoupled from a computer and represented in an object, integrates into daily life. However, most existing single value devices come from conceptual experiments or art and exist only as prototypes. In order to get to mature products and to design meaningful, effective and work- ing objects, an integral perspective on the design choices is necessary. Our contribution is a critical exploration of the design space of single value devices. In a survey we give an overview of existing examples. The characterizing design criteria for single value devices are elaborated in a taxonomy. Finally, we discuss several design choices that are specifically important for moving from prototypes to commercializable products