6 resultados para Quantum algorithms


Relevância:

100.00% 100.00%

Publicador:

Resumo:

The speedup provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speedup are not yet completely understood and deserve further attention. In this context, the classical simulation of quantum algorithms is a useful tool that can help us in gaining insight. Starting from the study of general conditions for classical simulation, we highlight several important differences between two nonequivalent classes of quantum algorithms. We investigate their performance under realistic conditions by quantitatively studying their resilience with respect to static noise. This latter refers to errors affecting the initial preparation of the register used to run an algorithm. We also compare the evolution of the entanglement involved in the different computational processes.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

We address the effects of natural three-qubit interactions on the computational power of one-way quantum computation. A benefit of using more sophisticated entanglement structures is the ability to construct compact and economic simulations of quantum algorithms with limited resources. We show that the features of our study are embodied by suitably prepared optical lattices, where effective three-spin interactions have been theoretically demonstrated. We use this to provide a compact construction for the Toffoli gate. Information flow and two-qubit interactions are also outlined, together with a brief analysis of relevant sources of imperfection.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

Exploiting multidimensional quantum walks as feasible platforms for quantum computation and quantum simulation attracts constantly growing attention from a broad experimental physics community. Here, we propose a two-dimensional quantum walk scheme with a single-qubit coin that presents, in the considered regimes, a strong localizationlike effect on the walker. The result could provide new possible directions for the implementation of quantum algorithms or from the point of view of quantum simulation. We characterize the localizationlike effect in terms of the parameters of a step-dependent qubit operation that acts on the coin space after any standard coin operation, showing that a proper choice can guarantee a nonnegligible probability of finding the walker in the origin even for large times. We finally discuss the robustness to imperfections, a qualitative relation with coherences behavior, and possible experimental realizations of this model with the current state-of-the-art settings.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

We study the behaviour of the glued trees algorithm described by Childs et al. in [1] under decoherence. We consider a discrete time reformulation of the continuous time quantum walk protocol and apply a phase damping channel to the coin state, investigating the effect of such a mechanism on the probability of the walker appearing on the target vertex of the graph. We pay particular attention to any potential advantage coming from the use of weak decoherence for the spreading of the walk across the glued trees graph. © 2013 Elsevier B.V.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We discuss the quantum-circuit realization of the state of a nucleon in the scope of simple simmetry groups. Explicit algorithms are presented for the preparation of the state of a neutron or a proton as resulting from the composition of their quark constituents. We estimate the computational resources required for such a simulation and design a photonic network for its implementation. Moreover, we highlight that current work on three-body interactions in lattices of interacting qubits, combined with the measurement-based paradigm for quantum information processing, may also be suitable for the implementation of these nucleonic spin states.