Related papers: Quantum Sequence States
An important and usual problem is to search all states we want from a database with a large number of states. In such, recall is vital. Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but…
Entangling an unknown qubit with one type of reference state is generally impossible. However, entangling an unknown qubit with two types of reference states is possible. To achieve this, we introduce a new class of states called zero sum…
We theoretically investigate a possibility to establish multi-qubit quantum correlations in one-dimensional chains of qubits. We combine a reservoir engineering strategy with coherent dynamics to generate multi-qubit entangled states. We…
Recent studies have been spurred on by the promise of advanced quantum computing technology, which has led to the development of quantum computer simulations on classical hardware. Grover's quantum search algorithm is one of the well-known…
Grover's algorithm, a well-know quantum search algorithm, allows one to find the correct item in a database, with quadratic speedup. In this paper we adapt Grover's algorithm to the problem of finding a correct answer to a natural language…
$W$ states are quantum correlated states possessing both bipartite and multipartite entanglement, which makes them useful for several quantum algorithms. We propose a protocol to generate these states by exploiting {\it topological ring…
We construct quantum gate entanglers for different classes of multipartite states based on definition of W and GHZ concurrence classes. First, we review the basic construction of concurrence classes based on orthogonal complement of a…
We consider graph states generated by the action of controlled phase shift operators on a separable state of a multi-qubit system. The case when all the qubits are initially prepared in arbitrary states is investigated. We obtain the…
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which…
We give an elementary introduction to the notion of quantum entanglement between distinguishable parties and review a recent proposal about solid state quantum computation with spin-qubits in quantum dots. The indistinguishable character of…
We investigate the problem of copying pure two-qubit states of a given degree of entanglement in an optimal way. Completely positive covariant quantum operations are constructed which maximize the fidelity of the output states with respect…
Quantum entanglement is a fundamental property of coherent quantum states and an essential resource for quantum computing. While two-qubit entanglement has been demonstrated for spins in silicon, creation of multipartite entanglement, a…
The ability to prepare states for quantum chemistry is a promising feature of quantum computers, and efficient techniques for chemical state preparation is an active area of research. In this paper, we implement and investigate two methods…
Inspired by recent advances in the manipulation of superconducting circuits coupled to mechanical modes in the quantum regime, we propose a protocol for generating superpositions of orthogonally squeezed states in a quantum harmonic…
The familiar Greenberger-Horne-Zeilinger (GHZ) states can be rewritten by entangling the Bell states for two qubits with a state of the third qubit, which is dubbed entangled entanglement. We show that in this way we obtain all 8…
We propose to employ the amplification mechanism of Grover's search algorithm to efficiently prepare entangled states of an ensemble of qubits. The conditional change of sign employed in the algorithm can be implemented by the phase shift…
We introduce an elementary quantum system consisting of a set of spins on a graph and a particle hopping between its nodes. The quantum state is build sequentially, applying a unitary transformation that couples neighboring spins and, at a…
Entanglement is a unique nature of quantum theory and has tremendous potential for application. Nevertheless, the complexity of quantum entanglement grows exponentially with an increase in the number of entangled particles. Here we…
A conception of virtual quantum information bit - virtual qubit - is introduced. It is shown by means of virtual qubit representation that four states of a single quantum particle is enough for implementation of full set of the gates, which…
We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states. This allows, for instance, the construction of a quantum computer based on just single qubit operations, Bell…