Research Project Title

Presenter Information

Faculty Sponsor

Frank Lynch, Eastern Washington University

Research Project Abstract

Quantum walks are a powerful tool for developing efficient algorithms in quantum computing. This research explores two discrete-time one-dimensional quantum walks where the coin operator varies along even and odd positions on the line. We find closed-form expressions for the coefficients of the wave function for both walks and also arrive at a formula for the probability distribution for one of the walks. A significant discovery is a way to model the well-known Hadamard walk using two alternating coins.

Session Number

SS1C

Location

Robinson 310

Abstract Number

SS1C-j

This document is currently not available here.

DOWNLOADS

Since April 01, 2016

COinS

Apr 23rd, 1:30 PMApr 23rd, 3:00 PM

Alternating Quantum Walks

Robinson 310

Quantum walks are a powerful tool for developing efficient algorithms in quantum computing. This research explores two discrete-time one-dimensional quantum walks where the coin operator varies along even and odd positions on the line. We find closed-form expressions for the coefficients of the wave function for both walks and also arrive at a formula for the probability distribution for one of the walks. A significant discovery is a way to model the well-known Hadamard walk using two alternating coins.