相关论文: Universal Quantum Gates for Single Cooper Pair Box…

Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…

We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425},…

Quantum gates based on geometric phases possess intrinsic noise-resilience features and therefore attract much attention. However, the implementations of previous geometric quantum computation typically require a long pulse time of gates.…

Measurement based quantum computation (MBQC) is an effective paradigm for universal quantum computation. In this scheme, the universal set of quantum gates are realized by only local measurements on the prior prepared cluster states. The…

The hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…

We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in…

We report the realization of an elementary quantum processor based on a linear crystal of trapped ions. Each ion serves as a quantum bit (qubit) to store the quantum information in long lived electronic states. We present the realization of…

We present a model for quantum computation using n steady 3-level atoms or 3-level quantum dots, kept inside a quantum electro-dynamics (QED) cavity. Our model allows one-qubit operations and the two-qubit controlled-NOT gate as required…

Nearly all modern solid-state quantum processors approach quantum computation with a set of discrete qubit operations (gates) that can achieve universal quantum control with only a handful of primitive gates. In principle, this approach is…

Quantum processors which combine the long decoherence times of spin qubits together with fast optical manipulation of excitons have recently been the subject of several proposals. I show here that arbitrary single- and entangling two-qubit…

Nonadiabatic holonomic quantum computation in decoherence-free subspaces has attracted increasing attention recently, as it allows for high-speed implementation and combines both the robustness of holonomic gates and the coherence…

Today ion traps are among the most promising physical systems for constructing a quantum device harnessing the computing power inherent in the laws of quantum physics. The standard circuit model of quantum computing requires a universal set…

We use one photon to simulate an n-qubit quantum system for the first time. We propose a new scheme to realize universal quantum computation in polynomial time O(n^5). A generating set of gates can be realized with high accuracy in the lab.…

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…

A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a…

We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of Controlled-NOT (C-NOT) gates required (single-qubit gates are free). We consider three…

First solid state quantum computer was built using transmons (cooper pair boxes). The operation of the computer is limited because of using a number of the rigit cooper boxes working with fixed frequency at temperatures of superconducting…

The performance of a quantum information processor depends on the precise control of phases introduced into the system during quantum gate operations. As the number of operations increases with the complexity of a computation, the phases of…

Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…

A quantum unitary gate is realized in this paper by perturbing a free charged particle in a one-dimensional box with a time- and position-varying electric field. The perturbed Hamiltonian is composed of a free particle Hamiltonian plus a…