相关论文: Exact solutions for universal holonomic quantum ga…
We find exact solutions for a universal set of quantum gates on a scalable candidate for quantum computers, namely an array of two level systems. The gates are constructed by a combination of dynamical and geometrical (non-Abelian) phases.…
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations.…
Nonadiabatic holonomic quantum computation provides the means to perform fast and robust quantum gates by utilizing the resilience of non-Abelian geometric phases to fluctuations of the path in state space. While the original scheme [New J.…
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…
We propose an implementation of holonomic (geometrical) quantum gates by means of semiconductor nanostructures. Our quantum hardware consists of semiconductor macroatoms driven by sequences of ultrafast laser pulses ({\it all optical…
Holonomic quantum computation is analyzed from geometrical viewpoint. We develop an optimization scheme in which an arbitrary unitary gate is implemented with a small circle in a complex projective space. Exact solutions for the Hadamard,…
The implementation of holonomic quantum computation is meaningful. We can effectively resist local and collective noise in the process of physical implementation by using the advantage of non-Abelian geometric phase. In this paper, we set…
Geometric phases are well known to be noise-resilient in quantum evolutions/operations. Holonomic quantum gates provide us with a robust way towards universal quantum computation, as these quantum gates are actually induced by nonabelian…
We implement a non-adiabatic universal set of holonomic quantum gates based on abelian holonomies using dynamical invariants, by Lie-algebraic methods. Unlike previous implementations, presented scheme does not rely on secondary methods…
Among the many proposals for the realization of a quantum computer, holonomic quantum computation (HQC) is distinguished from the rest in that it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
The non-adiabatic holonomic quantum computation with the advantages of fast and robustness attracts widespread attention in recent years. Here, we propose the first scheme for realizing universal single-qubit gates based on an…
The construction of two-qubit gates appropriate for universal quantum computation is of enormous importance to quantum information processing. Building such gates is dependent on accurate knowledge of the interaction dynamics between two…
In the holonomic approach to quantum computation information is encoded in a degenerate eigenspace of a parametric family of Hamiltonians and manipulated by the associated holonomic gates. These are realized in terms of the non-abelian…
We propose an all-geometric implementation of quantum computation using neutral atoms in cavity QED. We show how to perform generic single- and two-qubit gates, the latter by encoding a two-atom state onto a single, many-level atom. We…
We present a general technique to implement products of many qubit operators communicating via a joint harmonic oscillator degree of freedom in a quantum computer. By conditional displacements and rotations we can implement Hamiltonians…
Holonomic quantum computation exploits the geometric evolution of eigenspaces of a degenerate Hamiltonian to implement unitary evolution of computational states. In this work we introduce a framework for performing scalable quantum…
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single…
We show that, for even n, evolving n qubits according to a simple Hamiltonian can be used to exactly implement an (n+1)-qubit parity gate, which is equivalent in constant depth to an (n+1)-qubit fanout gate. We also observe that evolving…
Non-adiabatic holonomic quantum computation is a method used to implement high-speed quantum gates with non-Abelian geometric phases associated with paths in state space. Due to their noise tolerance, these phases can be used to construct…