CS674 Assignments
NOTE: All written assignments are to be done with a word processor and be neat and professional.
Good writing, grammar, punctuation, etc. are important and can affect your grade.
- Assignment #1
due: Jan 14, 2005
- Propose a (classical) physical system (or systems) for computing the following two binary functions:
- f:
- 00 -> 0
- 01 -> 1
- 10 -> 1
- 11 -> 1
- g:
- 00 -> 1
- 01 -> 0
- 10 -> 0
- 11 -> 1
- Your system must be reversible and deterministically compute the full function.
- In not more than two typed pages, describe your system, show examples of its
behavior and convince me that if we built it, it would work. Also, discuss how your system
could be extended to compute functions with more than two inputs.
- Paper Presentations
due: Feb 9 - Mar 11, 2005
- In 5-10 minutes give an overview of your chosen research paper (here is a list of potentially interesting recent papers). Make sure to clearly
state the paper's significance and support it with a high-level description of the
approach taken and results achieved. In other words, tell us briefly what the goal of the
paper was, how they attempted to achieve the goal and how successful they were. Be prepared
to answer questions.
- Feb 9, Robert Larson, A Functional Quantum Programming Language
- Feb 11, Kristine Perry, Neural Networks with c-NOT Gated Nodes
- Feb 14, Michael Thompson, Semiclassical Neural Network
- Feb 16, Eric Goodman, Quantum Searching via Entanglement and Partial Diffusion
- Feb 18, Kevin Simonson, Towards Efficiently Solving Quantum Traveling Salesman Problem
- Feb 22, Charlie Neo, Quantum Correlations and Nash Equilibria of a Bi-matrix Game
- Feb 25, Pat Mullen, Advantage of a Quantum Player over a Classical One in 2x2 Quantum Games
- Feb 28, David Norton, Quantization of Games: Towards Quantum Artificial Intelligence
- Mar 2, Neil Toronto, Quantum Pseudo-Telepathy
- Mar 4, Rahul Kumar, Fast Testing Quantum Circuits
- Mar 7, Ed Schaller, ???
- Mar 9, Micah Lewis, Entangled Quantum Networks
- Topic Proposal
due: Feb 18, 2005
- Do some outside reading, thinking, research, etc. and come up with a solid topic for your
research project. Write a paragraph (up to half a page) describing your proposal, why it is
important and how you will approach it. I will review these, make suggestions and consult with
you in the following week to make sure you have a solid topic, appropriate in scope for the course
and the time available.
- High-level Potential Project Areas
- Visualization of quantum computation
- Simulation of quantum computation (classically)
- Quantum compilers
- Quantum error correction
- Quantum algorithms
- Quantum approaches to NP-complete problems
- Quantum cryptography
- Quantum learning
- Quantum (high-level) programming
- Quantum games
- Binary Functions as Unitary Matrices
due:
- Construct unitary matrices that compute the four binary functions f:B->B, where B={0,1}, such
that
- U|x>|y> -> |x>|f(x)+y(mod2)>
Construct unitary matrices that compute the 16 binary functions
f:B^2->B such that
- U|x_1x_2>|y> -> |x_1x_2>|f(x)+y(mod2)>.
- Project Abstract
due: Mar 28, 2003
- Turn in a well-written abstract describing your class project. Include a descriptive title,
description of the work and intended results (around 200 words), and an annotated bibliography that
includes at least five references from the literature.
- Suggested Exercises
- Chapter 1
- 1.1, 1.2, 1.3
- Chapter 2
- 2.1, 2.2, 2.3, 2.4, 2.6, 2.8, 2.9, 2.10, 2.11, 2.13, 2.14, 2.15, 2.16
- Chapter 3
- 3.1, 3.2, 3.3, 3.4, 3.7, 3.8, 3.9, 3.10, 3.11, 3.12, 3.13, 3.14, 3.15, 3.16, 3.17, 3.18, 3.19, 3.21
-
- Chapter 4
- 4.2, 4.3, 4.4, 4.5, 4.6, 4.7
-
- Note that most of the exercises in the book are "suggested". This means that you should definitely do them -- they relate very directly to things we are trying to learn. The few that are not in the list above are not as pertinent, but you should probably look at those as well.