Related papers: Quantum $\mathcal{R}$-matrices as universal qubit …
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
The concepts of topology and geometry are of critical importance in exploring exotic phases of quantum matter. Though they have been investigated on various experimental platforms, to date a direct probe of topological and geometric…
Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…
In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also…
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…
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the…
Given a set of quantum gates and a target unitary operation, the most elementary task of quantum compiling is the identification of a sequence of the gates that approximates the target unitary to a determined precision $\varepsilon$.…
We show that the topological modular functor from Witten-Chern-Simons theory is universal for quantum computation in the sense a quantum circuit computation can be efficiently approximated by an intertwining action of a braid on the…
We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.
We discuss a nexus among quantum topology, quantum physics and quantum computing.
The model of a topological quantum computer is a promising one due to its natural resistance to noise and other errors. Operations in such a computer are implemented by braiding the trajectories of anyons. While it is easy to understand how…
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…
We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…
This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequence of gates from a fixed and finite set. The algorithm can be…
We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
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…
In topological quantum computation, quantum information is stored in states which are intrinsically protected from decoherence, and quantum gates are carried out by dragging particle-like excitations (quasiparticles) around one another in…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We propose an experimentally feasible scheme to achieve quantum computation based on a pair of orthogonal cyclic states. In this scheme, quantum gates can be implemented based on the total phase accumulated in cyclic evolutions. In…