Resource estimation and routing of two qubit entanglement for distributed quantum computing

Leone, Hudson Thomas

Resource estimation and routing of two qubit entanglement for distributed quantum computing

Leone, Hudson Thomas

Permalink

Publication Type:: Thesis
Issue Date:: 2024

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download thesisAdobe PDF (4.7 MB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Leone, Hudson Thomas
dc.date.accessioned	2025-10-27T23:32:23Z
dc.date.available	2025-10-27T23:32:23Z
dc.date.issued	2024
dc.identifier.uri	http://hdl.handle.net/10453/190574
dc.description	University of Technology Sydney. Faculty of Engineering and Information Technology.	en_US.UTF-8
dc.description.abstract	Two qubit entanglement is a precious commodity for quantum computing, as it enables lossless transmission of arbitrary quantum states. My first result is a framework for studying entanglement routing algorithms that I call the cost-vector formalism. Here, the edges of a multi-graph represent entanglement links that may exist between users. Entanglement routing is treated as a sequence of edge-contractions, which extend and refine entanglement throughout the network. My second work investigates lattice surgery rates between distant surface codes using entanglement mediated by quantum satellites. Our results suggest quantum satellites are unsuitable for continental-scale distributed quantum computation. My third work analyzes lattice surgery rates between trapped-ion surface codes in separate ion traps. Additionally, I estimate the number of ions that will be required to perform lattice surgery at various rates. Our prohibitive estimates indicate an urgent need for improved optical coupling for trapped-ion quantum computers to remain viable in the long term. In an unrelated final chapter, I present software that assembles quantum circuits to simulate arbitrary linear interferometers in the second quantization picture and I discuss various other simulation approaches.	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/190574/1/thesis.pdf
dc.rights	info:eu-repo/semantics/openAccess
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	© 2024 Hudson Thomas Leone
dc.rights	au.edu.uts.lib/cph
dc.title	Resource estimation and routing of two qubit entanglement for distributed quantum computing	en_US.UTF-8
dc.type	Thesis
utslib.copyright.status	open_access	*

Abstract:

Two qubit entanglement is a precious commodity for quantum computing, as it enables lossless transmission of arbitrary quantum states. My first result is a framework for studying entanglement routing algorithms that I call the cost-vector formalism. Here, the edges of a multi-graph represent entanglement links that may exist between users. Entanglement routing is treated as a sequence of edge-contractions, which extend and refine entanglement throughout the network. My second work investigates lattice surgery rates between distant surface codes using entanglement mediated by quantum satellites. Our results suggest quantum satellites are unsuitable for continental-scale distributed quantum computation. My third work analyzes lattice surgery rates between trapped-ion surface codes in separate ion traps. Additionally, I estimate the number of ions that will be required to perform lattice surgery at various rates. Our prohibitive estimates indicate an urgent need for improved optical coupling for trapped-ion quantum computers to remain viable in the long term. In an unrelated final chapter, I present software that assembles quantum circuits to simulate arbitrary linear interferometers in the second quantization picture and I discuss various other simulation approaches.

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

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