Quantum Computing, Complexity and Silicon Spin Qubit Architectures

Shaw, Alexis T. E.

Quantum Computing, Complexity and Silicon Spin Qubit Architectures

Shaw, Alexis T. E.

Permalink

Publication Type:: Thesis
Issue Date:: 2023

Embargoed

	Filename	Description	Size
	thesis.pdf	thesis	3.26 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Embargoed
Open Access

This item is currently unavailable due to the publisher's embargo.

The embargo period expires on 1 Sep 2025

Full metadata record

Field	Value	Language
dc.contributor.author	Shaw, Alexis T. E.
dc.date.accessioned	2023-10-03T03:11:36Z
dc.date.available	2023-10-03T03:11:36Z
dc.date.issued	2023
dc.identifier.uri	http://hdl.handle.net/10453/172430
dc.description	University of Technology Sydney. Faculty of Engineering and Information Technology.	en_US.UTF-8
dc.description.abstract	This work describes two research programs. The first is, an architecture for a scalable quantum computer based on MOS quantum dots arranged in narrow qubit lattices. To circumvent traditionally low thresholds of small fixed-width arrays, we deliberately engineer an error bias at the lowest level of encoding using the surface code and exploit this engineered bias at a higher level of encoding using either a lattice-surgery surface code bus that exploits this bias or a repetition code to make logical qubits with unbiased errors out of biased surface code qubits. Arbitrarily low error rates can be reached by further concatenating with other codes, such as Steane’s [[7,1,3]] code and the [[15,7,3]] CSS code. This enables a scalable quantum computing architecture on a narrow strip of qubit lattice only 19 qubits wide, given physical qubits with an error rate of 8.0x10^-4. It is accompanied by a comprehensive description of a silicon MOS-based quantum computer that exploits these narrow qubit lattices. In the second, we establish a theory of parameterized computational complexity for quantum computers, introducing quantum analogues for a range of parameterized complexity classes and examining the relationship between these classes, their classical counterparts, and well-studied problems.	en_US.UTF-8
dc.format	Thesis (PhD)
dc.language.iso	en_US	en_US.UTF-8
dc.relation	https://opus.lib.uts.edu.au/bitstream/10453/172430/1/thesis.pdf
dc.rights	info:eu-repo/semantics/embargoedAccess
dc.rights	The author owns the copyright in this thesis including all reproduction and reuse rights for the work. The work may not be altered without the permission of the copyright owner. Attribution is essential when quoting or paraphrasing from this thesis.
dc.rights	© 2023 Alexis T. E. Shaw
dc.rights	au.edu.uts.lib/cph
dc.title	Quantum Computing, Complexity and Silicon Spin Qubit Architectures	en_US.UTF-8
dc.type	Thesis
utslib.copyright.status	embargoed	*
utslib.copyright.embargo	2025-09-01T00:00:00+1000

Abstract:

This work describes two research programs. The first is, an architecture for a scalable quantum computer based on MOS quantum dots arranged in narrow qubit lattices. To circumvent traditionally low thresholds of small fixed-width arrays, we deliberately engineer an error bias at the lowest level of encoding using the surface code and exploit this engineered bias at a higher level of encoding using either a lattice-surgery surface code bus that exploits this bias or a repetition code to make logical qubits with unbiased errors out of biased surface code qubits. Arbitrarily low error rates can be reached by further concatenating with other codes, such as Steane’s [[7,1,3]] code and the [[15,7,3]] CSS code. This enables a scalable quantum computing architecture on a narrow strip of qubit lattice only 19 qubits wide, given physical qubits with an error rate of 8.0x10^-4. It is accompanied by a comprehensive description of a silicon MOS-based quantum computer that exploits these narrow qubit lattices. In the second, we establish a theory of parameterized computational complexity for quantum computers, introducing quantum analogues for a range of parameterized complexity classes and examining the relationship between these classes, their classical counterparts, and well-studied problems.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/172430