Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and...
Transcript of Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and...
![Page 1: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/1.jpg)
Hamiltonian Cellular Automata in1D
Pawel M. Wocjan
School of Electrical Engineering and Computer Science
University of Central Florida
Orlando
Hamiltonian Cellular Automata in 1D – p. 1/24
![Page 2: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/2.jpg)
Joint work with
Daniel Nagaj (MIT)
quant-ph/0802.0886
Hamiltonian Cellular Automata in 1D – p. 2/24
![Page 3: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/3.jpg)
Quantum Circuit Model
abstracts from the details of concrete physical systemsand states that the required elementary operations are
initialization in basis states
implementation of one and two-qubit gates
measurement of single qubits in basis states
many other models such as measurement-based qc,adiabatic qc, topological qc
however, the common principle underlying all thesemodels is that the computation process is driven byapplying a sequence of control operations
Hamiltonian Cellular Automata in 1D – p. 3/24
![Page 4: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/4.jpg)
Hamiltonian Quantum Computer
prepare an initial state in the computational basis thatencodes both the data and program
let the Hamiltonian time evolution act undisturbed for asufficiently long time
measure a small subsystem in the computational basisto obtain the result of the computation with highprobability
Hamiltonian Cellular Automata in 1D – p. 4/24
![Page 5: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/5.jpg)
Hamiltonian Quantum Cellular Automaton
more specifically, we call it a Hamiltonian quantumcellular automaton provided that
the Hamiltonians acts on qudits that are arranged onsome lattice
is invariant with respect to transitions along thesymmetry axis of the lattice
contains only finite range interactions
most natural Hamiltonians have these properties, so itis important to construct HQCA that are as close aspossible to natural interactions
Hamiltonian Cellular Automata in 1D – p. 5/24
![Page 6: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/6.jpg)
Continuous-time versus Discrete-Time QCA
the evolution of discrete-time QCA proceeds in discreteupdate steps (tensor products of local unitaryoperations)
the execution of updates on overlapping cells issynchronized by external control
in contrast, the states of the HQCA change in acontinuous way according to the Schrödinger equation(time-independent Hamiltonian)
all the couplings (interactions) are present all the time⇒ they have to include a mechanism that ensures thelogical operations are executed in the correct order
Hamiltonian Cellular Automata in 1D – p. 6/24
![Page 7: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/7.jpg)
Motivation
fundamental question in thermodynamics ofcomputation how to realize computational processeswithin a closed physical system
HQCA could trigger new ideas for reducing the set ofnecessary control operations in current proposals byusing the inherent computational power of theinteractions
this model can show the limitations of current and futuremethods in condensed for simulating the time evolutionof translationally invariant systems
Hamiltonian Cellular Automata in 1D – p. 7/24
![Page 8: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/8.jpg)
Related works
Benioff/Feynman/Margolus
Janzing/W.initial state is a canonical basis state; finite rangeinteractions in 2D
univ. nn H. in 2D acting on qutrits; is trans. inv. only iftranslated over several lattice sites
Vollbrecht/Ciracuniv. trans. inv. nn H in 1D acting on 30-dimensionalqudits
Chase/Landahluniv. nn H in 1D acting on 8-dimensional qudits; but nottrans. inv.
Hamiltonian Cellular Automata in 1D – p. 8/24
![Page 9: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/9.jpg)
Our Hamiltonian
acts on 10-dimensional qudits arranged on a 1D chain
contains only nearest-neighbor couplings (pairinteractions)
is translationally invariant (translation by one cell)
Hamiltonian Cellular Automata in 1D – p. 9/24
![Page 10: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/10.jpg)
Universal Quantum Gates
we can realize universal QC with the controlled gate
W =
1 0 0 0
0 1 0 0
0 0 1√2
− 1√2
0 0 1√2
1√2
provided that we can apply it to arbitrary pairs of qubits
however, we want to operate only on adjacent qubits ⇒we have to include the swap gate S
Hamiltonian Cellular Automata in 1D – p. 10/24
![Page 11: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/11.jpg)
Universal “Staircase” Quantum Circuits
|w1〉W I S
|w2〉S W W
|w3〉
Hamiltonian Cellular Automata in 1D – p. 11/24
![Page 12: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/12.jpg)
Hilbert space of the HQCA
a cell Hc consists of a program subcell and a datasubcell
Hc = Hp ⊗Hd = C5 ⊗ C
2
the canonical basis states of Hp are| ◮〉 pointer symbol| � 〉 empty spot symbol|W 〉, |S〉, |I〉 gates symbols
the canonical basis states of the Hd are |0〉 and |1〉
the Hilbert space of the HQCA is
Hc ⊗Hc ⊗ · · · ⊗ Hc
Hamiltonian Cellular Automata in 1D – p. 12/24
![Page 13: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/13.jpg)
Initialization of the HQC
|w1〉W I S
|w2〉S W W
|w3〉
the initial state |ϕ〉 is a canonical basis state
� � ◮ � � ◮ � � ◮ I W S I I W I S W I
0 0 0 0 0 0 0 0 0 w1 w2 w3 0 0 0 0 0 0 0
Hamiltonian Cellular Automata in 1D – p. 13/24
![Page 14: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/14.jpg)
Transition Rules of the HQCA
� � ◮ � � ◮ � � ◮ I W S I I W I S W I
0 0 0 0 0 0 0 0 0 w1 w2 w3 0 0 0 0 0 0 0
Hamiltonian Cellular Automata in 1D – p. 14/24
![Page 15: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/15.jpg)
Transition Rules of the HQCA
� � ◮ � � ◮ � � I ◮ W S I I W I S W I
0 0 0 0 0 0 0 0 0 w1 w2 w3 0 0 0 0 0 0 0
I has been applied to 0 and w1
Hamiltonian Cellular Automata in 1D – p. 15/24
![Page 16: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/16.jpg)
Transition Rules of the HQCA
� � ◮ � � ◮ � I � ◮ W S I I W I S W I
0 0 0 0 0 0 0 0 0 w1 w2 w3 0 0 0 0 0 0 0
I has moved one spot to the left
Hamiltonian Cellular Automata in 1D – p. 16/24
![Page 17: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/17.jpg)
Transition Rules of the HQCA
� � ◮ � � ◮ � I � W ◮ S I I W I S W I
0 0 0 0 0 0 0 0 0 w1 w2 w3 0 0 0 0 0 0 0
W has been applied to w1 and w2
Hamiltonian Cellular Automata in 1D – p. 17/24
![Page 18: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/18.jpg)
Transition Rules of the HCA
� � ◮ � � ◮ � I � W S ◮ I I W I S W I
0 0 0 0 0 0 0 0 0 w1 w2 w3 0 0 0 0 0 0 0
S has been applied to w2 and w3
Hamiltonian Cellular Automata in 1D – p. 18/24
![Page 19: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/19.jpg)
Transition Rules of the HCA
a gate particle A ∈ {W,S, I} can move one spot to theleft if that spot is empty
� A → A �
if a gate particle meets the pointer ◮, then A and ◮
swap positions and the gate A is applied to the twoqubits below
◮ A
x y→
◮ A
A(x, y)
Hamiltonian Cellular Automata in 1D – p. 19/24
![Page 20: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/20.jpg)
Hamiltonian of the HCA
the Hamiltonian is
H =∑
j
(F + F †)(j,j+1)
the forward-time operator
F =∑
A∈{W,S,I
[
|A �〉〈� A|p,p′ ⊗ Id,d′ + |A ◮〉〈◮ A|p,p′ ⊗Ad,d′
]
realizes the transition rules
Hamiltonian Cellular Automata in 1D – p. 20/24
![Page 21: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/21.jpg)
Analysis of the Run-Time
the time evolved state |ϕ(t)〉 = exp(−iHt)|ϕ〉 can bewritten as
∑
C
αC(t)|C〉 ⊗ |ψC〉 ⊗ |00 · · · 0〉
C is a configuration of the program band
|ψC〉 is the state of the data register corresponding toC
|00 · · · 0〉 is the (invariant) state of the data bandoutside the data register
Hamiltonian Cellular Automata in 1D – p. 21/24
![Page 22: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/22.jpg)
Analysis of the Run-Time
choose t so that all gate particles of the program codehave moved to the left of the data register
Hamiltonian Cellular Automata in 1D – p. 22/24
![Page 23: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/23.jpg)
Dynamics of hard-core bosons in 1D
W S I 7→ 1 � ◮ 7→ 0
the initial state is mapped onto
· · · 000000000000000000|11111111111111111111111111111 · · ·
how long does it take the L blue particles to move to theleft of | with high probability under the dynamics
H =∑
j
(
|01〉〈10| + |10〉〈01|)
j,j+1
if we let the system evolve for t chosen uniformly atrandom from [0,Θ(L logL)], the probability is at least5/6 −O(1/ logL)
Hamiltonian Cellular Automata in 1D – p. 23/24
![Page 24: Hamiltonian Cellular Automata in 1Dcnls.lanl.gov/~ashipman/conferences/Classical and Quantum/wocjan… · prepare an initial state in the computational basis that encodes both the](https://reader036.fdocuments.in/reader036/viewer/2022070100/600315b58755f727494433cb/html5/thumbnails/24.jpg)
Conclusion/Future Research
Hamiltonian Quantum Cellular Automaton
does not require any control operations duringcomputational process
requires only the preparation of product states in thecanonical basis and measurement of a smallsubsystem in the canonical basis
reduce the dimension of the cells even further
incorporate fault-tolerance in HQCA
Hamiltonian Cellular Automata in 1D – p. 24/24