Quantum computing for computer architects
By: Tzvetan S. Metodi, Arvin I. Faruque, Frederic T. Chong
Contributors: Faruque, Arvin I.; Chong, Frederic T., 1968-
Edition: 2nd ed.
Series: Synthesis lectures on computer architecture -- # 13
Publisher: Morgan & Claypool
Published: 2011
Place of publication: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA)
Language: eng
Format: [electronic resource] /
Number of pages: 191
ISBN-13: 9781608456208; 9781608456192
Subjects: Quantum computers; Computer architecture
Other titles: Synthesis digital library of engineering and computer science.
Description: 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.
Notes: Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (p. 171-188).

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Also available in print.

Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.
Table of contents: title: Preface; title: 1. Introduction; title: 2. Basic elements for quantum computation; title: Classical vs. quantum signal states (bits vs. qubits); title: Logic operations and circuits; title: Quantum measurement; title: Example: the 3-qubit quantum Toffoli gate; title: Example: quantum Fourier transform (QFT); title: Example: quantum teleportation; title: Example: Deutsch's quantum algorithm; title: Quantum entanglement and EPR pairs; title: Other models of quantum computation; title: 3. Key quantum algorithms; title: Quantum integer factorization; title: The integer factorization problem; title: A quantum integer factorization algorithm; title: Quantum integer factorization: proof of classical part; title: Order finding; title: Order finding as quantum Eigenvalue estimation; title: Order finding: continued fractions; title: Quantum phase estimation; title: Proof sketch of the correctness of the phase estimation circuit; title: Eigenvalue estimation; title: The hidden subgroup problem; title: Grover's algorithm for quantum search; title: Searching with a quantum black box; title: Grover's algorithm; title: Proof sketch of the correctness of Grover iteration; title: Quantum adiabatic algorithms; title: 3-SAT: an example of a quantum adiabatic algorithm; title: 4. Building reliable and scalable quantum architectures; title: Reliable and realistic implementation technology; title: Optical quantum computation: photons as qubits; title: Trapped-ion quantum computation: ions as qubits; title: Robust error correction and fault-tolerant structures; title: Noise model assumptions; title: Error correction: basics and notation; title: Example: the Steane [[7, 1, 3]] code; title: Logical qubits in quantum computation; title: Quantum error correction and fault-tolerance: the threshold result; title: The cost of quantum error correction; title: Scale-up in system size due to error correction; title: Error correction slowdown; title: Quantum resource distribution; title: Physical qubit movement; title: Teleportation-based communication and quantum repeaters; title: 5. Simulation of quantum computation; title: Simulation of error propagation; title: Stabilizer method for quantum simulation; title: 6. Architectural elements; title: Quantum processing elements (PE's); title: Quantum memory hierarchy; title: Quantum addressing scheme for classical memory; title: Error correction and quantum architecture design; title: Effects of ancilla preparation and layout; title: Optimizing error correction along critical paths; title: 7. Case study: the quantum logic array architecture; title: QLA architecture overview; title: The logical qubit design in the QLA; title: Logical qubit interconnect; title: Compressed QLA architecture: CQLA; title: The gain product: architecture performance comparison; title: Communication issues: executing the Toffoli gate; title: Memory hierarchy in the CQLA architecture; title: Simulating the cache in the CQLA; title: Qualypso; title: 8. Programming the quantum architecture; title: Physical-level instruction scheduling; title: High-level compiler design; title: Architecture-independent circuit synthesis; title: Mapping circuits to architecture; title: Optimization of the logical qubit tiles; title: The fault-tolerant threshold estimates; title: Circuit scheduling and the fault-tolerance constraint; title: Threshold calculations; title: Summary discussion; title: 9. Using the QLA for quantum simulation: the transverse Ising model; title: The transverse Ising model overview; title: TIM quantum simulation resource estimates; title: Phase estimation circuit; title: Decomposition of the TIM quantum circuit into fault-tolerant gates; title: Mapping the TIM circuit onto the QLA architecture; title: Resource estimates for the 1-D TIM problem; title: 10. Teleportation-based quantum architectures; title: The CNOT gate and single-qubit gates through teleportation; title: The architecture; title: Error correction through teleportation; title: 11. Concluding remarks; title: Bibliography; title: Authors' biographies.