Related papers: A generalized quantum SWAP gate
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used…
Numerical simulation results are presented which suggest that a class of non-adiabatic rapid passage sweeps first realized experimentally in 1991 should be capable of implementing a set of quantum gates that is universal for one-qubit…
We demonstrate that in a coupled two-qubit system any single-qubit gate can be decomposed into two conditional two-qubit gates and that any conditional two-qubit gate can be implemented by a manipulation analogous to that used for a…
An approach is proposed to implement the universal quantum gates between the ions confined individually in the separated traps. Instead of the typical adiabatic operations, performed for manipulating the ion-ion coupling, here the…
Implementation of high-fidelity swapping operations is of vital importance to execute quantum algorithms on a quantum processor with limited connectivity. We present an efficient pulse control technique, cross-cross resonance (CCR) gate, to…
Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, enabling the execution of large quantum circuits without compromising on performance and connectivity. Photonic networks are…
Quantum information science addresses how the processing and transmission of information are affected by uniquely quantum mechanical phenomena. Combination of two-qubit gates has been used to realize quantum circuits, however, scalability…
We show that single-qudit universality in Clifford-based gate sets follows a trichotomy determined by the prime factorization of the local dimension $d$. For prime $d$, any gate outside the Clifford group is universal. For prime-power…
As we are approaching actual application of quantum technology, it is essential to exploit the current quantum resources in the best possible way. With this in mind, it might not be beneficial to use the usual standard gate sets, inspired…
We consider a quantum circuit in which shift and rotation operations on qubits are performed by swap gates and controlled swap gates. These operations can be useful for quantum computers performing elementary arithmetic operations such as…
We analyze the operation of quantum gates for neutral atoms with qubits that are delocalized in space, i.e., the computational basis states are defined by the presence of a neutral atom in the ground state of one out of two trapping…
Much recent work on distributed quantum computing have focused on the use of entangled pairs and distributed two qubit gates. But there has also been work on efficient schemes for achieving multipartite entanglement between nodes in a…
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…
Cavity-mediated two-qubit gates, for example between solid-state spins, are attractive for quantum network applications. We propose three schemes to implement a controlled phase-flip gate mediated by a cavity. The main advantage of all…
We theoretically present a method to realize a deterministic photon-photon (SWAP)^{1/2} gate using a three-level lambda system interacting with single photons in reflection geometry. The lambda system is used completely passively as a…
We show that with the assistance of a third level of the qubits an n-qubit phase gate can be constructed from $2n-4$ two-qutrit conditional swap gates, a single qutrit-qubit controlled phase gate, and two single-qutrit operations. Unlike…
The large available Hilbert space and high coherence of cavity resonators makes these systems an interesting resource for storing encoded quantum bits. To perform a quantum gate on this encoded information, however, complex nonlinear…
We present a universal set of quantum gate operations based on exchange-only spin qubits in a double quantum dot, where each qubit is obtained by three electrons in the (2,1) filling. Gate operations are addressed by modulating…
In the circuit model, quantum computers rely on the availability of a universal quantum gate set. A particularly intriguing example is a set of two-qubit only gates: matchgates, along with SWAP (the exchange of two qubits). In this paper,…
We construct the exchange gate with small elementary gates on the space of qudits, which consist of three controlled shift gates and three "reverse" gates. This is a natural extension of the qubit case. We also consider a similar subject on…