Quantum Computing
Sergey Tikhomirov
Lecture 5
https://sites.google.com/site/sergeytikhomirov/teaching/2025-quantum
WhatsApp group
Review of Lecture 4
Entanglement
Entanglement
Universal gates
C-C-U gate
Implementation of classical algorithms on quantum computers
Quantum circuit.
Width – number of qbits
Size – number of gates
Length – minimal number of operations taking into account parallelization
Number of CNot operators
From scheme to matrix notation.
C-C-U Operator
C-C-U Operator. Remarks
Quantum permutation|k> -> |k+1>
A lot of ancilla qbit
r5 | r4 | r3 | r2 | 0 |
q5 | q4 | q3 | q2 | q1 |
| | | | |
Quantum Permutation.|k> -> |k+1>
One ancilla qbit. Idea
Problems:
It works only if ancilla is in state |0>�After applying the circuit ancilla qbit does not preserve state |0>�For each division operation we will need an extra ancilla
Trick: Uncompute
C-C-…-C-Not implementation with (n-2) ancilla
Fast C-…-C-Not
CCCC-U gate representation
C-C-U Operator