1 / 14

Quantum Computers

By Christopher Coffman 11/7/2012. Quantum Computers. QuestionsThat W ill H opefully B e Clearer at the Presentation’s E nd. What are q uantum c omputers? What are the physics concepts are at play? What are the basic components of a quantum computer and how they are used?

lovey
Download Presentation

Quantum Computers

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. By Christopher Coffman 11/7/2012 Quantum Computers

  2. QuestionsThatWill Hopefully Be Clearer at the Presentation’s End • What are quantum computers? • What are the physics concepts are at play? • What are the basic components of a quantum computer and how they are used? • What are some different models for quantum computing? • What are some of the candidates for quantum computers? • What’s the present state of quantum computing?

  3. Traditional Computers • Computers are defined as devices which contain some kind of processor and memory. • Typical “Digital” processors interrupt information and then makes decisions. • This info is normally in groups of byte, which contain 8 bits(0 or 1 value) . • Ergo 8 bits = 2^8=256 different combinations for information.

  4. Turing Machine Alan Turing (1936) describes a machine which reads symbols on a tape and inter- -puts it via a table of rules.

  5. Quantum Turing Machines (QTM) • Simply a Turing Machine whose tape is in a quantum state. • Turing-Deutsch principle states that QTM can simulate every physical process, assuming Quantum Mechanic can completely describe the state. • The information exists in qubits, or like its digital analogue bits.

  6. The Physics Behind This Stuff • Quantum Entanglement is the phenomenon of when two quantum states become paired and thus have the same state at all times. • Superposition the ability of any function to be a superposition (linear combination) of all the possible states.

  7. Qubits • Quantum Bits a piece of info that can be Either on, off, or somewhere between. • The unitary transforms these bits Undergo can be thought of using an Angle within the Bloch Sphere • 500 qubits allows for up to 2^500 states to Be examined at once, while classical computers can express merely 500 states. • Processed/travel Quantum Logic Gates

  8. Quantum Algorithms • There are two main quantum Algorithms at this time. • Shor’s -for integer factorization. Very useful in cryptography. • Grover’s –for searching unsorted databases of N entries.

  9. SQUIDs and Josephson junctions • SQUID – Superconducting Quantum Interference Device allows for detection minute changes in magnetic fields • Josephson Junctions- creates low resistance circuits for qubits which allow for massive amounts of info to transmitted relatively quickly.

  10. Quantum Computing Today • The system’s still lack large scale qubit systems. • Quantum Memory Storage has yet to be touched! • Quantum Algorithms are being formulated to create more useful applications of systems • Recent Nobel Prize was in measuring and maintain quantum states within a field.

  11. In Summary… • Quantum Computing is still in it’s infancy, and we don’t know if they are even physically possible yet. • Algorithms need to be improved and expanded if serious computing increases are to be realized. • Would prove several aspect of QM and at the same time develop ways of controlling these states.

  12. Fun Videos • http://www.youtube.com/watch?feature=player_embedded&v=cYw2ewoO6c4

  13. References • Hardesty, Larry. Qunatum Computing may actually be useful. 2012. 5 November 2012 <http://web.mit.edu/newsoffice/2009/quantum-algorithm.html>. • Morton, John J, et al. "Solid-state quantum memory using the 31P nuclear spin`." Nature (2008): 1085-1088. • UC Berkeley. "Quantum Akgorithms." n.d.Computer csienceBerkely. 5 November 2012 <http://www.cs.berkeley.edu/~vazirani/algorithms/chap10.pdf>. • University of Arkansas. Turing Machine. 4 May 2011. 7 November 2012 <http://math2033.uark.edu/wiki/index.php/Turing_machine>. • Wikipedia. "Allen Turing." 24 June 2010. Wekipeda. 6 November 2012 <http://en.wikipedia.org/wiki/File:Alan_Turing_photo.jpg>. • —. Bit. 27 October 2012. 6 11 2012 <http://en.wikipedia.org/wiki/Bit>. • —. Computers. 24 October 2012. 6 November 2012 <http://en.wikipedia.org/wiki/Computer#Components>. • —. SQUID. 23 October 2012. 6 November 2012 <http://en.wikipedia.org/wiki/SQUID>. • Youtube. Lego Turing MAchine. Denmark, 28 Jan 2009.

  14. Questions

More Related