Sending report ...Nanotechnology 501 Lecture Series
An Introduction to Quantum Computing
- This resource has a 9.5 Ranking
-
Ranking is calculated from a formula comprised of user reviews and usage statistics. Learn more ›
Usage Stats Last 12 Months: updated 01 Nov, 2008 Users: 51 Reviews & Citations Google/IEEE Avg. Review: Citations: 0
51 users
Supporting Documents
- Presentation (with audio) (SWF)
- Presentation Slides (PDF, 213.98 Kb)
- Podcast (video) What's this? (MP4, 54.87 Mb)
- Podcast (audio) What's this? (MP3, 28.98 Mb)
- List of References Handout (PDF, 64.02 Kb)
| Contributor(s) | Edward Gerjuoy University of Pittsburgh Dept. physics |
|---|---|
| Abstract | Quantum mechanics, as formulated more than 80 years ago by Schrodinger, Heisenberg, Dirac and other greats, is a wholly sufficient foundation for its modern interrelated subfields of quantum computation (qc) and quantum information (qi), which generally are lumped together into a single subfield (qc/qi). In short qc/qi, though it has been exciting the attention of a very rapidly increasing number of physicists, involves no genuinely new physics. On the other hand some of the important features and implications of quantum mechanics had been only barely appreciated before the advent of qc/qi researches, about 25 years ago. The first portion of this talk will define the fundamental qc component, namely the qubit, and will describe some possible physical realizations of qubits. The talk then will focus on one alluded-to feature (entanglement) and one implication (the so-called no cloning theorem), which for unfathomable reasons still receive little or no attention in modern quantum mechanics texts. The talk will close with an explanation (as detailed as time permits) of how a qc computation actually is performed. This explanation will involve pertinent brief references, but no more than brief references, to the so-called Shor factoring algorithm, which provides the best known illustration of the potential power of qc; an adequate explication of Shor’s algorithm would require a full colloquium in itself. My entire talk should be quite comprehensible to any graduate student who has taken an introductory course in quantum mechanics, even if only at the undergraduate level. |
| Biography | 
Edward Gerjuoy received his Ph.D. in theoretical physics from the University of California at Berkeley in 1942. After working on antisubmarine warfare problems during World War II he taught at several academic institutions, winding up at the University of Pittsburgh where he presently is Professor of Physics Emeritus, having been appointed professor in 1964. In 1977 he obtained a law degree, and thereafter for many years shared his time between physics and the law. As a scientist lawyer he has been Editor-in-Chief (1981-1986) of the American Bar Association (ABA) Journal of Law, Science and Technology. During his entire career, however, he also has devoted considerable time to the defense of human rights. In particular, he has several times served as Chair of the American Physical Society Committee on the International Freedom of Scientists, the APS human rights committee; he also was a member of the legal team that successfully defended Los Alamos scientist Wen Ho Lee against government charges of mishandling classified documents with the intent to injure the United States. He terminated his legal activities about five years ago, however, and since then has been devoting his full time to research on quantum computing theory. He is the author of over 100 papers in the physics literature, mainly on atomic collision theory, and about 30 papers on various physics and public policy topics.
His quantum computing/information publications include:
|
| Sponsored by | Condensed Matter and Biological Physics Seminar, Purdue University |
| Cite this work | If you reference this work in a publication, please cite as follows: |
| Date posted | 12 Sep, 2008 |
| Time | 03:30 PM, February 22, 2008 |
| Location | Physics 223, Purdue University, West Lafayette, IN |
| Type | Online Presentations |
| Tags |
Citations
The following are publications that have cited this resource, separated by their affiliation to the NCN.
No citations found.
Reviews
The following are reviews of this resource from other site members.
-
Posted on 13 October, 2008 by Joseph M. Cychosz
0 0 Login to vote Gerjuoy brings clarity to what is a fairly obscure and abstract concept of computing.
reply | report abuse
See also
The following are resources that may cover similar or related topics.
-
9.5 Ranking Series
Part of: Nanotechnology 501 Lecture Series
Nanotechnology 501 Lecture Series
Type Series Contributor(s) Gerhard Klimeck (editor), Mark Lundstrom (editor), Joseph M. Cychosz (editor) Date 22 Feb, 2005 Avg. Rating (4) Rate this Nanotechnology 501 is a series of lectures designed to provide an introduction to nanotechnology. This series is similar to our popular Nanotechnology 101 series, but directed at the graduate student/professional level.
People who looked at this also looked at:
Network Recommendations powered by CIKNOW developed by the Science of Networks in Communities Research (SONIC) group at Northwestern University.
Recommendations will load momentarily. If you do not see content change after 30 seconds, there may be a number of reasons:
- You have javascript turned off in your browser.
- You have browser incapable of handling the scripts that load the recommendations.
- There is a problem with the recommendation service and it failed to respond.