Related papers: Hadamard type operations for qubits

We discuss and experimentally demonstrate a probabilistic Hadamard gate for coherent state qubits. The scheme is based on linear optical components, non-classical resources and the joint projective action of a photon counter and a homodyne…

Very recently the most general ensemble of qubits are identified using the notion of linearity; any of these qubits gets accepted by a Hadamard gate to generate the equal superposition of the qubit and its orthogonal. Towards more…

We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a "global Hadamard operation", i.e. apply a Hadamard operation to every qubit…

We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal…

To any complex Hadamard matrix we associate a quantum permutation group. The correspondence is not one-to-one, but the quantum group encapsulates a number of subtle properties of the matrix. We investigate various aspects of the…

A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may…

We introduce a new gate that transfers an arbitrary state of a qubit into a superposition of two quasi-orthogonal coherent states of a cavity mode, with opposite phases. This qcMAP gate is based on conditional qubit and cavity operations…

In this paper, we develop a new classical simulation of quantum bit (qubit) by use of analog components in order to be able to simulate the quantum properties such as the superposition of states. As part of this new approach, we have also…

We present a general methodology to obtain the basis of qudits which are admissible to Quantum Fourier Transform (QFT). We first study this method for qubits to characterize the ensemble that works for the Hadamard transformation (QFT for…

We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a…

We generalise our previous results of universal linear manipulations [Phys. Rev. A63, 032304 (2001)] to investigate three types of nonlinear qubit transformations using measurement and quantum based schemes. Firstly, nonlinear rotations are…

A proposed method for preparing the superposition states of qubits using different axes of the Bloch sphere. This method utilizes the Y-axis of the Bloch sphere using IBM native (square root of X) gates, instead of utilizing the X-axis of…

We consider models of quantum computation that involve operations performed on some fixed resourceful quantum state. Examples that fit this paradigm include magic state injection and measurement-based approaches. We introduce a framework…

Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an…

We propose a quantum state transfer from an atomic qubit to a cat-like qubit by means of one degenerate Raman interaction and one Hadamard gate operation for coherent states. We show that the coefficients of the atomic qubit can be mapped…

An implementation is proposed of single qubit gates, e.g., phase, NOT, \sqrt{NOT} and Hadamard, operating on polarized photons and based on light storage. Instead of processing photons themselves, qubit transformations are performed on…

We propose the implementation of a deterministic Hadamard gate for logical photonic qubits encoded in superpositions of coherent states of a harmonic oscillator. The proposed scheme builds on a recently introduced set of conditional…

A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…

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…

Identifying the Bolch sphere with the Riemann sphere(the extended complex plane), we obtain relations between single qubit unitary operations and M\"{o}bius transformations on the extended complex plane.