Quantum Computing for Computer Architects (Synthesis Lectures on Computer Architecture) | Date: 11 April 2011, 20:40
|
Quantum computers can (in theory) solve certain problems far faster than a classical computer running any known classical algorithm.While existing technologies for building quantum computers are in their infancy, it is not too early to consider their scalability and reliability in the context of the design of large-scale quantum computers.To architect such systems, one must understand what it takes to design and model a balanced, fault-tolerant quantum computer architecture. The goal of this lecture is to provide architectural abstractions for the design of a quantum computer and to explore the systems-level challenges in achieving scalable, fault-tolerant quantum computation. In this lecture,we provide an engineering-oriented introduction to quantum computation with an overview of the theory behind key quantum algorithms.Next, we look at architectural case studies based upon experimental data and future projections for quantum computation implemented using trapped ions.While we focus here on architectures targeted for realization using trapped ions, the techniques for quantum computer architecture design, quantum fault-tolerance, and compilation described in this lecture are applicable to many other physical technologies that may be viable candidates for building a large-scale quantum computing system. We also discuss general issues involved with programming a quantum computer as well as a discussion of work on quantum architectures based on quantum teleportation.Finally,we consider some of the open issues remaining in the design of quantum computers.
The second edition contains new material intended to both provide the reader with a deeper background in quantum computation as well as novel concepts and results in quantum computer architecture. A new chapter (Chapter 3) augments the introduction to quantum computation in Chapter 2 with detailed expositions of key quantum algorithms, including Shor’s algorithm for factoring integers in polynomial time and Grover’s algorithm for quantum search. Chapter 7 has been expanded with recent work on ion-trap quantum computer architectures.Additionally,we have added another new chapter (Chapter 8) which provides a case study of the an application of the architecture described in Chapter 7 to a quantum simulation task. The book begins with a brief background in Chapter 2 which compares the basic operations for quantum computation to the conventional computing scheme by focusing on computation rather than physics. We describe, in some detail, the concept of qubits, quantum logic gates, and other important components for quantum computing relevant to the circuit model for quantum computation. Following this, we present an overview the of mathematical principles behind of a few
notable quantum algorithms in Chapter 3. In Chapter 4,we introduce three high-level requirements for a scalable quantum architecture and describe each requirement independently in the following sections: reliable implementation technology in Section 4.1, efficient error correction schemes in Section 4.2, and efficient quantum resource distribution in Section 4.3. Modeling and simulating quantum computational structures and cycle-level quantum simulation methods are described in Chapter 5, including a brief introduction of the stabilizer formalism for quantum computation and error correction. A set of architectural elements for a quantum architecture is described in Chapter 6. The concept of quantum memory hierarchy is described in Section 6.2. In Chapter 7, we give a case study for a quantum architecture, the Quantum Logic Array (QLA), based on our previous work [61, 141]. Chapter 8 provides a treatment of how we can program a quantum architecture, and Chapter 9 covers the QLA architecture for a quantum simulation application. Chapter 10 offers a discussion into the alternate methods for achieving fault-tolerant universal quantum logic, namely, performing quantum operation through the concept of teleportation. Finally, we conclude
with Chapter 11, where we give a brief summary of what we have done.
|
DISCLAIMER:
This site does not store Quantum Computing for Computer Architects (Synthesis Lectures on Computer Architecture) on its server. We only index and link to Quantum Computing for Computer Architects (Synthesis Lectures on Computer Architecture) provided by other sites. Please contact the content providers to delete Quantum Computing for Computer Architects (Synthesis Lectures on Computer Architecture) if any and email us, we'll remove relevant links or contents immediately.
|
 |
|
Comments (0)
All
