Documente Academic
Documente Profesional
Documente Cultură
MNT-301
Introduction to Quantum Computer
UNIT-3
08-11-2013
Flipping the logic state of one cell, for instance by applying a negative potential to a lead near the quantum dot occupied by an electron, will result in the next door cell flipping ground state in order to reduce coulomb repulsion .
08-11-2013
The QCA cellular architecture is similar to other cellular arrays such as cellular neural/nonlinear networks (CNN), in that they repeatedly employ the same basic cell with its associated near-neighbor interconnection pattern.
In short QCA is a proposed scheme for computing with cells of coupled quantum dots where coupling between the cells is given by their direct physical interactions(and not by wires).
The physical mechanism available for interactions in such field coupled architectures are electric (coulomb ) or magnetic interactions in conjunction with quantum mechanical tunneling.
The quantum dots are represented by the open circles, which indicate the confining electronic potential. In the ideal case, each cell is occupied by two electrons (shown as solid dots).
Figure (a): Schematic diagram of a QCA cell consisting of five quantum dots and occupied by two electrons.
Principle of quantum dot cell: Tunneling Between dots & Coulomb interaction
between electrons
The two electrons experience their mutual Coulombic repulsion, yet they are constrained to occupy the quantum dots inside the cell.
So they placed by hopping between the dots, that configuration which corresponds to the physical ground state of the cell.
Two electrons will tend to occupy different dots on opposing corners of the cell because of the Coulomb energy associated with having them on the same dot or bringing them together closer.
08-11-2013
Polarization (P=+1 or P=-1): These two configurations may be interpreted as binary information, thus encoding bit values in the electronic arrangement inside a single cell.
The ground state of an isolated cell is a superposition with equal weight of the two basic configurations, and therefore has a net polarization of zero.
Figure (b): The two basic electronic arrangements in the cell, which can be used to represent binary information, P = +1 and P = 1.
08-11-2013
1.3 QCA Logic Simple QCA cell logic line where a logic input of 1 gives an logic output of 1.
This structure could be called a binary wire, where a 1 input gives a 1 output. All of the electrons occupy positions as far away from their neighbors as possible and they are all in ground state polarization.
Flipping the ground state of the cell on the left end will result in a domino effect, where each neighboring cell flips ground states until the end of the wire is reached.
Inverter Built From QCA Cells: The output is0 when the input is 1
08-11-2013
Majority Gate: The QCA topology that can produce AND & OR gates is called a majority gate, Where three input cells vote on the polarization of central cell .The polarization of central cell is then propagated as the output.
One of the input can be designated a programming input and determines whether the majority gate produces an AND or an OR. If the programming gate is a logic 1, then the result is OR while programming gate equal to logic 0 would produce a result of AND.
A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 Output 0 0 0 1 0 1 1 1
08-11-2013
Computing With The Ground State: Consider a QCA array before the start of a computation . The array, left to itself, will have assumed its physical ground state. Presenting the input data i.e setting the polarization of the input cells, will deliver energy to the system, thus promoting the array to an excited state.
In the computation the array reaches the new ground-state configuration, according to the boundary conditions given by the fixed input cells.
The information is contained in the ground state itself only and not in how the ground state is reached i.e the dynamics of computation.
But the dynamics of the computation is important for the actual implementation purpose. There may be two approaches that can explain computation dynamics : The system is completely left to itself. The system is externally controlled.
08-11-2013
EDGE DRIVEN COMPUTATION: Edge-driven computation means that only the periphery of a QCA array can be contacted, which is used to write the input data and to read the output of the computation. No internal cells may be contacted directly.
This implies that no signals or power can be delivered from the outside to the interior of an array. All interior cells only interact within their local neighborhood. The absence of signal and power lines to each and every interior cell has obvious benefits for the interconnect problem and the heat dissipation.
The lack of direct contact to the interior cells also has profound consequences for the way such arrays can be used for computation. Because no power can flow from the outside, interior cells cannot be maintained in a far-from-equilibrium state. Because no external signals are brought to the inside, internal cells cannot be influenced directly.
These are the reasons why the ground state of the whole array is used to represent the information, as opposed to the states of each individual cell. In fact, edge-driven computation necessitates computing with the ground state.
08-11-2013
diodes etc) whose working is based on the State change of device due to presence or absence of a single electron. Single electron transistors (SETs) can be used (in principle) in circuit to the conventional silicon FETs , MOSFETs . But there are practical problem in using SETs as logic devices in conventional circuit architectures. One of the main problem related to the presence of charges in the surrounding circuitry, which change the SET characteristics in an uncontrollable way because the SET is sensitive to the charge of one electron, So Solution of above problem is: the whole surrounding circuitry must be of same nature i.e it must use all single electron devices.
08-11-2013
Molecular Circuit
Chemical self-assembly processes look promising since they (in principle), allow vast amounts of devices to be fabricated very cheaply. (1) But, there are key problems the need to create complex circuits for computers appears to be ill suited for chemical self-assembly, which yields mostly regular (periodic) structures; and (2) the need to deal with very large numbers of components and to arrange them into useful structures is a hard problem (NP-hard problem). Molecular circuit is a architectures for Nanoprocessor systems, which integrated on the molecular scale. There are some approach to built molecular circuit First One approach to molecular electronics is to build circuits in analogy to conventional silicon-based electronics. The idea is to find molecular analogs of electronic devices (such as wires, diodes, transistors, etc.) and then to assemble these into molecular circuits.
10
08-11-2013
Transistor: A popular group of molecules, that can work as the semiconducting channel material in a molecular transistor, is the oligopolyphenylenevinylenes (OPVs) that works by the Coulomb blockade mechanism when placed between the source and drain electrode in an appropriate way. Fullerenes work by the same mechanism and have also been commonly utilized.
Wires: The sole purpose of molecular wires is to electrically connect different parts of a molecular electrical circuit. As the assembly of these and their connection to a macroscopic circuit is still not mastered, the focus of research in single molecule electronics is primarily on the functionalized molecules: molecular wires are characterized by containing no functional groups and are hence composed of plain repetitions of a conjugated building block. Among these are the carbon nanotubes that are quite large compared to the other suggestions but have shown very promising electrical properties.
11
08-11-2013
Quantum superposition
The superposition principle plays the most important role in all consideration of quantum information and in most experiments of quantum mechanics. Double slit experiment: The essential ingredients of double slit experiment are a source, a double slit assembly and an observation screen on which we observe interference fringes. According to
12
08-11-2013
13
08-11-2013
Q-bits
QUBIT: qbit is stands for quantum bit; it is the basic unit of information in a quantum computer same as bit which is the basic unit of information in classical computer. In a quantum computer, a number of elemental particles such as electrons or photons can be used with either their charge or polarization acting as a representation of 0 and/or 1. Each of these particles is known as a qubit; the nature and behavior of these particles (as expressed in quantum theory) form the basis of quantum computing. Bit Vs Qbit: A bit is the basic unit of computer information. Regardless of its physical realization, a bit is always understood to be either a 0 or a 1. An analogy to this is a light switch- with the off position representing 0 and the on position representing 1. A qubit has some similarities to a classical bit, but is overall very different. Like a bit, a qubit can have two possible valuesnormally a 0 or a 1. The difference is that whereas a bit must be either 0 or 1, a qubit can be 0, 1, or a superposition of both.
Quantum
superposition
refers
to
the
quantum
mechanical property of a particle to occupy all of its possible quantum states simultaneously. Due to this property, to completely describe a particle one must include a description of every possible state and the probability of the particle being in that state.
In above figure second row shown the qbit representation of decimal 5. Third row shows the qbit may represent superposition of decimal 4 and decimal 5.
14
08-11-2013
where and are probability amplitudes and can in general both be complex numbers. When we measure this qubit in the standard basis, the probability of outcome |0> is | |2 and the probability of outcome |1> is | |2.
Because the absolute squares of the amplitudes equate to probabilities, it follows that and must be represented by the equation:
15
08-11-2013
Rough
The possible states for a single qubit can be visualised using a Bloch sphere (see diagram). Represented on such a sphere, a classical bit could only be at the "North Pole" or the "South Pole", in the locations where and are respectively. The rest of the surface of the sphere is inaccessible to a classical bit, but a pure qubit state can be represented by any point on the surface. For example, the pure qubit state swould lie on the equator of the sphere, on the positive y axis. The surface of the sphere is two-dimensional space, which represents the state space of the pure qubit states. This state space has two local degrees of freedom. It might at first sight seem that there should be four degrees of freedom, as and are complex numbers with two degrees of freedom each. However, one degree of freedom is removed by the constraint. Another, the overall phase of the state, has no physically observable consequences, so we can arbitrarily choose to be real, leaving just two degrees of freedom. It is possible to put the qubit in a mixed state, a statistical combination of different pure states. Mixed states can be represented by points inside the Bloch sphere.
16
08-11-2013
Kind of operations: There are various kinds of physical operations that can be performed on pure qubit states.
Unitary transformation: These correspond to rotations of the Bloch sphere. Standard basis measurement: It is an operation in which information is gained about the state of the qubit. With probability | |2, the result of the measurement will be and with probability | |2, it will be. Measurement of the state of the qubit is measured, is changed to
1 (up to phase) and is changed to 0. Note that a measurement of a qubit state entangled with another quantum system transforms a pure state into a mixed state.
17
08-11-2013
18
08-11-2013
19
08-11-2013
Phase Shifter
20
08-11-2013
Quantum GATE
21
08-11-2013
22
08-11-2013
Controlled U GATE: if U is a gate that operates on single qubits with matrix representation
23
08-11-2013
Quantum gate array Important feature of computer is that they can be programmable so in case of programmable quantum computer device would have to have the features that It should consist of a fixed gate array with a data register and program register. And the array should work in such a way that the state of the program register emcodes the unitary operator u that is applied to the state of data register.
So we can say that Quantum gate array are fixed gate arrays acting on data register and program register, together with a final fixed projective measurement on the composite system.
Suppose that we are given a quantum system prepared in the same state q and an operator O by specifying its expansion in a basis of the space of operators so our task is to compute the expectation value of O in the state q. Hence Quantum gate array is a programmable circuit that evaluates such expectation values by measuring the polarization of single qubit. Inputs of such circuits are data register, program register and auxiliary qubit.
24
08-11-2013
25
08-11-2013
Let us take an example for quantum mechanical system application: propagate and cryptography
Suppose there are two users John and Mick, and John wants to send the secrete information to Mick, then John will first encrypt the data from readable state to nonsense by using a key which is send via a quantum communication route to Mick.
This quantum communication route is known as propagator. After that the John send the nonsense through any chipper media to Mick. After receiving the nonsense Mick will decrypt the information with the help of that key.
Suppose Alice is in possession of the first qubit and Bob the second qubit. Alice performs one of four 1-qubit gates, depending on the 2 classical bits she wishes to communicate to Bob.
For convenience, we remind you again of the definitions of the Pauli gates:
26
08-11-2013
If Alice wishes to send the bits 00 to Bob, she does nothing to her qubit (or equivalently, applies the identity gate I).
If she wishes to send 01, she applies the X gate to her qubit. If she wishes to send 10, she applies the Z gate; and if she wishes to send 11, she applies Z X (i.e. she applies the X gate followed by the Z gate).
The following list summarizes the resulting joint 2-qubit state in each case:
27