Scribd Logo
Upload

Welcome to Scribd!

  • 34 views

    Lecture 1 PDF

    Uploaded by

    SaikiranKumar
    The document discusses quantum computing compilers and their tasks. It explains that compilers decompose multi-qubit gates into elementary single and two-qubit gates. The Toffoli gate is decomposed into five single qubit gates. Compilers also optimize quantum circuits by reducing the number of qubits and gates to minimize circuit width and length. Optimization is performed at the hardware level by changing physical qubit mappings, and at the software level by circuit optimization algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Lecture 1 PDF

    Uploaded by

    SaikiranKumar
    34 views15 pages
    The document discusses quantum computing compilers and their tasks. It explains that compilers decompose multi-qubit gates into elementary single and two-qubit gates. The Toffoli gate is decomposed into five single qubit gates. Compilers also optimize quantum circuits by reducing the number of qubits and gates to minimize circuit width and length. Optimization is performed at the hardware level by changing physical qubit mappings, and at the software level by circuit optimization algorithms.

    Original Title

    Lecture_1.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses quantum computing compilers and their tasks. It explains that compilers decompose multi-qubit gates into elementary single and two-qubit gates. The Toffoli gate is decomposed into five single qubit gates. Compilers also optimize quantum circuits by reducing the number of qubits and gates to minimize circuit width and length. Optimization is performed at the hardware level by changing physical qubit mappings, and at the software level by circuit optimization algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    34 views15 pages

    Lecture 1 PDF

    Uploaded by

    SaikiranKumar
    The document discusses quantum computing compilers and their tasks. It explains that compilers decompose multi-qubit gates into elementary single and two-qubit gates. The Toffoli gate is decomposed into five single qubit gates. Compilers also optimize quantum circuits by reducing the number of qubits and gates to minimize circuit width and length. Optimization is performed at the hardware level by changing physical qubit mappings, and at the software level by circuit optimization algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 15

    Introduction

    to Quantum Computing –
    Quantum Circuits
    Recap – Quantum Gates

    Single qubit
    operations

    Mutiple qubit
    operations
    Software of Quantum Computer Hardware of Quantum Computer

    Mathematical basis-Linear Algebra


    Physical basis- Quantum Mechanics Physical qubits, gates, registers
    How to implement and control entangled qubits
    Quantum bits, Gates
    Quantum Circuits and simple quantum
    protocols like dense coding, Teleportation,
    Quantum key sharing, Quantum Microarchitecture,
    Parallelism Instruction set architecture
    Implementation of Quantum Circuits –IBMQ Compilers and Programming languages
    dashboard, QISKit
    Important Quantum Algorithms-

    Deutsch-Jozsa algorithm,
    Bernstein-Vazirani algorithm,
    Shor’s algorithm
    Grover’s algorithm
    Quantum Error correction
    Quantum Computers

    Stand alone Computers Quantum Accelerators


    QC architecture

    High level language – OpenQL (TU


    Delft), LIQUIl>(Microsoft), ScaffCC
    (U. Chicago)

    Compiler

    QASM

    QISA

    Qubits
    Heterogeneous Programming Models

    Quantum Algorithms

    Classical Computations Quantum Computations

    Programming languages – Programming languages –


    C/C++, Python OpenQL, …

    Compilers-gcc,icc,python, Quantum Compilers


    …
    QASM
    QISA
    Assembly Codes

    API interface
    Issues in building Quantum circuits

    Not all the physical qubits are connected

    Entanglement - not always maximum, some are weakly entangled

    Decoherence times have to be longer than the execution time of the quantum
    circuit

    Length and width of the quantum circuits increases the computational times-
    optimization schemes are needed to reduce the number of qubits and gates
    Compiler - Tasks

    1. Decompose

    2. Optimize

    3. Schedule

    4. Mapping

    5. FT synthesis
    %! &" '# ($

    Decompose

    Multiple qubit gates are decomposed into elementary operations - To increase the
    Figure 4.12. Controlled-U operation and its equivalent in terms of circuit elements we already know how to
    implement. The fourth qubit has U applied if the first and third qubits are set to zero, and the second qubit is set
    efficiency as qubit-qubit interactions are costlier.
    to one.

    • • •
    ⊕ ≡ ⊕
    ⊕ ⊕
    Figure 4.13. Controlled- gate with multiple targets.

    182 Quantum circuits

    Principle of deferred measurement: Measurements can always be moved from


    an intermediate stage of a quantum circuit to the end of the circuit; if the
    measurement results are used at any stage of the circuit then the classically
    controlled operations can be replaced by conditional quantum operations.

    Often, quantum measurements are performed as an intermediate step in a quantum


    circuit, and the measurement results are used to conditionally control subsequent quan-
    tum gates. This is the case, for example, in the teleportation circuit of Figure 1.13 on
    page 27. However, such measurements can always be moved to the end of the circuit.
    Figure 4.8. Circuit for the C 2 (U ) gate. V is any unitary operator satisfying V 2 = U . The special case
    Figure 4.15 illustrates how
    V ≡ (1 − i)(I this corresponds
    + iX)/2 may be todone by replacing
    the Toffoli gate. all the classical conditional
    operations by corresponding quantum conditional operations. (Of course, some of the
    interpretation ofthethis circuit as performing ‘teleportation’ is lost, because no classical in-
    case C 2 (X). Defining V ≡ (1 − i)(I + iX)/2 and noting that V 2 = X, we see that
    A three qubit operation is decomposed into two-qubit operations- Toffoli gate is written in
    terms of 5 single qubit gates A,B,C,D and E such that EDCBA=EXDCXBA=EDXCBXA=I and
    EXDXCXBXA=U where X after first and third gate corresponds to the first qubit and after
    second and fourth gate corresponds to second qubit. In this case, U is NOT gate.

    Typically the multi-qubit operations are decomposed into {H,T, CNOT} gates as these can be
    implemented easily in error-correction schemes.
    Mapping and Optimization

    Compilers also optimize the number of gates, qubits and hence the width of the quantum
    circuits as well as length to the circuit.

    q0
    q1
    q2
    q3
    q4

    IBM Tenerife

    York town
    CNOT(q1,q4) SWAP(q0,q4)

    Quiz: Show that the circuits given above performs the above-mentioned operations
    Optimization is performed at two different levels:
    1. Hardware level: change the physical qubits which is obviously impossible to do
    2. Software level: Design a circuit optimisation algorithm to meet the requirements

    Software level: Global adjustment


    Local qubit level adjustments
    QUIZ

    q1 Q3

    q0 q4

    SWAP(q0,a3)

    You might also like