Related papers: General structures of reversible and quantum gates
We demonstrate that conditional as well as unconditional basic operations which are prerequisite for universal quantum gates can be performed with almost 100% fidelity within a strongly interacting two-electron quantum ring. Both sets of…
We study the minimum time to implement an arbitrary two-qubit gate in two heteronuclear spins systems. We give a systematic characterization of two-qubit gates based on the invariants of local equivalence. The quantum gates are classified…
The controlled-NOT gate and controlled square-root NOT gate play an important role in quantum algorithm. This article reports the experimental results of these two universal quantum logic gates (controlled square-root NOT gate and…
Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms will need to be heavily optimized to fit within the finite…
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications…
We assess the resources needed to identify a reversible quantum gate among a finite set of alternatives, including in our analysis both deterministic and probabilistic strategies. Among the probabilistic strategies we consider unambiguous…
Most quantum compiling efforts rely on standard two-qubit basis gates, such as CX and iSWAP, to implement general quantum operations. However, with the advancement of quantum architecture design, more nonstandard two-qubit gates can now be…
The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits. However, two-qubit gates are considered a major cost of…
In the lectures we will be concerned with some aspects of physical implementations of quantum gate operations which are necessary for quantum information processing. We will discuss two possible realizations. One of them is based on qubits…
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through a bijective mapping from N qubits to qudits with D = 2^N levels via rotations in U(2). For each of the universal gates (H, CNOT, and T), as…
In this paper we provide an explicit parameterization of arbitrary unitary transformation acting on n qubits, in terms of one and two qubit quantum gates. The construction is based on successive Cartan decompositions of the semi-simple Lie…
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a…
We investigate the characteristics of purely electrostatic interactions with external gates in constructing full single qubit manipulations. The quantum bit is naturally encoded in the spatial wave function of the electron system.…
A six-qubit quantum network consisting of conditional unitary gates is presented which is capable of implementing a large class of covariant two-qubit quantum operations. Optimal covariant NOT operations for one and two-qubit systems are…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
Computations with a future quantum computer will be implemented through the operations by elementary quantum gates. It is now well known that the collection of 1-bit and 2-bit quantum gates are universal for quantum computation, i.e., any…
In classical physics, a single measurement can in principle reveal the state of a system. However, quantum theory permits numerous non-equivalent measurements on a physical system, each providing only limited information about the state.…
The efficient decomposition of multi-controlled gates is a significant factor in quantum compiling, both in circuit depth and T-gate count. Recent work has demonstrated that qudits have the potential to reduce resource requirements from…
We consider the problem of deciding if a set of quantum one-qudit gates $\mathcal{S}=\{g_1,\ldots,g_n\}\subset G$ is universal, i.e if the closure $\overline{<\mathcal{S}>}$ is equal to $G$, where $G$ is either the special unitary or the…
Coherent gate errors are a concern in many proposed quantum computing architectures. These errors can be effectively handled through composite pulse sequences for single-qubit gates, however, such techniques are less feasible for entangling…