Related papers: Collective unitary evolution with linear optics by…
In this work we present a method of decomposition of arbitrary unitary matrix $U\in\mathbf U(2^k)$ into a product of single-qubit negator and controlled-$\sqrt{\mbox{NOT}}$ gates. Since the product results with negator matrix, which can be…
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…
Quantum gates executed on physical hardware are inevitably degraded by environmental noise. While state purification effectively distills static quantum resources, the dynamic execution of quantum algorithms requires a higher-order approach…
We propose a realization of quantum computing using polarized photons. The information is coded in two polarization directions of the photons and two-qubit operations are done using conditional Faraday effect. We investigate the performance…
From the set of operators for errors and its correction code, we introduce the so-called complete unitary transformation. It can be used for encoding while the inverse of it can be applied for correcting the errors of the encoded qubit. We…
We propose a scheme for scalable and universal quantum computation using diatomic bits with conditional dipole-dipole interaction, trapped within an optical lattice. The qubit states are encoded by the scattering state and the bound…
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…
We propose an approach to factorize the time-evolution operator of a quantum system through a (finite) sequence of elementary operations that are time-ordered. Our proposal borrows from previous approaches based on Lie algebra techniques…
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…
Any single-qubit unitary operation or quantum gate can be considered a rotation. Typical experimental implementations of single-qubit gates involve two or three fixed rotation axes, and up to three rotation steps. Here we show that, if the…
We present an explicit construction of a relativistic quantum computing architecture using a variational quantum circuit approach that is shown to allow for universal quantum computing. The variational quantum circuit consists of tunable…
Any technology for quantum information processing (QIP) must embody within it quantum bits (qubits) and maintain control of their key quantum properties of superposition and entanglement. Typical QIP schemes envisage an array of physical…
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 this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns…
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type…
We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the…
Based on the matrix realignment and partial transpose, we develop an approach to entangling power and operator entanglement of quantum unitary operators. We demonstrate efficiency of the approach by studying several unitary operators on…
Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The…
We show for the first time how deterministic unitary operations on time-bin qubits encoded in single photon pulses can be realized using fiber optics components that are available with current technology. We also generalize this result to…
Quantum walks are more than tools for building quantum algorithms. They have been used effectively to model and simulate quantum dynamics in many complex physical processes. Particularly, a variant of discrete-time quantum walk known as…