Quantum computing for computer architects

Quantum computing for computer architects [electronic resource] / Tzvetan S. Metodi, Arvin I. Faruque, Frederic T. Chong.

Show other versions (2)

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 th...

Full description

Saved in:
Bibliographic Details
Online Access: Full Text (via Morgan & Claypool)
Main Author: Metodi, Tzvetan S.
Other Authors: Faruque, Arvin I., Chong, Frederic T., 1968-
Format: Electronic eBook
Language:English
Published: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, ©2011.
Edition:2nd ed.
Series:Synthesis lectures in computer architecture (Online) ; # 13.
Subjects:
Quantum computers.
Computer architecture.
Table of Contents:
  • Preface
  • 1. Introduction
  • 2. Basic elements for quantum computation
  • Classical vs. quantum signal states (bits vs. qubits)
  • Logic operations and circuits
  • Quantum measurement
  • Example: the 3-qubit quantum Toffoli gate
  • Example: quantum Fourier transform (QFT)
  • Example: quantum teleportation
  • Example: Deutsch's quantum algorithm
  • Quantum entanglement and EPR pairs
  • Other models of quantum computation
  • 3. Key quantum algorithms
  • Quantum integer factorization
  • The integer factorization problem
  • A quantum integer factorization algorithm
  • Quantum integer factorization: proof of classical part
  • Order finding
  • Order finding as quantum Eigenvalue estimation
  • Order finding: continued fractions
  • Quantum phase estimation
  • Proof sketch of the correctness of the phase estimation circuit
  • Eigenvalue estimation
  • The hidden subgroup problem
  • Grover's algorithm for quantum search
  • Searching with a quantum black box
  • Grover's algorithm
  • Proof sketch of the correctness of Grover iteration
  • Quantum adiabatic algorithms
  • 3-SAT: an example of a quantum adiabatic algorithm
  • 4. Building reliable and scalable quantum architectures
  • Reliable and realistic implementation technology
  • Optical quantum computation: photons as qubits
  • Trapped-ion quantum computation: ions as qubits
  • Robust error correction and fault-tolerant structures
  • Noise model assumptions
  • Error correction: basics and notation
  • Example: the Steane [[7, 1, 3]] code
  • Logical qubits in quantum computation
  • Quantum error correction and fault-tolerance: the threshold result
  • The cost of quantum error correction
  • Scale-up in system size due to error correction
  • Error correction slowdown
  • Quantum resource distribution
  • Physical qubit movement
  • Teleportation-based communication and quantum repeaters
  • 5. Simulation of quantum computation
  • Simulation of error propagation
  • Stabilizer method for quantum simulation
  • 6. Architectural elements
  • Quantum processing elements (PE's)
  • Quantum memory hierarchy
  • Quantum addressing scheme for classical memory
  • Error correction and quantum architecture design
  • Effects of ancilla preparation and layout
  • Optimizing error correction along critical paths
  • 7. Case study: the quantum logic array architecture
  • QLA architecture overview
  • The logical qubit design in the QLA
  • Logical qubit interconnect
  • Compressed QLA architecture: CQLA
  • The gain product: architecture performance comparison
  • Communication issues: executing the Toffoli gate
  • Memory hierarchy in the CQLA architecture
  • Simulating the cache in the CQLA
  • Qualypso
  • 8. Programming the quantum architecture
  • Physical-level instruction scheduling
  • High-level compiler design
  • Architecture-independent circuit synthesis
  • Mapping circuits to architecture
  • Optimization of the logical qubit tiles
  • The fault-tolerant threshold estimates
  • Circuit scheduling and the fault-tolerance constraint
  • Threshold calculations
  • Summary discussion
  • 9. Using the QLA for quantum simulation: the transverse Ising model
  • The transverse Ising model overview
  • TIM quantum simulation resource estimates
  • Phase estimation circuit
  • Decomposition of the TIM quantum circuit into fault-tolerant gates
  • Mapping the TIM circuit onto the QLA architecture
  • Resource estimates for the 1-D TIM problem
  • 10. Teleportation-based quantum architectures
  • The CNOT gate and single-qubit gates through teleportation
  • The architecture
  • Error correction through teleportation
  • 11. Concluding remarks
  • Bibliography
  • Authors' biographies.

Similar Items