Computer Science – Computational Complexity
Scientific paper
2000-12-20
Computer Science
Computational Complexity
243 pages, PhD Dissertation, Stanford University, July 2000
Scientific paper
Quantum computation is a subject of much theoretical promise, but has not been realized in large scale, despite the discovery of fault-tolerant procedures to overcome decoherence. Part of the reason is that the theoretically modest requirements still present daunting experimental challenges. The goal of this Dissertation is to reduce various resources required for robust quantum computation, focusing on quantum error correcting codes and solution NMR quantum computation. A variety of techniques have been developed, including high rate quantum codes for amplitude damping, relaxed criteria for quantum error correction, systematic construction of fault-tolerant gates, recipes for quantum process tomography, techniques in bulk thermal state computation, and efficient decoupling techniques to implement selective coupled logic gates. A detailed experimental study of a quantum error correcting code in NMR is also presented. The Dissertation clarifies and extends results previously reported in quant-ph/9610043, quant-ph/9704002, quant-ph/9811068, quant-ph/9904100, quant-ph/9906112, quant-ph/0002039. Additionally, a procedure for quantum process tomography using maximally entangled states, and a review on NMR quantum computation are included.
No associations
LandOfFree
Towards Robust Quantum Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Towards Robust Quantum Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Robust Quantum Computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-662552