Download presentation
Presentation is loading. Please wait.
Published byJonah Gibson Modified over 9 years ago
1
Moore’s Law the number of circuits on a single silicon chip doubles every 18 to 24 months
2
Anticipating Problems Minimum size of transistors or else will not work reliably Power leakage produces heat
3
What now? How do we create a better computer?
4
Innovate. m more instruction pipelines ore registers ore specialized circuitry
5
More innovations… i improve instruction set bigger on-chip cache
6
What’s next? DNA computing Quantum computing Molecular computing Optical computing
7
DNA Computing DNA Computing illustrates possibilities of using DNA to solve problems illustrates possibilities of using DNA to solve problems example of computation at a molecular level example of computation at a molecular level demonstrates unique aspects of DNA as a data structure demonstrates unique aspects of DNA as a data structure computing with DNA can work in a massively parallel fashion computing with DNA can work in a massively parallel fashion
8
DNA: unique data structure uses four nucleic acids instead of binary ones and zeroes(0,1 A,T,C,G) uses four nucleic acids instead of binary ones and zeroes(0,1 A,T,C,G) high data density – bases are spaced 0.35nm = 18Mbits per inch in 1D = 1mil Gbits per sq inch in 2D double stranded nature.
9
DNA vs. Silicon DNA is modified by a variety of enzymes which do not function sequentially DNA is modified by a variety of enzymes which do not function sequentially Just like CPU has addition, bit-shifting, logical operators (AND OR NOT NOR) DNA has cutting, copying, pasting, repairing, etc. Just like CPU has addition, bit-shifting, logical operators (AND OR NOT NOR) DNA has cutting, copying, pasting, repairing, etc.
10
Useful in the studies of: Logic Encryption Genetic programming and algorithms Automata Language systems
11
Quantum Computing Beyond the ordinary binary “on” and “off” (represented by 1 and 0), quantum computing has a third state that is both 1 and 0 at the same time
12
Quantum Interference
15
The Quantum Bit One qubit can encode at a given moment of time both 0 and 1 One qubit can encode at a given moment of time both 0 and 1 Registers composed of qubits can store greater information at once Registers composed of qubits can store greater information at once Quantum computer offers enormous gain in the use of resources such as time and memory Quantum computer offers enormous gain in the use of resources such as time and memory
16
Simple quantum gates
19
Other features Quantization - observable quantities do not vary continuously but come in discrete chunks or 'quanta' Quantization - observable quantities do not vary continuously but come in discrete chunks or 'quanta' Entanglement - Two spatially separated and non-interacting quantum systems that have interacted in the past may still have some locally inaccessible information in common - information which cannot be accessed in any experiment performed on either of them alone Entanglement - Two spatially separated and non-interacting quantum systems that have interacted in the past may still have some locally inaccessible information in common - information which cannot be accessed in any experiment performed on either of them alone
20
Problem: Decoherence Surrounding environment is affected by the interactions that generate quantum superpositions Surrounding environment is affected by the interactions that generate quantum superpositions Quantum computation will spread outside the computational unit Quantum computation will spread outside the computational unit Will irreversibly dissipate useful information to the environment Will irreversibly dissipate useful information to the environment
21
Promising future Grover’s search algorithm Grover’s search algorithm Shor’s factorization algorithm Shor’s factorization algorithm
22
Important applications Cryptography: perfectly secure communication Cryptography: perfectly secure communication Searching, especially algorithmic searching (Grover's algorithm) Searching, especially algorithmic searching (Grover's algorithm) Factorizing large numbers very rapidly (Shor's algorithm) Factorizing large numbers very rapidly (Shor's algorithm) Simulating quantum-mechanical systems efficiently Simulating quantum-mechanical systems efficiently
23
Molecular Computing Use of molecules as transistors, allowing chips to hold billions or trillions of switches and components Use of molecules as transistors, allowing chips to hold billions or trillions of switches and components
24
Comparing to Silicon very easy and cheap to make very easy and cheap to make Molecules only a few nanometers in size Molecules only a few nanometers in size Cheaper non-volatile memory Cheaper non-volatile memory
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.