Universal Quantum-Computation
Bhupesh Bishnoi · Zenodo (CERN European Organization for Nuclear Research) · 2020
In this research notebook on universal quantum computation for quantum engineers, researchers, and scientists, we will explore quantum advantage, referred to as quantum supremacy. We will put into practice the dynamical decoupling and free evolution. We will also discuss requirements and strategies for the realization of large-scale quantum computation robust and resilient to errors. We begin with an introduction to the concepts of error detection and error correction in classical and quantum systems, and we will introduce several examples to build intuition. We will discuss in detail one quantum error correction code and its code parameters. Next, we will describe how reliable classical and quantum machines can be built from unreliable components, introduce the threshold theorem, and discuss fault tolerance principles. Furthermore, describe the conceptual role of fault-tolerance in realizing large-scale quantum and classical computation. After that, we will transition to quantum error suppression and error correction in practice, beginning with examples of composite pulses and dynamical decoupling sequences. We will then conclude with a detailed discussion on the surface code. We will discuss the scientific basis of families of quantum error correction codes. We will understand the different strategies for counteracting systematic versus random error in quantum computation. Next, we introduce computational complexity classes for classical and quantum computers and explore the meaning of quantum advantage, often referred to as ``quantum supremacy.'' Furthermore, in the end, we will implement dynamical error suppression protocols on the qubits of a real physical quantum computer, the IBM Quantum Experience.