Related papers: Dissipative decoherence in the Grover algorithm
We study the dynamics of bosonic atoms in a double well potential under the influence of dissipation. The main effect of dissipation is to destroy quantum coherence and to drive the system towards a unique steady state. We study how the…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
A Quantum Computer is a new type of computer which can solve problems such as factoring and database search very efficiently. The usefulness of a quantum computer is limited by the effect of two different types of errors, decoherence and…
It is commonly stated that decoherence in open quantum systems is due to growing entanglement with an environment. In practice, however, surprisingly often decoherence may equally well be described by random unitary dynamics without…
Different approaches in quantifying environmentally-induced decoherence are considered. We identify a measure of decoherence, derived from the density matrix of the system of interest, that quantifies the environmentally induced error,…
The problem investigated in this paper is einselection, i. e. the selection of mutually exclusive quantum states with definite probabilities through decoherence. Its study is based on a theory of decoherence resulting from the projection…
Grover's quantum search algorithm can be formulated as a quantum particle randomly walking on the (highly symmetric) complete graph, with one vertex marked by a nonzero potential. From an initial equal superposition, the state evolves in a…
Minimizing the effect of decoherence on a quantum register must be a central part of any strategy to realize scalable quantum information processing. Apart from the strength of the coupling to the environment, the decoherence rate is…
In the Grover-type quantum search process a search operator is iteratively applied, say, k times, on the initial database state. We present an additive decomposition scheme such that the iteration process is expressed, in the computational…
In this work, we investigate the dynamics of quantum correlations captured by entropic and geometric measures of discord under the influence of dissipative channels for widely used two qubit X state with maximally mixed marginals.…
The interaction between solid-state qubits and their environmental degrees of freedom produces non-unitary effects like decoherence and dissipation. Uncontrolled decoherence is one of the main obstacles that must be overcome in quantum…
Distributed quantum computation has garnered immense attention in the noisy intermediate-scale quantum (NISQ) era, where each computational node necessitates fewer qubits and quantum gates. In this paper, we focus on a generalized search…
The Grover search algorithm is a pivotal advancement in quantum computing, promising a remarkable speedup over classical algorithms in searching unstructured large databases. Here, we report results for the implementation and…
We investigate the influence of dissipation and decoherence on quantum Darwinism by generalizing Zurek's original qubit model of decoherence and the establishment of pointer states (Zurek, Nature Physics 5, 181 - 188 (2009)). Our model…
This paper researches how the systematic errors in phase inversions affect the success rate and the number of iterations in optimized quantum random-walk search algorithm. Through geometric description of this algorithm, the model of the…
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The…
This paper presented two general quantum search algorithms. We derived the iterated formulas and the simpler approximate formulas and the precise formula for the amplitude in the desired state. A mathematical proof of Grover's algorithm…
A quantum computer encodes information in quantum states and runs quantum algorithms to surpass the classical counterparts by exploiting quantum superposition and quantum correlation. Grover's quantum search algorithm is a typical quantum…
We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our…
Coherence plays a very important role in Grover search algorithm (GSA). In this paper, we define the normalization coherence N(C), where C is a coherence measurement. In virtue of the constraint of large N and Shannon's maximum entropy…