Related papers: Universal construction of unitary transformation o…
Any quantum computational network can be constructed with a sequence of the two-qubit diagonal quantum gates and one-qubit gates in two-state quantum systems. The universal construction of these quantum gates in the quantum systems and of…
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…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…
We consider the implementation of two-qubit unitary transformations by means of CNOT gates and single-qubit unitary gates. We show, by means of an explicit quantum circuit, that together with local gates three CNOT gates are necessary and…
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…
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…
Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit…
Electron transport in realistic physical and chemical systems often involves the non-trivial exchange of energy with a large environment, requiring the definition and treatment of open quantum systems. Because the time evolution of an open…
Usually models for quantum computations deal with unitary gates on pure states. In this paper we generalize the usual model. We consider a model of quantum computations in which the state is an operator of density matrix and the gates are…
Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is…
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…
We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms.…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
We show how to construct a universal set of quantum logic gates using control over exchange interactions and single- and two-spin measurements only. Single-spin unitary operations are teleported instead of being executed directly, thus…
Unitary operation is an essential step for quantum information processing. We first propose an iterative procedure for decomposing a general unitary operation without resorting to controlled-NOT gate and single-qubit rotation library. Based…
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…
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…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit…
Any unitary transformation can be decomposed into a product of a group of near-trivial transformations. We investigate in details the construction of universal quantum circuit of near trivial transformations. We first construct two…