Return to search

Quantum information engineering: concepts to quantum technologies

This thesis investigates several broad areas related to the effective implementation of quantum information processing, from large scale quantum algorithms and error correction, through to system identification and characterization techniques, efficient designs for quantum computing architectures and the design of small devices which utilize quantum effects. The discussion begins with the introduction of a quantum circuit appropriate for implementing Shor’s factoring algorithm on Linear Nearest Neighbor qubit arrays such as the Kane phosphorus in silicon system. Detailed numerical sim- ulations are then presented, demonstrating the sensitivity of the circuit under coherent quantum errors. The concepts of Quantum Error Correction and Fault-tolerant computation are reviewed with original work carried out to show the relative robustness and practicality of Fault-tolerant computation for logical state preparation. Methods of intrinsic system identification and characterization are proposed. Protocols for characterizing both the confinement of a multi-level system to the qubit subspace and the Hamiltonian dynamics governing two-qubit interactions are presented as well as a brief review of characterization techniques already developed for single qubit dynamics. (For complete abstract open document)

Identiferoai:union.ndltd.org:ADTP/245680
CreatorsDevitt, Simon
Source SetsAustraliasian Digital Theses Program
LanguageEnglish
Detected LanguageEnglish
RightsTerms and Conditions: Copyright in works deposited in the University of Melbourne Eprints Repository (UMER) is retained by the copyright owner. The work may not be altered without permission from the copyright owner. Readers may only, download, print, and save electronic copies of whole works for their own personal non-commercial use. Any use that exceeds these limits requires permission from the copyright owner. Attribution is essential when quoting or paraphrasing from these works., Open Access

Page generated in 0.0022 seconds