Quantum Information & Computing
Quantum Information & Computing
and computing
Charles H. Bennett & David P. DiVincenzo
Why use quantum computers?
Gate Gate
X +
Logical operations
Remember:
There are matrices P such that the corrupted position can be extracted:
No corruption:
Otherwise 0.
Compression
Sending quantum states
Quantum fax machine?
Quantum teleportation
.. or transmission, actually.
Bob
Superdense coding
Enhance classical communication with qubits
Charles Bennett
& Gilles Brassard, 1984 Preparation: repeat N times
● A measures a qubit and sends to B
● B measures the qubit
Evaluation:
● Choose all qubit which were
measured with the same filter
● Check the error rate within these
filters
→ Large error indicates an eavesdropper!
BB84 in action
Alice measures | ― / ― \ \ |
Eve uses + X + X + X +
Bob uses + + + + X X +
Bob measures | ― ― | / \ |
Same filter? ✅ ✅ × ✅ ✅ ✅ ✅
Same result? ✅ ✅ × × ✅ ✅
In ⅓ of the cases with same filters Alice and Bob got different results
→someone fiddled with their qubit!
Current status
Qubit System must be extendable
Low decoherence
Reliably measurable
Candidate 1: Extenadable:
Reset to 0:
trap Laser cooling to ground state
Low decoherence:
Environment interactions are low
Measurability:
“Quantum-jump spectroscopy”
Candidate 2: Extenadable:
Reset to 0:
spectroscopy Fast pulse operations
Low decoherence:
Sufficiently long decoherence time
Measurability:
Standard operation in NMR
What comes first?
1: Quantum computer faster than ordinary one
2: Sun burns up