 |
||||||||||||||||||||
|
|
|||||||||||||||||||
|
Quantum Computing Qubits and Logic Architectures Communications and Storage Theory and Algorithms Neil Gershenfeld, Massachusetts Institute of Technology Cambridge, Massachusetts web.media.mit.edu/~neilg Robert Joynt, University of Wisconsin Madison, Wisconsin uw.physics.wisc.edu/~joynt Bruce Kane, University of Maryland College Park, Maryland www.glue.umd.edu/~bekane/QC/QC@UMD’s_LPS_Bruce_Kane.htm Franco Nori, University of Michigan Ann Arbor, Michigan www-personal.engin.umich.edu/~nori What to Look For Qubits and Logic: Encoding information in logical qubits Creating entanglement on demand Qubits that last for whole seconds Reliably transferring information from atoms to photons and back Computers: Fault-tolerant operation of a multi-qubit computer 10-qubit computer 100-qubit computer 1,000-qubit computer A quantum computer that outperforms classical computers Communications: Electric, room-temperature single-photon sources Efficient sources of entangled photons Efficient room-temperature photon detectors Quantum repeaters or relays Algorithms: Proof of a quantum speedup for route optimization-type problems Proof of a quantum speedup for pattern recognition problems Proof of a quantum speedup for simulating chaos |
||||||||||||||||||||
|
||||||||||||||||||||
|
|
||||||||||||||||||||
|
||
| |