Presentation is loading. Please wait.

Presentation is loading. Please wait.

Nano Computing Majid Mohammadi Shahid Bahonar University of Kerman

Similar presentations


Presentation on theme: "Nano Computing Majid Mohammadi Shahid Bahonar University of Kerman"— Presentation transcript:

1 Nano Computing Majid Mohammadi Shahid Bahonar University of Kerman
Computer Engineering Department

2

3 Applications Catalysts Nanoremediation Paper Filters Toothpaste Food
Envirox™ cerium oxide Nanoremediation SAMMS technology to remove mercury Paper photographic paper Filters nanofibres Toothpaste to remineralise teeth Food packaging Paint improved adhesion and anti- fungal qualities/anti-graffiti Clothes non-staining and anti-radiation Batteries (Black & Decker) phosphate nanocrystal technology Cleaning products

4 Volume to surface area ratio
01/01/2019 Volume to surface area ratio As objects get smaller they have a much greater surface area to volume ratio 𝐴𝑟𝑒𝑎 𝑉𝑜𝑙𝑢𝑚𝑒 = 6 𝑎 2 𝑎 3 = 6 𝑎 2 cm cube has a surface area of 24 cm2 and a volume of 8 cm3 (ratio = 3:1) 10 cm cube has a surface area of 600 cm2 and a volume of 1000 cm3 (ratio = 0.6:1)

5 01/01/2019 Physical properties At very small sizes physical properties (magnetic, electric and optical) of materials can change dramatically. Quantum Confinement between Self-Organized Pt Nanowires on Ge(001) (Result of the month 10/2005) The existence of one-dimensional (1D) electronic states between self-organised Pt nanowires spaced 1.6 or 2.4 nm apart on a Ge(001) surface is revealed by low-temperature scanning tunneling microscopy. These perfectly straight Pt nanowires act as barriers for a surface state (located just below the Fermi level) of the underlying terrace. The energy positions of the 1D electronic states are in good agreement with the energy levels of a quantum particle in a well. Spatial maps of the differential conductivity of the 1D electronic states conclusively reveal that these states are exclusively present in the troughs between the Pt nanowires.

6 Applications Microchips

7 Nano-wires carbon nanotubues, Si, metal
>2nm diameter, up to mm length excellent electrical properties There are other proposals too; this is one of the most famous. Very stable and defect-free (the molecule has no imperfections). A carbon nanotube: one molecule SSS April 20, 2001

8 Carbon nanotubes

9 Potential applications of carbon nanotubes
Materials & Chemistry - Ceramic and metallic CNT composites - Polymer CNT composites (heat conducting polymers) - Coatings (e.g. conductive surfaces) - Membranes and catalysis Tips of Scanning Probe Microscopes (SPM) Medicine & Life Science - Medical diagnosis (e.g. Lab on a Chip (LOC)) - Medical applications (e.g. drug delivery) - Chemical sensors - Filters for water and food treatment Electronics & ICT - Lighting elements, CNT based field emission displays - Microelectronic: Single electron transistor - Molecular computing and data storage - Ultra-sensitive electromechanical sensors Micro-Electro-Mechanical Systems (MEMS) Energy - Hydrogen storage, energy storage (super capacitors) - Solar cells - Fuel cells - Superconductive materials

10 Electronics & Digital Circuits
Carbon Nanotube FET transistors (CNTFET). Single Electron Transistors (SET). Quantum Dot Cellular Automata (QCA). Magnetic Tunneling Junction Transistors (MTJ). Quantum inspired techniques.

11 Quantum dot Cellular Automata (QCA)

12 Quantum Cell

13 Quantum wire

14 Majority Gate

15 Other Gates

16 A New Computational Framework:
Quantum Computing: Quantum Computing A New Computational Framework: What is a quantum computer? A quantum computer is a machine that performs calculations based on the laws of quantum mechanics, which is the behavior of particles at the sub-atomic level.

17 “I think I can safely say that nobody understands quantum mechanics” - Feynman
Feynman proposed the idea of creating machines based on the laws of quantum mechanics instead of the laws of classical physics. David Deutsch developed the quantum turing machine, showing that quantum circuits are universal. Peter Shor came up with a quantum algorithm to factor very large numbers in polynomial time. Lov Grover develops a quantum search algorithm with O(√N) complexity

18 Representation of Data - Qubits
A bit of data is represented by a single atom that is in one of two states denoted by |0> and |1>. A single bit of this form is known as a qubit A physical implementation of a qubit could use the two energy levels of an atom. An excited state representing |1> and a ground state representing |0>. Light pulse of frequency  for time interval t Excited State Nucleus Ground State Electron State |0> State |1>

19

20 Probabilistic Model:

21 Representation of Data - Superposition
A single qubit can be forced into a superposition of the two states denoted by the addition of the state vectors: |> =  |0> +  |1> Where  and  are complex numbers and | | + |  | = 1 1 2 1 2 1 2 A qubit in superposition is in both of the states |1> and |0 at the same time

22 Classical vs Quantum Bits
Classical Bit 2 Basic states – off or on: 0, 1 Mutually exclusive Quantum Bit (Qubit) 2 Basic states – ket 0, ket 1: Superposition of both states – (not continuous in nature) Quantum entanglement 2 or more objects must be described in reference to one another Entanglement is a non-local property that allows a set of qubits to express superpositions of different binary strings (01010 and 11111, for example) simultaneously

23 Quantum gates: Unitary Matrix: U†=U-1 or U.U† = I

24 Quantum Gates - Hadamard
Simplest gate involves one qubit and is called a Hadamard Gate (also known as a square-root of NOT gate.) Used to put qubits into superposition. H H State |0> State |0> + |1> State |0> Note: Two Hadamard gates used in succession can be used as a Buffer gate

25 Hadamard Gates for Superposition
= 𝑛 00… … …10 +…+ 11… … … …10 +…+ 11…11 = 𝑛 𝒙∈ 0,1 𝑛 𝒙

26 Quantum Algorithms: Deutsch Josa Algorithm:

27 Quantum Computing Power
Integer Factorization Impossible for digital computers to factor large numbers which are the products of two primes of nearly equal size Quantum Computer with 2n qubits can factor numbers with lengths of n bits (binary) Quantum Database Search Example: To search the entire Library of Congress for one’s name given an unsorted database... Classical Computer – 100 years Quantum Computer – ½ second

28 Quantum Computing History
Alexander Holevo publishes paper showing that n qubits cannot carry more than n classical bits of information. Polish mathematical physicist Roman Ingarden shows that Shannon information theory cannot directly be generalized to the quantum case. Richard Feynman determines that it is impossible to efficiently simulate a evolution of a quantum system on a classical computer. David Deutsch of the University of Oxford, describes the first universal quantum computer. Dan Simon, at Universite de Montreal, invents an oracle problem for which quantum computer would be exponentially faster than conventional computer. This algorithm introduced the main ideas which were then developed in Peter Shor's factoring algorithm. Peter Shor, at AT&T's Bell Labs discovers algorithm to allow quantum computers to factor large integers quickly. Shor's algorithm could theoretically break many of the cryptosystems in use today. Shor proposs the first scheme for quantum error correction. Lov Grover, at Bell Labs, invents quantum database search algorithm. David Cory, A.F. Fahmy, Timothy Havel, Neil Gershenfeld and Isaac Chuang publish the first papers on quantum computers based on bulk spin resonance, or thermal ensembles. Computers are actually a single, small molecule, storing qubits in the spin of protons and neutrons. Trillions of trillions of these can float in a cup of water. First working 2-qubit NMR computer demonstrated at University of California, Berkeley. First working 3-qubit NMR computer demonstrated at IBM's Almaden Research Center. First execution of Grover's algorithm. First working 5-qubit NMR com First working 7-qubit NMR computer demonstrated at IBM's Almaden Research Center. First execution of Shor's algorithm. The number 15 was factored using 1018 identical molecules, each containing 7 atoms. puter demonstrated at IBM's Almaden Research Center.

29 2017 D-Wave Systems Inc. announced on 24 January general commercial availability of the D-Wave 2000Q quantum annealer, with 2000 qubits.[178] Atos sells first Quantum Learning Machine to Oak Ridge National Laboratory, supporting US Department of Energy research[179] Working blueprint for a microwave trapped ion quantum computer published in Science Advances by international collaborators.[180] IBM unveils 17-qubit quantum computer—and a better way of benchmarking it.[181] Scientists build a microchip that generates two entangled qubits each with 10 states, for 100 dimensions total.[182] Microsoft reveals an unnamed quantum programming language, integrated with Visual Studio. Programs can be executed locally on a 32-qubit simulator, or a 40-qubit simulator on Azure.[183] Intel develops a 17-qubit chip.[184] IBM reveals a working 50-qubit quantum computer that can maintain its quantum state for 90 microseconds.[185] 2018 MIT scientists reported the discovery of a new triple-photon form of light, which may involve polaritons, that could be useful in the development of quantum computers.[186][187] Google announced the creation of a 72-qubit quantum chip called "Bristlecone",[188] achieving a new record.


Download ppt "Nano Computing Majid Mohammadi Shahid Bahonar University of Kerman"

Similar presentations


Ads by Google