Reversibility &

Computing
Quantum

Quantum
Computing
Reversibility &
 Mandate

Why do all these Quantum Computing

guys use reversible logic?
 Material

Logical reversibility of computation

Bennett 73

Elementary gates for quantum computation

Berenco et al 95

[] quantum computation using teleportation

Gottesman, Chuang 99
 Material

Logical reversibility of computation

Bennett 73
Quantum computing needs logical reversibility
Elementary gates for quantum computation
Berenco et al 95
Gates can be thermodynamically irreversible
[] quantum computation using teleportation
Gottesman, Chuang 99
 Material

Logical reversibility of computation

Bennett 73
Quantum computing needs logical reversibility
Elementary gates for quantum computation
Berenco et al 95
Gates can be thermodynamically irreversible
[] quantum computation using teleportation
Gottesman, Chuang 99
Heat Generation in Computing

Landauers Principle
Want to erase a random bit? It will cost you
Storing unwanted bits just delays the inevitable

Bennetts Loophole
Computed bits are not random
Can uncompute them if were careful
 Example

Input
(11)

Work
bits
 Example

Input
(11)

Work
bits
 Example

Input
(11)

Work
bits
 Example

Input
(11)

Work
bits
Output (1)
 Example

Input
(11)

Work
bits
Output
Output
 Example

Compute Uncompute
Copy Result
Thermodynamic Reversibility

a c?b:a
b c?a:b
c c
 Material

Logical reversibility of computation

Bennett 73
Quantum computing needs logical reversibility
Elementary gates for quantum computation
Berenco et al 95
Gates can be thermodynamically irreversible
[] quantum computation using teleportation
Gottesman, Chuang 99
Quantum State
Two Distinguishable States

Continuous State Space

a +b
Two Spin- Particles
Four Distinguishable States

 Continuous State Space

a +b +c +d

Continuous State Space
Continuous State Space
 State Evolution

(Continuous form)

(Discrete form)

H is Hermitian, U is Unitary
Linear, deterministic, reversible
 Measurement

Outcome m occurs with probability p(m)

Operators Mm non-unitary
Probabilistic, irreversible
 Deriving Measurement

It can be done up to a
Like a snake point But it becomes
trying to embarrassing to the
swallow itself spectators even before it
by the tail becomes uncomfortable
for the snake
Bell
 A Simple Measurement

a +b

Outcome with probability

Outcome with probability

A Simulated Measurement

a +b

A Simulated Measurement

a +b

A Simulated Measurement

a +b

A Simulated Measurement

or

Terms remain orthogonal
evolve independently, no interference
Density Operator Representation
Mixed States
Partial Trace

A
+
B
Discarding a Qubit
 Material

Logical reversibility of computation

Bennett 73
Quantum computing needs logical reversibility
Elementary gates for quantum computation
Berenco et al 95
Gates can be thermodynamically irreversible
[] quantum computation using teleportation
Gottesman, Chuang 99
 Toffoli Gate

a a

b b

c c ab
Deutschs Controlled-U Gate

a a

b b

c U c

for Toffoli gate

Equivalent Gate Array

=
U V V V

for Toffoli gate

 Equivalent Gate Array

P
=
U C B A
Almost Any Gate is Universal
 Material

Logical reversibility of computation

Bennett 73
Quantum computing needs logical reversibility
Elementary gates for quantum computation
Berenco et al 95
Gates can be thermodynamically irreversible
[] quantum computation using teleportation
Gottesman, Chuang 99
Protecting against a Bit-Flip (X)

Input Even Odd Odd Output

Syndrome third qubit flipped
(reveals nothing about state)
Protecting against a Phase-Flip (Z)

Phase flip
(Z)
 General Errors

Pauli matrices form basis for 1-qubit operators:

I is identity, X is bit-flip, Z is phase-flip

Y is bit-flip and phase-flip combined (Y = iXZ)
 9-Qubit Shor Code

Protects against all one-qubit errors

Error measurements must be erased
Implies heat generation
 Material

Logical reversibility of computation

Bennett 73
Quantum computing needs logical reversibility
Elementary gates for quantum computation
Berenco et al 95
Gates can be thermodynamically irreversible
[] quantum computation using teleportation
Gottesman, Chuang 99
Fault Tolerant Gates

S
 Fault Tolerant Gates
H
H
H
encoded encoded
input H control
qubit qubit
(Steane H (Steane
code) code)
H
H

ZS
ZS
ZS
encoded encoded
input ZS target
qubit qubit
(Steane ZS (Steane
code) code)
ZS
ZS
 Clifford Group

Encoded operators are tricky to design

Manageable for operators in Clifford group using

stabilizer codes, Heisenberg representation

Map Pauli operators to Pauli operators

Not universal
Teleportation Circuit

M1
H

M2

XM2 ZM1
Simplified Circuit
Equivalent Circuit

H X
Implementing a Gate

H X T
Implementing a Gate

H T SX
Implementing a Gate

H T SX
 Conclusions

Quantum computing requires logical reversibility

Entangled qubits cannot be erased by dispersion

Does not require thermodynamic reversibility

Ancilla preparation, error measurement = refrigerator