Related papers: Anyons from non-solvable finite groups are suffici…
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,…
It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more…
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates…
We study a linear array of coupled cavities interacting with two level systems and show how to construct individually addressable qubits in this system from the long-lived atom-photon excitations (polaritons) at each site. We derive the…
Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It…
Hamiltonian quantum gates controlled by classical electromagnetic fields form the basis of any realistic model of quantum computers. In this letter, we derive a lower bound on the field energy required to implement such gates and relate…
Low depth measurement-based quantum computation with qudits ($d$-level systems) is investigated and a precise relationship between this powerful model and qudit quantum circuits is derived in terms of computational depth and size…
The physical implementation of holonomic quantum computation is challenging due to the needed complex controllable interactions in multilevel quantum systems. Here we propose to implement nonadiabatic holonomic quantum computation with…
The Yang-Baxter equation and it's various forms have applications in many fields, including statistical mechanics, knot theory, and quantum information. Unitary solutions of the braided Yang-Baxter equation are of particular interest as…
A proposal for a magnetic quantum processor that consists of individual molecular spins coupled to superconducting coplanar resonators and transmission lines is carefully examined. We derive a simple magnetic quantum electrodynamics…
Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…
Simple constructions and protocols are demonstrated to allow the implementation of universal quantum computation on an arbitrarily large quantum system by controlling a fixed number of spins, vastly reducing the engineering requirements in…
Schemes for topological quantum computation are usually based on the assumption that the system is initially prepared in a specific state. In practice, this state preparation is expected to be challenging as it involves non-topological…
We show how to perform universal quantum computation with atoms confined in optical lattices which works both in the presence of defects and without individual addressing. The method is based on using the defects in the lattice, wherever…
We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation.…
Experimental realization of a universal set of quantum logic gates with high-fidelity is critical to quantum information processing, which is always challenging by inevitable interaction between the quantum system and environment. Geometric…
We present an architecture of QCPU(Quantum Central Processing Unit), based on the discrete quantum gate set, that can be programmed to approximate any n-qubit computation in a deterministic fashion. It can be built efficiently to implement…
A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons…
We show that a superconducting circuit containing two loops, when treated with Macroscopic Quantum Coherence (MQC) theory, constitutes a complete two-bit quantum computer. The manipulation of the system is easily implemented with…
We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the…