This thesis presents a model of Quantum Cellular Automata (QCA).
The presented formalism is a natural quantization of the classical Cellular Automata (CA).
It is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations.
One purpose of this model is to act as a theoretical model of quantum computation, similar to the quantum circuit model.
The main advantage that QCA have over quantum circuits is that QCA make considerably fewer demands on the underlying hardware.
In particular, as opposed to direct implementations of quantum circuits, the global evolution of the lattice in the QCA model does not assume independent control over individual \emph{qudits}.
Rather, all qudits are to be addressed collectively in parallel.
The QCA model is also shown to be an appropriate abstraction for space-homogeneous quantum phenomena, such as quantum lattice gases, spin chains and others.
Some results that show the benefits of basing the model on local unitary operators are shown: computational universality, strong connections to the circuit model, simple implementation on quantum hardware, and a series of applications.
A detailed discussion will be given on one particular application of QCA that lies outside either computation or simulation: single-spin measurement.
This algorithm uses the techniques developed in this thesis to achieve a result normally considered hard in physics.
It serves well as an example of why QCA are interesting in their own right.
| Identifer | oai:union.ndltd.org:WATERLOO/oai:uwspace.uwaterloo.ca:10012/3316 |
| Date | 13 September 2007 |
| Creators | Perez Delgado, Carlos Antonio |
| Source Sets | University of Waterloo Electronic Theses Repository |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
Page generated in 0.0017 seconds