Purifying Quantum States: Quantum and Classical Algorithms
arXiv:quant-ph/0503169
Abstract
I give analytical estimates and numerical simulation results for the performance of Kitaev's 2d topological error-correcting codes. By providing methods for the execution of an encoded three-qubit Toffoli gate, I complete a universal gate set for these codes. I also examine the utility of Bohm's and Bohm-inspired interpretations of quantum mechanics for numerical solution of many-body dynamics and ``mechanism identification'' heuristics in discrete systems. Further, I show an unexpected quantitative correspondence between the previously known continuum of stochastic-Bohm trajectory theories on the one hand and extant path integral Monte Carlo methods on the other hand.
Ph.D. thesis accepted by UCSB on 9/2003. Finally got around to arxiving it
References in corpus (6)
Cited by in corpus (7)
- Almost-linear time decoding algorithm for topological codes
- Cellular-automaton decoders for topological quantum memories
- The "Unromantic Pictures" of Quantum Theory
- Quantum computing by color-code lattice surgery
- A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing
- Global Existence of Bell's Time-Inhomogeneous Jump Process for Lattice Quantum Field Theory
- Bell's Jump Process in Discrete Time