Universal computation by quantum walk
|
|
- Liliana Thomas
- 6 years ago
- Views:
Transcription
1 Universal computation by quantum walk Andrew Childs C&O and IQC Waterloo arxiv:
2 Random walk A Markov process on a graph G = (V, E).
3 Random walk A Markov process on a graph G = (V, E). In discrete time: V V Stochastic matrix W R ( k W kj =1) with W kj 0 iff (j, k) E probability of taking a step from j to k
4 Random walk A Markov process on a graph G = (V, E). In discrete time: V V Stochastic matrix W R ( k W kj =1) with W kj 0 iff (j, k) E probability of taking a step from j to k Dynamics: p t = W t p 0 p t R V t =0, 1, 2,...
5 Random walk A Markov process on a graph G = (V, E). In discrete time: V V Stochastic matrix W R ( k W kj =1) with W kj 0 iff (j, k) E probability of taking a step from j to k Dynamics: p t = W t p 0 p t R V t =0, 1, 2,... Ex: Simple random walk. W kj = { 1 deg j (j, k) E 0 (j, k) E
6 Random walk A Markov process on a graph G = (V, E).
7 Random walk A Markov process on a graph G = (V, E). In continuous time: Generator matrix M R V V ( k M kj =0) with M kj 0 iff (j, k) E probability per unit time of taking a step from j to k
8 Random walk A Markov process on a graph G = (V, E). In continuous time: Generator matrix M R V V ( k M kj =0) with M kj 0 iff (j, k) E Dynamics: probability per unit time of taking a step from j to k d dt p(t) =Mp(t) p(t) R V t R
9 Random walk A Markov process on a graph G = (V, E). In continuous time: Generator matrix M R V V ( k M kj =0) with M kj 0 iff (j, k) E probability per unit time of taking a step from j to k d Dynamics: dt p(t) =Mp(t) p(t) R V t R deg j j = k Ex: Laplacian walk. M kj = L kj = 1 (j, k) E 0 (j, k) E
10 Quantum walk Quantum analog of a random walk on a graph G = (V, E). Idea: Replace probabilities by quantum amplitudes.
11 Quantum walk Quantum analog of a random walk on a graph G = (V, E). Idea: Replace probabilities by quantum amplitudes. d dt p(t) =Mp(t) p(t) R V v V p v (t) = 1
12 Quantum walk Quantum analog of a random walk on a graph G = (V, E). Idea: Replace probabilities by quantum amplitudes. d dt p(t) =Mp(t) p(t) R V v V p v (t) = 1 i d dt q(t) =Hq(t) q(t) C V v V q v (t) 2 =1
13 Quantum walk Quantum analog of a random walk on a graph G = (V, E). Idea: Replace probabilities by quantum amplitudes. d dt p(t) =Mp(t) p(t) R V v V p v (t) = 1 i d dt q(t) =Hq(t) q(t) C V v V q v (t) 2 =1 H = H with H kj 0 iff (j, k) E
14 Quantum walk Quantum analog of a random walk on a graph G = (V, E). Idea: Replace probabilities by quantum amplitudes. d dt p(t) =Mp(t) p(t) R V v V p v (t) = 1 i d dt q(t) =Hq(t) q(t) C V v V q v (t) 2 =1 H = H with H kj 0 iff (j, k) E Ex: Adjacency matrix. H kj = A kj = { 1 (j, k) E 0 (j, k) E
15 Aside: Discrete-time quantum walk We can also define a quantum walk that proceeds by discrete steps. [Watrous 99]
16 Aside: Discrete-time quantum walk We can also define a quantum walk that proceeds by discrete steps. [Watrous 99] Unitary operator U with U kj 0 iff (j, k) E
17 Aside: Discrete-time quantum walk We can also define a quantum walk that proceeds by discrete steps. [Watrous 99] Unitary operator U with U kj 0 iff (j, k) E [Meyer 96], [Severini 03]
18 Aside: Discrete-time quantum walk We can also define a quantum walk that proceeds by discrete steps. [Watrous 99] Unitary operator U with U kj 0 iff (j, k) E [Meyer 96], [Severini 03] We must enlarge the state space: C V C V instead of C V. Unitary operator U with U (k,j),(j,l) 0 iff (j, k) E
19 Aside: Discrete-time quantum walk We can also define a quantum walk that proceeds by discrete steps. [Watrous 99] Unitary operator U with U kj 0 iff (j, k) E [Meyer 96], [Severini 03] We must enlarge the state space: C V C V instead of C V. Unitary operator U with U (k,j),(j,l) 0 iff (j, k) E In this talk we will focus on the continuous-time model.
20 Quantum walk algorithms Exponential speedup for black box graph traversal [CCDFGS 03] Search on graphs [Shenvi, Kempe, Whaley 02], [CG 03, 04], [Ambainis, Kempe, Rivosh 04] Element distinctness [Ambainis 03] Triangle finding [Magniez, Santha, Szegedy 03] Checking matrix multiplication [Buhrman, Špalek 04] Testing group commutativity [Magniez, Nayak 05] Formula evaluation [Farhi, Goldstone, Gutmann 07], [ACRSZ 07], [Cleve, Gavinsky, Yeung 07], [Reichardt, Špalek 08] Unstructured search (many applications) [Grover 96],...
21 The question How powerful is quantum walk? In particular: Can it do universal quantum computation?
22 The question How powerful is quantum walk? In particular: Can it do universal quantum computation? Loosely interpreted (any fixed Hamiltonian): Yes! [Feynman 85]
23 The question How powerful is quantum walk? In particular: Can it do universal quantum computation? Loosely interpreted (any fixed Hamiltonian): Yes! [Feynman 85] But what if we take the narrowest possible interpretation? Continuous-time quantum walk on a constant-degree graph, Hamiltonian given by the adjacency matrix (no edge weights)
24 The plan Scattering theory on graphs Gate widgets Simplifying the initial state: Momentum filtering and separation
25 Scattering theory [Liboff, Introductory Quantum Mechanics]
26 Momentum states Consider an infinite line:
27 Momentum states Consider an infinite line: Hilbert space: span{ x : x Z}
28 Momentum states Consider an infinite line: Hilbert space: span{ x : x Z} Eigenstates of the adjacency matrix: x k := e ikx k [ π, π) k with
29 Momentum states Consider an infinite line: Hilbert space: span{ x : x Z} Eigenstates of the adjacency matrix: x k := e ikx k [ π, π) k with We have x A k
30 Momentum states Consider an infinite line: Hilbert space: span{ x : x Z} Eigenstates of the adjacency matrix: x k := e ikx k [ π, π) k with We have x A k = x 1 k + x +1 k
31 Momentum states Consider an infinite line: Hilbert space: span{ x : x Z} Eigenstates of the adjacency matrix: x k := e ikx k [ π, π) k with We have x A k = x 1 k + x +1 k = e ik(x 1) + e ik(x+1)
32 Momentum states Consider an infinite line: Hilbert space: span{ x : x Z} Eigenstates of the adjacency matrix: x k := e ikx k [ π, π) k with We have x A k = x 1 k + x +1 k = e ik(x 1) + e ik(x+1) = (2 cos k) x k
33 Momentum states Consider an infinite line: Hilbert space: span{ x : x Z} Eigenstates of the adjacency matrix: x k := e ikx k [ π, π) k with We have x A k = x 1 k + x +1 k = e ik(x 1) + e ik(x+1) = (2 cos k) x k so this is an eigenstate with eigenvalue 2 cos k.
34 Scattering on graphs Now consider adding semi-infinite lines to two vertices of an arbitrary finite graph: G
35 Scattering on graphs Now consider adding semi-infinite lines to two vertices of an arbitrary finite graph: G
36 Scattering on graphs Now consider adding semi-infinite lines to two vertices of an arbitrary finite graph: G Three kinds of eigenstates:
37 Scattering on graphs Now consider adding semi-infinite lines to two vertices of an arbitrary finite graph: G Three kinds of eigenstates: x, left k, sc left = e ikx + R(k)e ikx x, right k, sc left = T (k)e ikx x, left k, sc right = T (k)e ikx x, right k, sc right = e ikx + R(k)e ikx x, left κ, bd ± =(±e κ ) x x, right κ, bd ± = B ± (κ)(±e κ ) x
38 Scattering on graphs Now consider adding semi-infinite lines to two vertices of an arbitrary finite graph: G Three kinds of eigenstates: x, left k, sc left = e ikx + R(k)e ikx x, right k, sc left = T (k)e ikx x, left k, sc right = T (k)e ikx x, right k, sc right = e ikx + R(k)e ikx x, left κ, bd ± =(±e κ ) x x, right κ, bd ± = B ± (κ)(±e κ ) x
39 Scattering on graphs Now consider adding semi-infinite lines to two vertices of an arbitrary finite graph: G Three kinds of eigenstates: x, left k, sc left = e ikx + R(k)e ikx x, right k, sc left = T (k)e ikx x, left k, sc right = T (k)e ikx x, right k, sc right = e ikx + R(k)e ikx x, left κ, bd ± =(±e κ ) x x, right κ, bd ± = B ± (κ)(±e κ ) x
40 Scattering on graphs Now consider adding semi-infinite lines to two vertices of an arbitrary finite graph: G Three kinds of eigenstates: x, left k, sc left = e ikx + R(k)e ikx x, right k, sc left = T (k)e ikx x, left k, sc right = T (k)e ikx x, right k, sc right = e ikx + R(k)e ikx x, left κ, bd ± =(±e κ ) x x, right κ, bd ± = B ± (κ)(±e κ ) x It can be shown that these states form a complete, orthonormal basis of the Hilbert space, where k [ π, 0] and > 0 takes certain discrete values.
41 Scattering on graphs This generalizes to any number of semi-infinite lines attached to any finite graph. line j = line j = line j = G
42 Scattering on graphs This generalizes to any number of semi-infinite lines attached to any finite graph. line j = 1 Incoming scattering states: x, j k, sc j = e ikx + R j (k) e ikx x, j k, sc j = T j,j (k) e ikx j j line j = line j = G
43 Scattering on graphs This generalizes to any number of semi-infinite lines attached to any finite graph. line j = 1 Incoming scattering states: x, j k, sc j = e ikx + R j (k) e ikx x, j k, sc j = T j,j (k) e ikx j j line j = line j = G Bound states: x, j κ, bd ± = B ± j (κ)(±e κ ) x
44 Dynamics of scattering Solution of the quantum walk equation: i d dt ψ(t) = H ψ(t) = ψ(t) = e iht ψ(0)
45 Dynamics of scattering Solution of the quantum walk equation: i d dt ψ(t) = H ψ(t) = ψ(t) = e iht ψ(0)
46 Dynamics of scattering Solution of the quantum walk equation: i d dt ψ(t) = H ψ(t) = ψ(t) = e iht ψ(0) N y, j e iht x, j = j=1 0 π e 2it cos k y, j k, sc j k, sc j x, j d k + κ,± e 2it cosh κ y, j κ, bd ± κ, bd ± x, j
47 Dynamics of scattering Solution of the quantum walk equation: i d dt ψ(t) = H ψ(t) = ψ(t) = e iht ψ(0) N y, j e iht x, j = j=1 0 π e 2it cos k y, j k, sc j k, sc j x, j d k + κ,± e 2it cosh κ y, j κ, bd ± κ, bd ± x, j = 0 π e 2it cos k( T j,j (k)e ik(x+y) + T j,j(k)e ik(x+y)) d k + e 2it cosh κ B ± j (κ)b ± j (κ) (±e κ ) x+y κ,±
48 The method of stationary phase
49 The method of stationary phase Suppose Á(k), a(k) are smooth, real-valued functions. Then for large x, the integral e ixφ(k) a(k)dk is dominated by those values of k for which. d dk φ(k) = 0
50 The method of stationary phase Suppose Á(k), a(k) are smooth, real-valued functions. Then for large x, the integral e ixφ(k) a(k)dk d is dominated by those values of k for which. dk φ(k) = 0 In scattering on graphs, we have y, j e iht x, j 0 π e ik(x+y) 2it cos k T j,j (k) dk
51 The method of stationary phase Suppose Á(k), a(k) are smooth, real-valued functions. Then for large x, the integral e ixφ(k) a(k)dk d is dominated by those values of k for which. dk φ(k) = 0 In scattering on graphs, we have y, j e iht x, j 0 π e ik(x+y) 2it cos k T j,j (k) dk The phase is stationary for k satisfying x + y + l j,j (k) =v(k)t v(k) := d dk 2 cos k = 2 sin k group velocity l j,j (k) := d dk arg T j,j (k) effective length
52 Finite lines suffice To obtain a finite graph, truncate the semi-infinite lines at a length O(t), where t is the total evolution time. This gives nearly the same behavior since the walk on a line has a maximum propagation speed of 2. E.g., from stationary phase: v(k) =2 sin k 2.
53 Computation by scattering Encode quantum circuits into graphs.
54 Computation by scattering Encode quantum circuits into graphs. Computational basis states correspond to lines ( quantum wires ).
55 Computation by scattering Encode quantum circuits into graphs. Computational basis states correspond to lines ( quantum wires ). Ex: With two qubits, we use four wires:
56 Computation by scattering Encode quantum circuits into graphs. Computational basis states correspond to lines ( quantum wires ). Ex: With two qubits, we use four wires: Quantum information propagates from left to right.
57 Computation by scattering Encode quantum circuits into graphs. Computational basis states correspond to lines ( quantum wires ). Ex: With two qubits, we use four wires: Quantum information propagates from left to right. To perform gates, attach graphs along/connecting the wires.
58 A universal gate set Theorem. Any unitary operation on n qubits can be approximated arbitrarily closely by a product of gates from the set ( ) ( ) , , i [Boykin et al. 00] We can implement these elementary gates (and indeed, any product of these gates) by scattering on graphs.
59 Controlled-not
60 Controlled-not in 01 in 10 in 11 in 00 out 01 out 10 out 11 out
61 Phase ( ) i
62 Phase ( ) i (b) in out
63 Phase ( ) i T in,out (k) = i cos 2k csc 3 k sec k 1 (b) in out π 3π 4 π 2 π k
64 Phase ( ) i 8 T in,out (k) = 8 + i cos 2k csc 3 k sec k l in,out ( π/4) = 1 1 (b) in out π 3π 4 π 2 π k
65 A basis-changing gate
66 A basis-changing gate 0 in 0 out 1 in 1 out
67 A basis-changing gate 0 in 1 in 0 out 1 out e ik (cos k + i sin 3k) T 0in,0 out (k) = 2 cos k + i(sin 3k sin k) 1 T 0in,1 out (k) = 2 cos k + i(sin 3k sin k) R 0in (k) =T 0in,1 in (k) = e ik cos 2k 2 cos k + i(sin 3k sin k) π 3π 4 π 2 π k
68 A basis-changing gate 0 in 1 in 0 out 1 out e ik (cos k + i sin 3k) T 0in,0 out (k) = 2 cos k + i(sin 3k sin k) 1 T 0in,1 out (k) = 2 cos k + i(sin 3k sin k) R 0in (k) =T 0in,1 in (k) = e ik cos 2k 2 cos k + i(sin 3k sin k) At k = ¼/4 this implements the unitary transformation U = 1 ( ) i i from inputs to outputs π 3π 4 π 2 π k
69 A basis-changing gate 0 in 1 in 0 out 1 out e ik (cos k + i sin 3k) T 0in,0 out (k) = 2 cos k + i(sin 3k sin k) 1 T 0in,1 out (k) = 2 cos k + i(sin 3k sin k) R 0in (k) =T 0in,1 in (k) = e ik cos 2k 2 cos k + i(sin 3k sin k) ( ) ( )( ) i At k = ¼/40this i 1 i 0 i implements the unitary transformation U = 1 ( ) i i = e iφ 1 ( ) from inputs to outputs π 3π 4 π 2 π k
70 Tensor product structure To embed an m-qubit gate in an n-qubit system, simply include the gate widget 2 n m times, once for every possible computational basis state of the n m qubits not acted on by the gate.
71 Tensor product structure To embed an m-qubit gate in an n-qubit system, simply include the gate widget 2 n m times, once for every possible computational basis state of the n m qubits not acted on by the gate. Note: The graph has 2 n poly(n) vertices (exponentially many), corresponding to the dimension of the Hilbert space used by the simulation. Vertices correspond to basis states, not qubits. Despite its exponential size, the graph has a succinct description in terms of the circuit being simulated. In particular, the quantum walk can be efficiently simulated by a universal quantum computer.
72 Composition law To perform a sequence of gates, simply connect the output wires to the next set of input wires.
73 Composition law To perform a sequence of gates, simply connect the output wires to the next set of input wires. Arrange the transmission/reflection coefficients as transformations from inputs to outputs: { R jin j = j T j,j = T jin,j out R j,j = T jin,j in j j { R jout j = j T j,j = T jout,j R in j,j = T jout,j out j j
74 Composition law To perform a sequence of gates, simply connect the output wires to the next set of input wires. Arrange the transmission/reflection coefficients as transformations from inputs to outputs: { R jin j = j T j,j = T jin,j out R j,j = T jin,j in j j { R jout j = j T j,j = T jout,j R in j,j = T jout,j out j j Then we have T 12 = T 1 (1 R 2 R1 ) 1 T 2 R 12 = R 1 + T 1 (1 R 2 R1 ) 1 R 2 T1 T 12 = T 2 (1 R 1 R 2 ) 1 T1 R 12 = R 2 + T 2 (1 R 1 R 2 ) 1 R1 T 2
75 Example H 00 in 00 out 01 in 10 in 01 out 10 out 11 in 11 out
76 Example in action
77 Simplifying the initial state So far, we have assumed that the computation takes place using only momenta near k = ¼/4.
78 Simplifying the initial state So far, we have assumed that the computation takes place using only momenta near k = ¼/4. Can we relax this restriction? Start from a single vertex of the graph?
79 Simplifying the initial state So far, we have assumed that the computation takes place using only momenta near k = ¼/4. Can we relax this restriction? Start from a single vertex of the graph? Idea: A single vertex has equal amplitudes for all momenta. Filter out momenta except within 1/poly(n) of k = ¼/4.
80 Momentum filter (d) in out
81 Momentum filter 1 (d) in out 1 4 π 3π 4 π 2 π k
82 Transfer matrix To create a narrow filter, repeat the basic filter many times in series.
83 Transfer matrix To create a narrow filter, repeat the basic filter many times in series. This can be analyzed using a transfer matrix approach. ( ) ( ) x +1 k, sc in x k, sc x k, sc in = M in Write x 1 k, sc in
84 Transfer matrix To create a narrow filter, repeat the basic filter many times in series. This can be analyzed using a transfer matrix approach. ( ) ( ) x +1 k, sc in x k, sc x k, sc in = M in Write x 1 k, sc in For m filters, suppose ( ) M m a b = c d Then T = 2ie ikm sin k ae ik b + c + de ik
85 Transfer matrix To create a narrow filter, repeat the basic filter many times in series. This can be analyzed using a transfer matrix approach. ( ) ( ) x +1 k, sc in x k, sc x k, sc in = M in Write x 1 k, sc in For m filters, suppose ( ) M m a b = c d Then T = 2ie ikm sin k ae ik b + c + de ik Eigenvalues of M π 3π 4 π 2 π k
86 The curse of symmetry Problem: Our filter passes k = 3¼/4 in addition to k = ¼/4.
87 The curse of symmetry Problem: Our filter passes k = 3¼/4 in addition to k = ¼/4. Generically, distinct momenta propagate at different speeds; but v( π/4) = 2 sin(π/4) = 2 v( 3π/4) = 2 sin(3π/4) = 2
88 The curse of symmetry Problem: Our filter passes k = 3¼/4 in addition to k = ¼/4. Generically, distinct momenta propagate at different speeds; but v( π/4) = 2 sin(π/4) = 2 v( 3π/4) = 2 sin(3π/4) = 00!in2! 00out (b) 00in 00 (a) (a) (b) out! ny stationary and the of the firstisterm is points, andpoints, the phase of phase the first term 01!in! 01in! (k) 2t cos k, which is staven by k(x + y) + arg T j,j y) + arg Tj,j! (k) 2t cos k, which is sta 10!in! 10in onary In for fact, all widgets so far have a symmetry3 under 11! x + y +!j,j! (k) = v(k)t,! (k) x + y +(a)!j,j 00 00out! (b) in! = v(k)t, 00in! 00out! (a) 01 (b)! 01! here out in 01! 01out! 10inin! 10out! in! 10in! d 10out! in! 11in:=! 11 2 cos kout =! 2 sin k v(k) 11in! dk 11out! d 2 cos k = 2 sin k (k) := the 0 group atout momentum! (c) (d) k, and in! dkvelocity 0 (c) 0in! 0out! (d) d and ocity k, 1inat! momentum 1! out!! (k) := arg T 1in! j,j 1out dk! j,j! (k) (8) (8) out! out! (9) (9) 3 (c) 0in! (c) 0in! 1in! 1in! 11ink!in 01out! out! 01 10out!! in! 10 in! out 11 out! k. π 11out! 0out! 0out! (d) (e) (d) (e) 1out! 1out! out! out! in! in! out! in! in! out! FIG. 1: Widgets used to construct a universal quantum (e) (e) puter. Open circles indicate vertices where previous o FIG. cessive 1: Widgets toattached. construct universal quant widgetsused can be (a)acontrolled-note gat in! (10) out! Phase shift. (c) Basis-changing gate. where (d) Momentum puter. Open circles indicate vertices previou in! out! (e)widgets Momentum cessive canseparator. be attached. (a) Controlled-note d in! through out! the path G from j!j,j!effective (k) := length argoftthe (10) line Phase j,j! (k) in! out! shift. (c) Basis-changing gate. (d) Momentu dkfor large x + y we have [25, Eq. 3.2] line j!.4 Then (e) Momentum separator. IG. 1: Widgets used to construct a universal quantum comwith two single-qubit gates that generate a dense s! length of the path through G from line j FIG. 1: Widgets used to construct universal quantum com Tj,j! (ka )! iht
89 The curse of symmetry Problem: Our filter passes k = 3¼/4 in addition to k = ¼/4. Generically, distinct momenta propagate at different speeds; but v( π/4) = 2 sin(π/4) = 2 v( 3π/4) = 2 sin(3π/4) = 00!in2! 00out (b) 00in 00 (a) (a) (b) out! ny stationary and the of the firstisterm is points, andpoints, the phase of phase the first term 01!in! 01in! (k) 2t cos k, which is staven by k(x + y) + arg T j,j y) + arg Tj,j! (k) 2t cos k, which is sta 10!in! 10in onary In for fact, all widgets so far have a symmetry3 under 11! x + y +!j,j! (k) = v(k)t,! (k) x + y +(a)!j,j 00 00out! (b) in! = v(k)t, 00in! 00out! (a) 01 (b)! 01! here out in 01! 01out! 10inin! 10out! in! 10in! d 10out! in! 11in:=! 11 2 cos kout =! 2 sin k v(k) 11in! dk 11out! (8) (8) out! out! (9) 3 (c) 0in! (c) 0in! d 2 cos k = 2 sin k (9) (k) := the 0 group atout momentum andall bipartite.! dkvelocity 0! (c) (d) k, (e) in This is because they are (c) 0in! 0out! (d) d and ocity k, 1inat! momentum 1! out!! (k) := arg T 1in! j,j 1out dk! j,j! (k) 1in! 1in! 11ink!in 01out! out! 01 10out!! in! 10 in! out 11 out! k. π 11out! 0out! 0out! (d) (e) (d) (e) 1out! 1out! out! out! in! in! out! in! in! out! FIG. 1: Widgets used to construct a universal quantum (e) puter. Open circles indicate vertices where previous o FIG. cessive 1: Widgets toattached. construct universal quant widgetsused can be (a)acontrolled-note gat in! (10) out! Phase shift. (c) Basis-changing gate. where (d) Momentum puter. Open circles indicate vertices previou in! out! (e)widgets Momentum cessive canseparator. be attached. (a) Controlled-note d in! through out! the path G from j!j,j!effective (k) := length argoftthe (10) line Phase j,j! (k) in! out! shift. (c) Basis-changing gate. (d) Momentu dkfor large x + y we have [25, Eq. 3.2] line j!.4 Then (e) Momentum separator. IG. 1: Widgets used to construct a universal quantum comwith two single-qubit gates that generate a dense s! length of the path through G from line j FIG. 1: Widgets used to construct universal quantum com Tj,j! (ka )! iht
90 Momentum separator (e) in out
91 Momentum separator T in,out (k) = [ 1+ ] 1 i(cos k + cos 3k) sin k + 2 sin 2k + sin 3k sin 5k (e) 1 in out π 3π 4 π 2 π k
92 Momentum separator T in,out (k) = [ 1+ ] 1 i(cos k + cos 3k) sin k + 2 sin 2k + sin 3k sin 5k l in,out ( π/4) = 4(3 2 2) l in,out ( 3π/4) = 4( ) 23.3 (e) 1 in out π 3π 4 π 2 π k
93 A universal computer Consider an m-gate quantum circuit (unitary transformation U).
94 A universal computer Consider an m-gate quantum circuit (unitary transformation U). Graph: log Θ(m 2 ) filter widgets on input line Momentum separation widget on input line Widgets for m gates in the circuit Truncate input wires to length Θ(m 4 )
95 A universal computer Consider an m-gate quantum circuit (unitary transformation U). Graph: log Θ(m 2 ) filter widgets on input line Momentum separation widget on input line Widgets for m gates in the circuit Truncate input wires to length Θ(m 4 ) Simulation: Start at vertex x = Θ(m 4 ) on input line t = π (x + l)/ 2π = O(m 4 ) Evolve for time Measure in the vertex basis Conditioned on reaching vertex 0 on some output line s (which happens with probability Ω(1/m 4 )), the distribution over s is approximately s U
96 Applications? Quantum algorithms Quantum complexity theory Architectures for quantum computers
Quantum walk algorithms
Quantum walk algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 28 September 2011 Randomized algorithms Randomness is an important tool in computer science Black-box problems
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk
Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk We now turn to a second major topic in quantum algorithms, the concept
More information!"#$%"&'(#)*+',$'-,+./0%0'#$1' 23$4$"3"+'5,&0'
!"#$%"&'(#)*+',$'-,+./0%0'#$1' 23$4$"3"+'5,&0' 6/010/,.*'(7'8%/#".9' -0:#/%&0$%'3;'0' Valencia 2011! Outline! Quantum Walks! DTQW & CTQW! Quantum Algorithms! Searching, Mixing,
More informationA Glimpse of Quantum Computation
A Glimpse of Quantum Computation Zhengfeng Ji (UTS:QSI) QCSS 2018, UTS 1. 1 Introduction What is quantum computation? Where does the power come from? Superposition Incompatible states can coexist Transformation
More informationFaster quantum algorithm for evaluating game trees
Faster quantum algorithm for evaluating game trees x 7 x 8 Ben Reichardt xx1 1 x 2 x 3 x 4 x 6 OR x 9 x1 1 x 5 x 9 University of Waterloo x 5 AND OR AND AND OR AND ϕ(x) x 7 x 8 x 1 x 2 x 3 x 4 x 6 OR x
More informationDiscrete quantum random walks
Quantum Information and Computation: Report Edin Husić edin.husic@ens-lyon.fr Discrete quantum random walks Abstract In this report, we present the ideas behind the notion of quantum random walks. We further
More informationQuantum algorithms based on span programs
Quantum algorithms based on span programs Ben Reichardt IQC, U Waterloo [arxiv:0904.2759] Model: Complexity measure: Quantum algorithms Black-box query complexity Span programs Witness size [KW 93] [RŠ
More informationExponential algorithmic speedup by quantum walk
Exponential algorithmic speedup by quantum walk Andrew Childs MIT Center for Theoretical Physics joint work with Richard Cleve Enrico Deotto Eddie Farhi Sam Gutmann Dan Spielman quant-ph/0209131 Motivation
More informationThe quantum query complexity of read-many formulas
The quantum query complexity of read-many formulas Andrew Childs Waterloo Shelby Kimmel MIT Robin Kothari Waterloo Boolean formulas ^ x 1 x 2 _ x 3 ^ x 1 x 3 A formula is read-once if every input appears
More informationarxiv: v2 [quant-ph] 6 Feb 2018
Quantum Inf Process manuscript No. (will be inserted by the editor) Faster Search by Lackadaisical Quantum Walk Thomas G. Wong Received: date / Accepted: date arxiv:706.06939v2 [quant-ph] 6 Feb 208 Abstract
More informationQuantum algorithms. Andrew Childs. Institute for Quantum Computing University of Waterloo
Quantum algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 11th Canadian Summer School on Quantum Information 8 9 June 2011 Based in part on slides prepared with Pawel Wocjan
More informationarxiv:cond-mat/ v1 20 Sep 2004
One-dimensional continuous-time quantum walks DANIEL BEN-AVRAHAM ERIK M. BOLLT CHRISTINO TAMON September, 4 arxiv:cond-mat/4954 v Sep 4 Abstract We survey the equations of continuous-time quantum walks
More informationarxiv: v1 [quant-ph] 17 Jun 2009
Quantum search algorithms on the hypercube Birgit Hein and Gregor Tanner School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7 2RD, UK e-mail: gregor.tanner@nottingham.ac.uk
More informationGeneric quantum walk using a coin-embedded shift operator
PHYSICAL REVIEW A 78, 052309 2008 Generic quantum walk using a coin-embedded shift operator C. M. Chandrashekar Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
More informationAlgorithmic challenges in quantum simulation. Andrew Childs University of Maryland
Algorithmic challenges in quantum simulation Andrew Childs University of Maryland nature isn t classical, dammit, and if you want to make a simulation of nature, you d better make it quantum mechanical,
More informationQuantum speedup of backtracking and Monte Carlo algorithms
Quantum speedup of backtracking and Monte Carlo algorithms Ashley Montanaro School of Mathematics, University of Bristol 19 February 2016 arxiv:1504.06987 and arxiv:1509.02374 Proc. R. Soc. A 2015 471
More informationA quantum walk based search algorithm, and its optical realisation
A quantum walk based search algorithm, and its optical realisation Aurél Gábris FJFI, Czech Technical University in Prague with Tamás Kiss and Igor Jex Prague, Budapest Student Colloquium and School on
More informationarxiv:quant-ph/ v2 26 Apr 2007
Every NAND formula of size N can be evaluated in time O(N 1 2 +ε ) on a quantum computer arxiv:quant-ph/0703015v2 26 Apr 2007 Andrew M. Childs amchilds@caltech.edu Robert Špalek spalek@eecs.berkeley.edu
More informationAlgorithmic challenges in quantum simulation. Andrew Childs University of Maryland
Algorithmic challenges in quantum simulation Andrew Childs University of Maryland nature isn t classical, dammit, and if you want to make a simulation of nature, you d better make it quantum mechanical,
More informationHamiltonian simulation with nearly optimal dependence on all parameters
Hamiltonian simulation with nearly optimal dependence on all parameters Andrew Childs CS, UMIACS, & QuICS University of Maryland Joint work with Dominic Berry (Macquarie) and Robin Kothari (MIT), building
More informationHamiltonian simulation and solving linear systems
Hamiltonian simulation and solving linear systems Robin Kothari Center for Theoretical Physics MIT Quantum Optimization Workshop Fields Institute October 28, 2014 Ask not what you can do for quantum computing
More informationarxiv: v3 [quant-ph] 29 Oct 2009
Efficient quantum circuit implementation of quantum walks B L Douglas and J B Wang School of Physics, The University of Western Australia, 6009, Perth, Australia arxiv:07060304v3 [quant-ph] 29 Oct 2009
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationarxiv:quant-ph/ v1 15 Apr 2005
Quantum walks on directed graphs Ashley Montanaro arxiv:quant-ph/0504116v1 15 Apr 2005 February 1, 2008 Abstract We consider the definition of quantum walks on directed graphs. Call a directed graph reversible
More informationOverview of adiabatic quantum computation. Andrew Childs
Overview of adiabatic quantum computation Andrew Childs Adiabatic optimization Quantum adiabatic optimization is a class of procedures for solving optimization problems using a quantum computer. Basic
More informationDecoherence on Szegedy s Quantum Walk
Decoherence on Szegedy s Quantum Walk Raqueline A. M. Santos, Renato Portugal. Laboratório Nacional de Computação Científica (LNCC) Av. Getúlio Vargas 333, 25651-075, Petrópolis, RJ, Brazil E-mail: raqueline@lncc.br,
More informationHamiltonian simulation with nearly optimal dependence on all parameters
Hamiltonian simulation with nearly optimal dependence on all parameters Dominic Berry + Andrew Childs obin Kothari ichard Cleve olando Somma Quantum simulation by quantum walks Dominic Berry + Andrew Childs
More informationThe Quantum Query Complexity of Algebraic Properties
The Quantum Query Complexity of Algebraic Properties Sebastian Dörn Institut für Theoretische Informatik Universität Ulm 89069 Ulm, Germany Thomas Thierauf Fak. Elektronik und Informatik HTW Aalen 73430
More informationLecture-05 Perturbation Theory and Feynman Diagrams
Lecture-5 Perturbation Theory and Feynman Diagrams U. Robkob, Physics-MUSC SCPY639/428 September 3, 218 From the previous lecture We end up at an expression of the 2-to-2 particle scattering S-matrix S
More informationQuantum Algorithms for Graph Traversals and Related Problems
Quantum Algorithms for Graph Traversals and Related Problems Sebastian Dörn Institut für Theoretische Informatik, Universität Ulm, 89069 Ulm, Germany sebastian.doern@uni-ulm.de Abstract. We study the complexity
More informationQuantum Search on Strongly Regular Graphs
Quantum Search on Strongly Regular Graphs Degree Project in Engineering Physics, Second Level by Jonatan Janmark at Department of Theoretical Physics Royal Institute of Technology (KTH) & Department of
More informationQuantum algorithms based on quantum walks. Jérémie Roland (ULB - QuIC) Quantum walks Grenoble, Novembre / 39
Quantum algorithms based on quantum walks Jérémie Roland Université Libre de Bruxelles Quantum Information & Communication Jérémie Roland (ULB - QuIC) Quantum walks Grenoble, Novembre 2012 1 / 39 Outline
More informationTime-Efficient Quantum Walks for 3-Distinctness
Time-Efficient Quantum Walks for 3-Distinctness Aleksandrs Belovs 1, Andrew M. Childs 2,4, Stacey Jeffery 3,4, Robin Kothari 3,4, and Frédéric Magniez 5 1 Faculty of Computing, University of Latvia 2 Department
More informationChapter 1 Recollections from Elementary Quantum Physics
Chapter 1 Recollections from Elementary Quantum Physics Abstract We recall the prerequisites that we assume the reader to be familiar with, namely the Schrödinger equation in its time dependent and time
More informationA Review of Quantum Random Walks and their Algorithmic Applications
A Review of Quantum Random Walks and their Algorithmic Applications Enis K. Inan 1 and Mohamed Abidalrekab 2 1 Portland State University einan@pdx.edu 2 Portland State University moh29@pdx.edu June 17,
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT
Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students
More informationLong-time Entanglement in the Quantum Walk
WECIQ 6 - Artigos Long-time Entanglement in the Quantum Walk Gonzalo Abal 1, Raul Donangelo, Hugo Fort 3 1 Instituto de Física, Facultad de Ingeniería, Universidad de la República, C.C. 3, C.P. 11, Montevideo,
More informationarxiv: v1 [quant-ph] 15 Nov 2018
Lackadaisical quantum walk for spatial search Pulak Ranjan Giri International Institute of Physics, Universidade Federal do Rio Grande do orte, Campus Universitario, Lagoa ova, atal-r 59078-970, Brazil
More informationQuantum Complexity of Testing Group Commutativity
Quantum Complexity of Testing Group Commutativity Frédéric Magniez 1 and Ashwin Nayak 2 1 CNRS LRI, UMR 8623 Université Paris Sud, France 2 University of Waterloo and Perimeter Institute for Theoretical
More informationQuantum walks: Definition and applications
Quantum walks: Definition and applications 尚云 2017 年 5 月 5 日 ( 量子计算与密码分析讨论班 ) Talk structure Introduction to quantum walks Defining a quantum walk...on the line...on the graphs Applications of quantum
More informationHein, Birgit (2010) Quantum search algorithms. PhD thesis, University of Nottingham.
Hein, Birgit (00) Quantum search algorithms. PhD thesis, University of Nottingham. Access from the University of Nottingham repository: http://eprints.nottingham.ac.uk/5//phd_thesis_birgit_hein.pdf Copyright
More informationA better lower bound for quantum algorithms searching an ordered list
A better lower bound for quantum algorithms searching an ordered list Andris Ambainis Computer Science Division University of California Berkeley, CA 94720, e-mail: ambainis@cs.berkeley.edu Abstract We
More informationFrom Adversaries to Algorithms. Troy Lee Rutgers University
From Adversaries to Algorithms Troy Lee Rutgers University Quantum Query Complexity As in classical complexity, it is difficult to show lower bounds on the time or number of gates required to solve a problem
More informationarxiv: v3 [quant-ph] 30 Mar 2012
Spectral Gap Amplification R. D. Somma 1 and S. Boixo 2 1 Los Alamos National Laboratory, Los Alamos, NM 87545, USA 2 Information Sciences Institute, USC, Marina del Rey, CA 90292, USA. Harvard University,
More informationUniversal computation by multi-particle quantum walk
Universal computation by multi-particle quantum walk Andrew Childs David Gosset Zak Webb arxiv:1205.3782 Science 339, 791-794 (2013) Quantum walk Quantum analog of a random walk on a graph. Idea: Replace
More informationQuantum Algorithms for Finding Constant-sized Sub-hypergraphs
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs Seiichiro Tani (Joint work with François Le Gall and Harumichi Nishimura) NTT Communication Science Labs., NTT Corporation, Japan. The 20th
More informationarxiv: v1 [quant-ph] 6 Feb 2013
Exact quantum query complexity of EXACT and THRESHOLD arxiv:302.235v [quant-ph] 6 Feb 203 Andris Ambainis Jānis Iraids Juris Smotrovs University of Latvia, Raiņa bulvāris 9, Riga, LV-586, Latvia February
More informationAccelerating QMC on quantum computers. Matthias Troyer
Accelerating QMC on quantum computers Matthias Troyer International Journal of Theoretical Physics, VoL 21, Nos. 6/7, 1982 Simulating Physics with Computers Richard P. Feynman Department of Physics, California
More informationNon-unitary quantum walks:
Non-unitary quantum walks: exploring the space between classical and quantum computing Viv Kendon Review article on decoherence in quantum walks quant-ph/0606016 Quantum Information School of Physics &
More informationThe Principles of Quantum Mechanics: Pt. 1
The Principles of Quantum Mechanics: Pt. 1 PHYS 476Q - Southern Illinois University February 15, 2018 PHYS 476Q - Southern Illinois University The Principles of Quantum Mechanics: Pt. 1 February 15, 2018
More informationIntroduction to Adiabatic Quantum Computation
Introduction to Adiabatic Quantum Computation Vicky Choi Department of Computer Science Virginia Tech April 6, 2 Outline Motivation: Maximum Independent Set(MIS) Problem vs Ising Problem 2 Basics: Quantum
More informationarxiv: v4 [quant-ph] 25 Sep 2017
Grover Search with Lackadaisical Quantum Walks Thomas G Wong Faculty of Computing, University of Latvia, Raiņa ulv. 9, Rīga, LV-586, Latvia E-mail: twong@lu.lv arxiv:50.04567v4 [quant-ph] 5 Sep 07. Introduction
More informationSearch via Quantum Walk
Search via Quantum Walk Frédéric Magniez Ashwin Nayak Jérémie Roland Miklos Santha Abstract We propose a new method for designing quantum search algorithms for finding a marked element in the state space
More informationSample Problems on Quantum Dynamics for PHYS301
MACQUARIE UNIVERSITY Department of Physics Division of ICS Sample Problems on Quantum Dynamics for PHYS30 The negative oxygen molecule ion O consists of a pair of oxygen atoms separated by a distance a
More informationRecurrences in Quantum Walks
Recurrences in Quantum Walks M. Štefaňák (1), I. Jex (1), T. Kiss (2) (1) Department of Physics, FJFI ČVUT in Prague, Czech Republic (2) Department of Nonlinear and Quantum Optics, RISSPO, Hungarian Academy
More informationarxiv: v1 [quant-ph] 10 Sep 2012
Quantum Walks on Sierpinski Gaskets arxiv:1209.2095v1 [quant-ph] 10 Sep 2012 Pedro Carlos S. Lara, Renato Portugal, and Stefan Boettcher May 2, 2014 Abstract We analyze discrete-time quantum walks on Sierpinski
More informationarxiv:quant-ph/ v3 26 Nov 2006
Under consideration for publication in Math. Struct. in Comp. Science Decoherence in quantum walks - a review arxiv:quant-ph/0606016v3 26 Nov 2006 VIV KENDON School of Physics and Astronomy, University
More informationWhich Quantum Walk on Graphs?
Which Quantum Walk on Graphs? Christino Tamon Department of Computer Science Clarkson University August 13, 2015 Outline I Walks on graphs (random and quantum) I State transfer on graphs (motivation) I
More informationTensor network simulations of strongly correlated quantum systems
CENTRE FOR QUANTUM TECHNOLOGIES NATIONAL UNIVERSITY OF SINGAPORE AND CLARENDON LABORATORY UNIVERSITY OF OXFORD Tensor network simulations of strongly correlated quantum systems Stephen Clark LXXT[[[GSQPEFS\EGYOEGXMZMXMIWUYERXYQGSYVWI
More informationImproved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments François Le Gall The University of Tokyo Technical version available at arxiv:1407.0085 [quant-ph]. Background. Triangle finding
More informationImplementing the quantum random walk
PHYSICAL REVIEW A, VOLUME 5, Implementing the quantum random walk B. C. Travaglione* and G. J. Milburn Centre for Quantum Computer Technology, University of Queensland, St. Lucia, Queensland, Australia
More informationPage 684. Lecture 40: Coordinate Transformations: Time Transformations Date Revised: 2009/02/02 Date Given: 2009/02/02
Page 684 Lecture 40: Coordinate Transformations: Time Transformations Date Revised: 2009/02/02 Date Given: 2009/02/02 Time Transformations Section 12.5 Symmetries: Time Transformations Page 685 Time Translation
More informationarxiv: v2 [quant-ph] 4 Dec 2018
Quantum walks on hypergraphs arxiv:1809.04521v2 [quant-ph] 4 Dec 2018 Przemys law Sadowski 1, Lukasz Pawela 1, Paulina Lewandowska 1,2, and Ryszard Kukulski 1,2 1 Institute of Theoretical and Applied Informatics,
More informationContinuous Time Quantum Walk on finite dimensions. Shanshan Li Joint work with Stefan Boettcher Emory University QMath13, 10/11/2016
Continuous Time Quantum Walk on finite dimensions Shanshan Li Joint work with Stefan Boettcher Emory University QMath3, 0//206 Grover Algorithm: Unstructured Search! #$%&' Oracle $()*%$ f(x) f (x) = (
More informationQuantum algorithms for hidden nonlinear structures
Quantum algorithms for hidden nonlinear structures Andrew Childs Waterloo Leonard Schulman Caltech Umesh Vazirani Berkeley Shor s algorithm finds hidden linear structures [Shor 94]: Efficient quantum algorithms
More informationOptimizing the discrete time quantum walk using a SU(2) coin
PHYSICAL REVIEW A 77, 336 8 Optimizing the discrete time quantum walk using a SU() coin C. M. Chandrashekar, 1 R. Srikanth,,3 and Raymond Laflamme 1,4 1 Institute for Quantum Computing, University of Waterloo,
More informationAn Analog Analogue of a Digital Quantum Computation
An Analog Analogue of a Digital Quantum Computation arxiv:quant-ph/9612026v1 6 Dec 1996 Edard Farhi Center for Theoretical Physics Massachusetts Institute of Technology Cambridge, MA 02139 Sam Gutmann
More informationarxiv: v1 [quant-ph] 11 Oct 2017
Playing a true Parrondo s game with a three state coin on a quantum walk Jishnu Rajendran and Colin Benjamin School of Physical Sciences, National Institute of Science Education & Research, HBNI, Jatni-752050,
More informationUnitary Dynamics and Quantum Circuits
qitd323 Unitary Dynamics and Quantum Circuits Robert B. Griffiths Version of 20 January 2014 Contents 1 Unitary Dynamics 1 1.1 Time development operator T.................................... 1 1.2 Particular
More informationPhysics 486 Discussion 5 Piecewise Potentials
Physics 486 Discussion 5 Piecewise Potentials Problem 1 : Infinite Potential Well Checkpoints 1 Consider the infinite well potential V(x) = 0 for 0 < x < 1 elsewhere. (a) First, think classically. Potential
More informationSpatial correlations in quantum walks with two particles
Spatial correlations in quantum walks with two particles M. Štefaňák (1), S. M. Barnett 2, I. Jex (1) and T. Kiss (3) (1) Department of Physics, Faculty of Nuclear Sciences and Physical Engineering, Czech
More informationPHYS851 Quantum Mechanics I, Fall 2009 HOMEWORK ASSIGNMENT 10: Solutions
PHYS851 Quantum Mechanics I, Fall 009 HOMEWORK ASSIGNMENT 10: Solutions Topics Covered: Tensor product spaces, change of coordinate system, general theory of angular momentum Some Key Concepts: Angular
More informationThe computational power of many-body systems
The computational power of many-body systems by Zak Webb A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy in Physics and
More informationarxiv: v1 [quant-ph] 14 Nov 2014
MIT-CTP/4610 A Quantum Approximate Optimization Algorithm Edward Farhi and Jeffrey Goldstone Center for Theoretical Physics Massachusetts Institute of Technology Cambridge, MA 02139 arxiv:1411.4028v1 [quant-ph]
More informationRecurrences and Full-revivals in Quantum Walks
Recurrences and Full-revivals in Quantum Walks M. Štefaňák (1), I. Jex (1), T. Kiss (2) (1) Department of Physics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague,
More informationarxiv: v2 [quant-ph] 4 Jul 2018
The Feynman-Kitaev computer s clock: bias, gaps, idling and pulse tuning Libor Caha 1, Zeph Landau 2, and Daniel agaj 3 1,3 Research Center for Quantum Information, Institute of Physics, Slovak Academy
More informationToward the first quantum simulation with quantum speedup
Toward the first quantum simulation with quantum speedup Andrew Childs University of Maryland Dmitri Maslov Yunseong Nam Neil Julien Ross arxiv:1711.10980 Yuan Su Simulating Hamiltonian dynamics on a quantum
More informationOptimal Hamiltonian Simulation by Quantum Signal Processing
Optimal Hamiltonian Simulation by Quantum Signal Processing Guang-Hao Low, Isaac L. Chuang Massachusetts Institute of Technology QIP 2017 January 19 1 Physics Computation Physical concepts inspire problem-solving
More informationWeek 5-6: Lectures The Charged Scalar Field
Notes for Phys. 610, 2011. These summaries are meant to be informal, and are subject to revision, elaboration and correction. They will be based on material covered in class, but may differ from it by
More informationTwo-Dimensional Quantum Walks with Boundaries
WECIQ 26 - Artigos Two-Dimensional Quantum Walks with Boundaries Amanda C. Oliveira 1, Renato ortugal 1, Raul Donangelo 2 1 Laboratório Nacional de Computação Científica, LNCC Caixa ostal 95113 25651-75
More informationC/CS/Phys C191 Quantum Mechanics in a Nutshell 10/06/07 Fall 2009 Lecture 12
C/CS/Phys C191 Quantum Mechanics in a Nutshell 10/06/07 Fall 2009 Lecture 12 In this lecture we summarize the essential physical and mathematical aspects of quantum mechanics relevant to this course. Topics
More informationQuantize electrical circuits
Quantize electrical circuits a lecture in Quantum Informatics the 4th and 7th of September 017 Thilo Bauch and Göran Johansson In this lecture we will discuss how to derive the quantum mechanical hamiltonian
More informationarxiv: v1 [quant-ph] 11 Nov 2018
Hitting time for quantum walks of identical particles Alexey A. Melnikov a,b, Aleksandr P. Alodjants b, and Leonid E. Fedichkin a,c,d arxiv:1814482v1 [quant-ph] 11 Nov 2018 a Institute of Physics and Technology,
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
More informationQuantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar
Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical
More informationThe Quantum Query Complexity of the Determinant
The Quantum Query Complexity of the Determinant Sebastian Dörn Inst. für Theoretische Informatik Universität Ulm 89069 Ulm, Germany Thomas Thierauf Fak. Elektronik und Informatik HTW Aalen 73430 Aalen,
More informationOptimal Controlled Phasegates for Trapped Neutral Atoms at the Quantum Speed Limit
with Ultracold Trapped Atoms at the Quantum Speed Limit Michael Goerz May 31, 2011 with Ultracold Trapped Atoms Prologue: with Ultracold Trapped Atoms Classical Computing: 4-Bit Full Adder Inside the CPU:
More informationQuantum computing and quantum information KAIS GROUP
Quantum computing and quantum information KAIS GROUP Main themes Quantum algorithms. In particular for quantum chemistry arxiv:1004.2242 [cs.ne] arxiv:1009.5625 [quant-ph] arxiv:1307.7220 [quant-ph] arxiv:1302.1946
More informationPrinciples of Quantum Mechanics Pt. 2
Principles of Quantum Mechanics Pt. 2 PHYS 500 - Southern Illinois University February 9, 2017 PHYS 500 - Southern Illinois University Principles of Quantum Mechanics Pt. 2 February 9, 2017 1 / 13 The
More informationQuantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002
Quantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002 1 QMA - the quantum analog to MA (and NP). Definition 1 QMA. The complexity class QMA is the class of all languages
More informationAdiabatic Quantum Computation An alternative approach to a quantum computer
An alternative approach to a quantum computer ETH Zürich May 2. 2014 Table of Contents 1 Introduction 2 3 4 Literature: Introduction E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, D. Preda
More information1 Infinite-Dimensional Vector Spaces
Theoretical Physics Notes 4: Linear Operators In this installment of the notes, we move from linear operators in a finitedimensional vector space (which can be represented as matrices) to linear operators
More informationHigh-precision quantum algorithms. Andrew Childs
High-precision quantum algorithms Andrew hilds What can we do with a quantum computer? Factoring Many problems with polynomial speedup (combinatorial search, collision finding, graph properties, oolean
More informationThe quantum speed limit
The quantum speed limit Vittorio Giovannetti a,sethlloyd a,b, and Lorenzo Maccone a a Research Laboratory of Electronics b Department of Mechanical Engineering Massachusetts Institute of Technology 77
More informationQuantum Computing. 6. Quantum Computer Architecture 7. Quantum Computers and Complexity
Quantum Computing 1. Quantum States and Quantum Gates 2. Multiple Qubits and Entangled States 3. Quantum Gate Arrays 4. Quantum Parallelism 5. Examples of Quantum Algorithms 1. Grover s Unstructured Search
More informationarxiv:quant-ph/ v1 8 Mar 2004
arxiv:quant-ph/4366v1 8 Mar 24 Quantum walks on graphs and quantum scattering theory Edgar Feldman and Mark Hillery Abstract. A number of classical algorithms are based on random walks on graphs. It is
More informationBy allowing randomization in the verification process, we obtain a class known as MA.
Lecture 2 Tel Aviv University, Spring 2006 Quantum Computation Witness-preserving Amplification of QMA Lecturer: Oded Regev Scribe: N. Aharon In the previous class, we have defined the class QMA, which
More information1 Mathematical preliminaries
1 Mathematical preliminaries The mathematical language of quantum mechanics is that of vector spaces and linear algebra. In this preliminary section, we will collect the various definitions and mathematical
More informationLinear Algebra and Dirac Notation, Pt. 3
Linear Algebra and Dirac Notation, Pt. 3 PHYS 500 - Southern Illinois University February 1, 2017 PHYS 500 - Southern Illinois University Linear Algebra and Dirac Notation, Pt. 3 February 1, 2017 1 / 16
More informationarxiv: v2 [quant-ph] 7 Jan 2010
Algorithms for Quantum Computers Jamie Smith and Michele Mosca arxiv:1001.0767v2 [quant-ph] 7 Jan 2010 1 Introduction Quantum computing is a new computational paradigm created by reformulating information
More information