# Paper Dance

Yep, it's that time again. Paper dance time!arXiv:1006.4388Making Classical Ground State Spin Computing Fault-Tolerant
Isaac J. Crosson, Dave Bacon, Kenneth R. Brown
We examine a model of classical deterministic computing in which the ground state of the classical system is a spatial history of the computation. This model is relevant to quantum dot cellular automata as well as to recent universal adiabatic quantum computing constructions. In its most primitive form, systems constructed in this model cannot compute in an error free manner when working at non-zero temperature. However, by…

A paper dance today! Yes, indeed, it's another slow dance (scirate, arXiv:0912.2098):Adiabatic Cluster State Quantum Computing
Authors: Dave Bacon, Steven T. Flammia
Abstract: Models of quantum computation are important because they change the physical requirements for achieving universal quantum computation (QC). For example, one-way QC requires the preparation of an entangled "cluster" state followed by adaptive measurement on this state, a set of requirements which is different from the standard quantum circuit model. Here we introduce a model based on one-way QC but without measurements…

Okay, well not quite a music video(!), but my coauthor Steve Flammia has done a videoabstract for our paper (on quantiki at http://www.quantiki.org/video_abstracts/09050901):

Yep, it's paper dance time. This one is less of a dance and more of a shuffle:
arXiv:0808.0174 (scirate)
Title: Simon's Algorithm, Clebsch-Gordan Sieves, and Hidden Symmetries of Multiple Squares
Author: D. Bacon
Abstract: The first quantum algorithm to offer an exponential speedup (in the query complexity setting) over classical algorithms was Simon's algorithm for identifying a hidden exclusive-or mask. Here we observe how part of Simon's algorithm can be interpreted as a Clebsch-Gordan transform. Inspired by this we show how Clebsch-Gordan transforms can be used to efficiently find a…