Related papers: Universal quantum computation using Ising anyons f…
The topic of this thesis is the development of a versatile and geometrically motivated differential calculus on non-commutative or quantum spaces, providing powerful but easy-to-use mathematical tools for applications in physics and related…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
A class of anyonic models for universal quantum computation based on weakly-integral anyons has been recently proposed. While universal set of gates cannot be obtained in this context by anyon braiding alone, designing a certain type of…
Quantum computing is increasingly offering concrete solutions toward the simulation of nuclear structure, with the potential to overcome the exponential scaling that limits classical diagonalization methods in large spaces. A particularly…
We solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a…
We consider a two-dimensional spin system that exhibits abelian anyonic excitations. Manipulations of these excitations enable the construction of a quantum computational model. While the one-qubit gates are performed dynamically the model…
I examine, in general, how tunable interactions may be used to perform anyonic teleportation and generate braiding transformations for non-Abelian anyons. I explain how these methods are encompassed by the "measurement-only" approach to…
Recently, a framework was established to systematically construct novel universal resource states for measurement-based quantum computation using techniques involving finitely correlated states. With these methods, universal states were…
We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…
Because the subject of relativistic quantum field theory (QFT) contains all of non-relativistic quantum mechanics, we expect quantum field computation to contain (non-relativistic) quantum computation. Although we do not yet have a quantum…
This dissertation explores quantum computation using qudits encoded into large spins, emphasizing the concept of quantum co-design to harness the unique capabilities of physical platforms for enhanced quantum information processing. First,…
By encoding a qudit in a harmonic oscillator and investigating the infinite limit, we give an entirely new realization of continuous-variable quantum computation. The generalized Pauli group is generated by number and phase operators for…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
In this work, we propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors. Our teleportation-based quantum transistors, called ``telesistors'', are ground states of systems with…
From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation…
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…
We study the emergence of topological matter in two-dimensional systems of neutral Rydberg atoms in Ruby lattices. While Abelian anyons have been predicted in such systems, non-Abelian anyons, which would form a substrate for fault-tolerant…
An universal quantum network which can implement a general quantum computing is proposed. In this sense, it can be called the quantum central processing unit (QCPU). For a given quantum computing, its realization of QCPU is just its quantum…
For the first time in history, we are seeing a branching point in computing paradigms with the emergence of quantum processing units (QPUs). Extracting the full potential of computation and realizing quantum algorithms with a…