Scribd
Upload
114 views41 pages

Quantum Algorithms For Moving-Target TSP

Uploaded by

Dr Rushen Singh
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
114 views41 pages

Quantum Algorithms For Moving-Target TSP

Uploaded by

Dr Rushen Singh
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 41

Quantum Algorithms for Moving-Target TSP

Prof. Rushen Chahal

Prof. Rushen Chahal

Two Slit Experiment


Bullets

Prof. Rushen Chahal

Two Slit Experiment


Sound Waves

Prof. Rushen Chahal

Two Slit Experiment


Electrons

Prof. Rushen Chahal

Two Slit Experiment


Observing Electrons

Prof. Rushen Chahal

Basic Quantum Computation


Qubit - can be 1, 0 or both 1 and 0 |x> - number in Quantum Computer Superposition of states:
2 N 1

2 N 1
i

a
i !0

si

Where:

a
i !0

!1

Prof. Rushen Chahal

Examples
1 1 1 0  2 2

1 1 1 1 00  01  10  11 2 2 2 2
Prof. Rushen Chahal

Representation
n qubits: 2nx1 matrix represents the state:
|0> would be represented by |1> would be represented by Equal superposition would be
1 0 0 1 1 2 1 2

Prof. Rushen Chahal

Changing States
Unitary transformations change states Unitary matrix:
conjugate transpose = inverse

A !A

1

Prof. Rushen Chahal

Example
Hadamard Transform
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2

1 0 ! 0 1
1 2 1 2

1 2 1 2

1 2 1 2

1 0 !
Prof. Rushen Chahal

Example: CNot Gate


Not Gate:

0 1 a 1 0 b

b a
a b d c
00 01 10 11

1 CNot Gate: 0 0 0

0 0 0 a b 1 0 0 0 0 1 c 0 1 0 d
Prof. Rushen Chahal

Visual Representation
H

00

1 1 00  10 2 2

1 1 00  11 2 2

p
Prof. Rushen Chahal

1 1 10  01 2 2

Grovers Search Algorithm


Search a phone book for a specific number without rearranging the numbers. Idea: magnify amplitude of the choosen number: Flip the amplitude of the selected item and rotate all amplitudes around the average Repeat this until the selected items probability of being read is greater than 1/2
Prof. Rushen Chahal

Graphical Representation

Original Amplitudes

Negate Amplitude

Average of all Amplitudes

Flip all Amplitudes around Avg


Prof. Rushen Chahal

Time Complexity
Normal search requires N/2 steps Grovers Algorithm takes O N steps

Prof. Rushen Chahal

Traveling Salesperson Problem


a
6 4 12 2 8 11 5 3

10
Prof. Rushen Chahal

Moving-Target TSP

Origin

Prof. Rushen Chahal

Moving-Target TSP
2 3 Origin 1

Prof. Rushen Chahal

Moving Target TSP is Intractable


NP-Hard
Classical TSP is NP-Complete Classical TSP reduces to Moving-Target TSP
a
6
(V=0) (V=0)

4 12 2 11 5 3

(V=0)

(V=0)

10

(V=0)

Prof. Rushen Chahal

NP-Complete
Contained in NP:
1. Decision version:  path with time < T?
Non-deterministically travel all paths. If one exists with time < T, return TRUE. Else, return FALSE

2. Optimization version: what is min-time path?


Upper-bound T with initial random path. Then, binary search the range by testing T/2, T/4, etc. to find optimal the minimum- time path
Prof. Rushen Chahal

Quantum Computing Solution


Step 1 - Traverse every possible path Step 2 - Search through paths superposition to find a shortest path

Prof. Rushen Chahal

Superposition for Hamiltonian Paths


T. Rudolph
superposition of cubic bipartite graph in linear time

Cubic - all nodes have degree 3 Bipartite


nodes are partitioned into two groups each node is only adjacent to nodes in other group
Prof. Rushen Chahal

Example
1
1000 1000 0000 0000 0000

1000 1
1100 1 2  1010 1 3

0100 1 2 1  1101 1 2 4  0010 1 3 1  1011 1 3 4


0000 1 2 1 2  0110 1 2 1 3  1001 1 2 4 2  1111 1 2 4 3  0110 1 3 1 2  0000 1 3 1 3  1111 1 3 4 2  1001 1 3 4 3

Prof. Rushen Chahal

Potential Problems
Problem 1:
Extract the Hamiltonian paths

Problem 2:
Find cycles, not paths

Problem 3:
Only works for cubic graphs

Prof. Rushen Chahal

Solution to Problem 1
How to extract only paths containing all 1s in first register? Solution: Use Grovers Algorithm!

Prof. Rushen Chahal

Solution to Problem 2
Use black box for Hamiltonian paths to solve for Hamiltonian cycles? Solution:

Prof. Rushen Chahal

Solution to Problem 3
Problem 3: non-cubic graphs Solution:
Make all nodes have the same degree Degree must be a power of 2 Algorithm when all nodes have degree 2i

Prof. Rushen Chahal

Step 1
Give all nodes same degree of 2x
Graph G has n nodes Find node with largest degree D Find x where
2
Groups of x nodes n+x-n(mod x)
x 1

eDe2

Prof. Rushen Chahal

Step 1 (continued)
Go through the graph G node by node, and go through the new nodes set by set:

Prof. Rushen Chahal

Algorithm
Quantum transition for nodes with 2x degree:
Control bit
H H

1 0000 1 1 1 0000 1 1 1000 0010  0100  1000   1101 4 4 4 2 4 2 1 1 1 1    1 4 0000 1 4 0100 1 4 1000 1 4 1100 0010  0100  1000  1001 4 4 4 4 1 1 1 1 0010  0100  1000  1100 1 4 1 4 1 4 1 4 0010  0100  1000  0001 4 1 4 1 4 1 4 1 0010  Prof. Rushen Chahal 0100  1000  1101 4 4 4 4

Observations
Algorithm works for all graphs May double # of nodes Takes O(n) steps Search first register for all 1s Added nodes do not affect solution

Prof. Rushen Chahal

Extension to TSP
Need another register:
Large enough to hold longest path

At each step, add edge weight into register

Prof. Rushen Chahal

Iteration
All paths of length n & their weights Run algorithm for Hamiltonian cycles
Look for all 1s in the first register

Superposition of all Hamiltonian cycles Grovers algorithm on sum register finds min

Prof. Rushen Chahal

Extension to Moving-Target TSP


Moving Target TSP
Each node has a velocity Find the minimum-weight round trip
v2x v2y v1x v1y

Prof. Rushen Chahal

Moving-Target TSP Solution


Add a time register Track the total time elapsed so far Each step: calculate time to reach next node
v1x t  nx ! v xt  a x v1y t  n y ! v y t  a y vx  v y ! MaxV 2
MaxV
2 2

v1y

Unknowns : vx vy t

a , a
x y
Prof. Rushen Chahal

v1x

n , n
x y

Determining the Optimal Path


Add time to reach next node to total sum Find the minimum, similar to TSP Added time complexity is linear

Prof. Rushen Chahal

Summary
Extended Hamiltonian path algorithm for cubic bipartite graphs [Rudolphs] For TSP and Moving-Target TSP, paths superposition can be obtained in linear time Grovers search algorithm works in time SQRT of # of objects in superposition 2n different paths: total time is O(2n/2 )
Prof. Rushen Chahal

Future Work
Faster algorithm for (Moving-Target) TSP Improve Grovers search algorithm P=NP for quantum computation?

Prof. Rushen Chahal

j A j+1

i a b c a b c

Circuit
V

a,b,c are the nodes adjacent to I A is the register keeping track of which nodes have been traversed
Prof. Rushen Chahal

Finding the Minimum


Measure the lengths register (M) Create superposition again Now search for all paths < M On average, do this log(k) times
k is the number of items in the superposition

Prof. Rushen Chahal

Bullets

Sound Waves

Electrons

Observed Electrons

Prof. Rushen Chahal

You might also like