Related papers: Exchange Gate on the Qudit Space and Fock Space

We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first…

Exchange-coupled singlet-triplet spin qubits in two gate-defined double quantum dots are considered theoretically. Using charge density operators to describe the double-dot orbital states, we calculate the Coulomb couplings between the…

As sensor nodes are deployed anywhere in a wireless sensor network, hence their communication can be easily monitored. In these networks, message protection and node identification are very issues. Hence, security of large scale such…

We extend the spherical code based key distribution protocols to qudits with dimensions 4 and 16 by constructing equiangular frames and their companions. We provide methods for equiangular frames in arbitrary dimensions for Alice to use and…

We present pulse sequences for two-qubit gates acting on encoded qubits for exchange-only quantum computation. Previous work finding such sequences has always required numerical methods due to the large search space of unitary operators…

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…

Quantum information carriers, just like most physical systems, naturally occupy high-dimensional Hilbert spaces. Instead of restricting them to a two-level subspace, these high-dimensional (qudit) quantum systems are emerging as a powerful…

The controlled-NOT gate and controlled square-root NOT gate play an important role in quantum algorithm. This article reports the experimental results of these two universal quantum logic gates (controlled square-root NOT gate and…

We introduce transformation matrix connecting sets of the displaced states with different displacement amplitudes. Arbitrary pure one-mode state can be represented in new basis of the displaced number (Fock) states ( representation) by…

Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and controlling a single effective exchange interaction and possibly a global magnetic field. This "encoded universality"…

A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT…

We employ quantum optimal control theory to realize quantum gates for two protected superconducting circuits: the heavy-fluxonium qubit and the 0-$\pi$ qubit. Utilizing automatic differentiation facilitates the simultaneous inclusion of…

The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two…

We present a full quantum treatment of a five-level atomic system coupled to two quantum and two classical light fields. The two quantum fields undergo a cross-phase modulation induced by electro-magnetically induced transparency. The…

We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.

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…

In the paper, we consider quantum circuits for the Quantum Fourier Transform (QFT) algorithm. The QFT algorithm is a very popular technique used in many quantum algorithms. We present a generic method for constructing quantum circuits for…

In this paper, we exclusively utilize CNOT gates for implementing permutation groups generated by more than two elements. In Lemma 1, we recall that three CNOT gates are both necessary and sufficient to execute a two-qubit swap gate…

We give a quantum gate construction - composed entirely from incidents of the CNOT gate - that generalises the qubit SWAP gate to higher dimensions. This new construction is more regular than and is an improvement on the WilNOT quantum gate…

The universal quantum cloning machine and the universal NOT gate acting on a single qubit can be implemented very generally by slightly modifying the protocol of quantum state teleportation. The experimental demonstration of the 1 to 2…