0% found this document useful (0 votes)
48 views32 pages

Quantum Information & Computing

This document summarizes key concepts in quantum information and computing. It discusses potential applications of quantum computers such as simulating quantum systems, solving optimization problems more efficiently through quadratic or exponential speedups, and breaking modern encryption methods like prime factorization. It then covers basic concepts like qubits, superpositions, measurements, logical gates, and error correction needed for quantum computers. It also summarizes techniques for transmitting quantum information like teleportation, dense coding, and secure key distribution protocols like BB84. Finally, it evaluates candidate physical systems for implementing qubits and quantum computers based on requirements like extendability, resetting to known states, low decoherence, and reliable measurement.

Uploaded by

Julien Gacon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views32 pages

Quantum Information & Computing

This document summarizes key concepts in quantum information and computing. It discusses potential applications of quantum computers such as simulating quantum systems, solving optimization problems more efficiently through quadratic or exponential speedups, and breaking modern encryption methods like prime factorization. It then covers basic concepts like qubits, superpositions, measurements, logical gates, and error correction needed for quantum computers. It also summarizes techniques for transmitting quantum information like teleportation, dense coding, and secure key distribution protocols like BB84. Finally, it evaluates candidate physical systems for implementing qubits and quantum computers based on requirements like extendability, resetting to known states, low decoherence, and reliable measurement.

Uploaded by

Julien Gacon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 32

Quantum information

and computing
Charles H. Bennett & David P. DiVincenzo
Why use quantum computers?

Applied sciences General speedup Cryptography

● Quantum system ● Search problems ● Prime factorisation


simulations ● Optimisation problems ● Safe key distribution
● Fast fourier transform

→ Exponential speedup! → Quadratic speedup


Basics of quantum
computers
Classical computer Quantum computer

● Bit (0 or 1) as information entity ● Qubit (Polarisation, Spin, ..)


● State representation: ● State representation:

● States are vectors on the


dimensional unit sphere
Superpositions

Qubits can exist in superpositions (ex.: Polarisation):

State for multiple qubits:


Measurements

Only orthogonal states are reliably distinguishable!

Gate Gate
X +
Logical operations

One-qubit gate Two-qubit gate

XOR-Gate flips target input, if the


control input is 1.
Achieved through optical waveplates
(→ changes polarisation)
Environmental interactions

● Superpositions collapse easily (“decoherence”)


● Quantum Fault-Tolerant Computations

→ restrict to finite per-gate decoherence


Data transmission
Error correction
Classical error Quantum error
correction correction
● Safety achieved by redundancy ● No-cloning theorem
● Workaround: XOR-Gate!

Remember:

Apply twice to quantum state:


→ corrupted message still readable!
Retrieve initial state

There are matrices P such that the corrupted position can be extracted:

Position 0 corresponds to no corruption.


Retrieve initial state

For the case you care..


Retrieve initial state

No corruption:

State k was flipped:

Otherwise 0.
Compression
Sending quantum states
Quantum fax machine?
Quantum teleportation
.. or transmission, actually.

● Alice performs Bell-Measurement


Lorem ipsum dolor sit amet,
of her particle and her EPR
consectetur adipiscing elit. Curabitur
part
Send
● eget thein result
risus to Bob classically
turpis aliquam
● Bob recreates
consequat luctus acthe initial state
tellus.
Quantum teleportation
.. or transmission, actually.
Alice

● Alice performs Bell-Measurement


Lorem ipsum dolor sit amet,
of her particle and her EPR
consectetur adipiscing elit. Curabitur
part
Send
● eget thein result
risus to Bob classically
turpis aliquam
● Bob recreates
consequat luctus acthe initial state
tellus.

Bob
Superdense coding
Enhance classical communication with qubits

● Bob measures his EPR particle in a


certain
Lorem ipsum dolor sit amet,
way
consectetur adipiscing elit. Curabitur
● Using a Bell-Measurement Alice
eget risus in turpis aliquam
sees in which of four possible
consequat luctus ac tellus.
states the EPR pair is in

One out of four → two bits of information


Superdense coding

Manipulating qubit B to result in


one of four Bell-states
Quantum fault-tolerant
computation
Quantum fault-tolerant computation

ipsum dolor sit amet,


● Lorem
Periodic restauration
consectetur adipiscing elit. Curabitur
● Compare to DRAM
eget risus in turpis aliquam
consequat luctus ac tellus.

O(log t) gates for fault-tolerant t step computation!


Cryptography
Breaking encyption
Secure key sharing
BB84 We need: + and X polarisation
filters, a public and a direct channel

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

conditions Reliable reset to 0 possible

Low decoherence

Reliably measurable
Candidate 1: Extenadable:

Spin in an ion More atoms in the ion trap

Reset to 0:
trap Laser cooling to ground state

Low decoherence:
Environment interactions are low

Measurability:
“Quantum-jump spectroscopy”
Candidate 2: Extenadable:

NMR Larger molecules

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

You might also like