Scribd
Upload
63 views

Quantum Computing (CS682) Assignment-5 (Week-4) : Mubashshir Uddin (190516) 14 February, 2021

This document discusses learning about building quantum circuits and applying them to solve problems more efficiently than classical computers. Specifically, it covers Deutsch's algorithm for determining the equality of function outputs using fewer queries on a quantum computer. The document also discusses generalized quantum circuits and their equivalence to Turing machines, opening up new computational possibilities. Finally, it mentions implementing quantum circuits in the real world by following principles of linearity and building computationally useful components like a half adder using quantum logic gates.

Uploaded by

Mubashshir Uddin
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
63 views

Quantum Computing (CS682) Assignment-5 (Week-4) : Mubashshir Uddin (190516) 14 February, 2021

This document discusses learning about building quantum circuits and applying them to solve problems more efficiently than classical computers. Specifically, it covers Deutsch's algorithm for determining the equality of function outputs using fewer queries on a quantum computer. The document also discusses generalized quantum circuits and their equivalence to Turing machines, opening up new computational possibilities. Finally, it mentions implementing quantum circuits in the real world by following principles of linearity and building computationally useful components like a half adder using quantum logic gates.

Uploaded by

Mubashshir Uddin
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Quantum Computing(CS682) Assignment- 5 (Week-4)

Mubashshir Uddin [190516]

14th February, 2021

This week saw the development about the knowledge of actually building quantum circuits and
also using them to achieve something productive which is harder to do for a classical computer.
This was the Deutsch’s problem, which says that for an algorithm takes in input and spits out the
output- what is the minimum number checks you can do to establish the equality of the output given
different inputs. For a classical computer this is a straightforward process- checking the output for
every input and comparing the outputs for equality. However, this can be improved upon drastically
by the application of Quantum Computing. To do this, first we think about a modified version of this
function circuit (A version that preserves the probability of output). Then we pass on the input and
a workspace qubit, our output appears as an entangled state of working bit and output. However,
if we restrict our inputs to some very special input like the plus and minus states as the input
and working bit, respectively. This gives us an entangled state that has a local phase dependence
upon the nature of the function (i.e., the relative local phase is different if the outputs are same
for different inputs on not). We measure this relative phase difference with the help of an inverse
Hadamard gate and do the measurement. Although sometimes people are tempted to say that the
Quantum Computers just calculate all the outputs in parallel, we found that this is actually not
true. In the above case the quantum computer never actually calculated any of the outputs at all,
but the inference was based on the quantum mechanical property of qubits states (i.e., their phase).
This was evident when we saw the actual physical manifestation of these computations in terms of
electron waves and their destructive and constructive interference based on their phase.

Then after this specific example we went about learning the idea of a generalized Quantum Circuit,
this was possible because of the equivalence of the quantum circuits to that of the Turing machine,
which according to the weak church-Turing hypothesis the only thing that one needs to execute any
kind of algorithm, this opens up the vast arena of possibilities that are associated with the classical
computing world to Quantum Computing world- the one very strong principle that was taught was
the power of a family of quantum circuits in relation to the Turing machine. This is so powerful
that it would be possible to compute even the processes unresolvable on a Turing machine.

To implement Quantum circuits in the real world we follow the principles of linearity the physical
realizations of the quantum mechanical apparatus in real world. Some of the rules that are induced
by these constrains are the non-existence of non-acyclic circuits and fanout gates. Then we sought
on to build the actual computationally useful components of a general computer with the quantum
apparatus, like the half adder. This is done using various gates introduced to us in this week like
the Pauli-X,Y,Z gates, Hadamard gate, CNOT, CCNOT, S-gate, Rx,y,z gates and the measurement
gate. All of which are applied to a circuit to manipulate the states of a qubit to our desired algorithm.

You might also like