Related papers: Dissipative decoherence in the Grover algorithm
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum…
We have studied how decoherence affects a quantum walk on the line. As expected, it is highly sensitive, consisting as it does of an extremely delocalized particle. We obtain an expression for the rate at which the standard deviation falls…
Recent experiments show the existence of collective decoherence in quantum systems. We study the possibility of quantum computation in decoherence free subspace which is robust against such kind of decoherence processes. This passive…
The information in quantum computers is often stored in identical two-level systems (spins or pseudo-spins) that are separated by a distance shorter than the characteristic wavelength of a reservoir which is responsible for decoherence. In…
It is discussed the decoherence problems in ensemble large-scale solid state NMR quantum computer based on the array of P donor atoms having nuclear spin I = 1/2. It is considered here, as main mechanisms of decoherence for low temperature…
In order to understand the bounds of utilization of the Grover's search algorithm for the large unstructured data in presence of the quantum computer noise, we undertake a series of simulations by inflicting various types of noise, modelled…
Decoherence is the fundamental obstacle limiting the performance of quantum information processing devices. The problem of transmitting a quantum state (known or unknown) from one place to another is of great interest in this context. In…
Quantum coherence is one of the fundamental properties of quantum mechanics and also acts as a valuable resource for a variety of practical applications, which includes quantum computing and quantum information processing. Evaluating the…
Quantum computing has noteworthy speedup over classical computing by taking advantage of quantum parallelism, i.e., the superposition of states. In particular, quantum search is widely used in various computationally hard problems. Grover's…
Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…
Quantum coherence constitutes a fundamental physical mechanism essential to the study of quantum algorithms. We study the coherence and decoherence in generalized Shor's algorithm where the register $A$ is initialized in arbitrary pure…
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other…
The time development of the reduced density matrix for a quantum oscillator damped by coupling it to an ohmic environment is calculated via an identity of the Debye-Waller form. Results obtained some years ago by Hakim and the author in the…
Several phenomenological approaches to quantum gravity predict the existence of a minimal measurable length and/or a maximum measurable momentum near the Planck scale. When embedded into the framework of quantum mechanics, such constraints…
Quantum chaos---the study of quantized nonintegrable Hamiltonian systems---is an extremely well-developed and sophisticated field. By contrast, very little work has been done in looking at quantum versions of systems which classically…
Schemes of gravitationally induced decoherence are being actively investigated as possible mechanisms for the quantum-to-classical transition. Here, we introduce a decoherence process due to quantum gravity effects. We assume a foamy…
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…
On the way to solid-state quantum computing, overcoming decoherence is the central issue. In this contribution, we discuss the modeling of decoherence of a superonducting flux qubit coupled to dissipative electronic circuitry. We discuss…
Much of the discussion of decoherence has been in terms of a particle moving in one dimension that is placed in an initial superposition state (a Schr\"{o}dinger "cat" state) corresponding to two widely separated wave packets. Decoherence…
Although measurement and unitary processes can accomplish any quantum evolution in principle, thinking in terms of dissipation and damping can be powerful. We propose a modification of Grover's algorithm in which the idea of damping plays a…