Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 18 of 18 for “"Graph state"”.
-
Graph state properties and applications in the stabilizer formalism
Graph states form a class of entangled quantum states that have multiple useful applications within quantum computing and quantum communication protocols. The stabilizer formalism offers an efficient mathematical description of graph states and the effect of operations acting on such states. Here, …
-
Quantum Networks
Entangled quantum states are remarkably rich resources for communication and computation. Today, we are witnessing the emergence of useful quantum technologies and global efforts to build the first entangled quantum communication infrastructures - the world's first quantum networks. In this thesis, …
-
Extraction and stabilization of quantum many-body states
“Graph” states are highly entangled quantum states that are crucial resources in measurement - based quantum computing and quantum communications. Despite the importance of photonic graph and cluster states for quantum technologies, their generation presents considerable difficulties and it is a …
-
Generating Optical Graph States
… able to interact in arbitrary combination. Graph states---the predominant language of qubit entanglement---enable the prevailing, measurement-based model of quantum computation, which increases scalability by reducing qubit interaction requirements to nearest neighbours. Meanwhile, optics …
-
Benchmarking measurement-based quantum computation on graph states
… computing that operates on a prepared entangled graph state, typically a cluster state. In this dissertation, we will detail the creation of graph states across various physical platforms using different entangling gates. We will then benchmark the quality of graph states created with error-prone …
-
Clifford Simulation: Techniques and Applications
… In particular, the Gottesman-Knill theorem states that Clifford circuits can be efficiently simulated. We begin this thesis by reviewing and comparing several known techniques for efficient simulation of Clifford circuits: the stabilizer formalism, CH form, affine form, and the graph state …
-
Graph states in large-scale integrated quantum photonics
The fragility of quantum states rapidly leads to errors in the operation of quantum computers. However, error-correction schemes overcome this challenge by entangling many physical qubits into composite logical qubits, which are error-protected. Consequently, any viable platform for quantum …
-
Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem
… focus on structural clustering of probabilistic graphs, which comes with significant computational challenges and has, so far, resisted efficient solutions that are able to scale to large graphs, e.g. state-of-art can only handle graphs with a few million edges. We address the main bottleneck …
-
Zorro: zero-cost reactive failure recovery in distributed graph processing
Distributed graph processing frameworks have become increasingly popular for processing large graphs. However, existing frameworks either lack the ability to recovery from failures or support proactive recovery methods. Proactive recovery methods like checkpointing incur high overheads during …
-
Towards scalable quantum silicon photonics with spin qubits
… use of circuit-bound photons to build cluster states and perform one-way measurement-based quantum computations on arrays of long-coherence-time solid state spin-qubits in silicon. The architecture is specified from the completely abstract 3D graph state level, down to a 2D topography that can …
-
Graph Representation of Topological Stabilizer States
Topological quantum states, especially these in topological stabilizer quantum error correction codes, are currently the focus of intense activity because of their potential for fault-tolerant operations. While every stabilizer state maps to a graph state under local Clifford operations, the graphs …
-
Quantum Network Protocols and Architectures
… codes made up of photonic entangled states. This dissertation advances the state of the art for both varieties of quantum repeaters. It begins with an all-inclusive guidebook to the stabilizer formalism and linear optics---interspersed with new results and insights on graphical rules …
-
Mapping, tree detection, localization, and autonomous flight of unmanned aerial vehicles in forest applications
… thereby creating a map of the seedling trees. A graphbased registration approach is developed to localize the forest cleaning machine within the map. A human-machine interface is also developed to incorporate the registration algorithm and to show in real-time the seedling trees and the cleaning …
-
Approximate failure recovery in distributed graph processing systems
Distributed graph processing systems are an emerging area of big data systems. As graphs continue to grow in size and prevalence, these systems must become faster and more scalable. However, after failures, distributed graph processing systems either largely rely on proactive fault tolerance …
-
Multipartite Entanglement: Transformations, Quantum Secret Sharing, Quantum Error Correction
… transformations between multipartite entangled states that only use local operations and classical communication (LOCC). We mostly focus on three qubit states in the GHZ class, and derive upper and lower bounds for the successful transformation probability between two states. We then focus on …
-
Hardware-Aware Quantum Error Correction and Architectural Designs for Quantum Computers
… photons, distributed to parties, creates a Bell state between 56 random pairs with 87.5% efficiency. We then explored high-dimensional fusion operations for fusing qudit cluster states. Focusing on Type-II fusion, a central component of measurement-based quantum computing, we derived the most …
-
MODEL-BASED REINFORCEMENT LEARNING FOR COMPLEX ENVIRONMENTS
… making tasks require reasoning a low-dimensional state embedded in high-dimensional complex partial observations. In this thesis, we focus on model-based reinforcement learning. We demonstrate that by the discriminative learning of structured dynamic models, the overall performance of DRL …