arXiv Analytics

Sign in

arXiv:1301.1801 [quant-ph]AbstractReferencesReviewsResources

Open Quantum Systems and Quantum Algorithms

Stefano Bonzio, Paola Verrucchi

Published 2013-01-09, updated 2015-12-23Version 2

The model of open quantum systems is adopted to describe the non-local dynamical behaviour of qubits processed by entangling gates. The analysis gets to the conclusion that a distinction between evaluation steps and task-oriented computing steps is justified only within classical computation. In fact, the use of entangling gates permits to reduce two steps (evaluation and calculation) to a single computational one, and this determines an effective computational speed-up. The application of the open quantum systems model suggests that the reduction to one-computational step is strongly related to the existence of Universal Dynamical Maps describing the evolution of component systems of two-qubits gates. As the description in terms of Universal Dynamical Map is possible only in the presence of a separable initial state, it turns out that the internal reduced dynamics with respect to entangling gates is neither unitary nor Markovian. The fact imposes a holistic vision on the structure of the algorithm, where the entangling gates shall remain indivisible unities, or black boxes, in order to preserve computational speed as well as reversibility. This fact suggests to adopt a perspective on computation which is completely non-classical: the whole algorithm turns out not to be the sequence of its temporal parts.

Related articles: Most relevant | Search more
arXiv:quant-ph/9903061 (Published 1999-03-17)
On Quantum Algorithms
arXiv:1005.1318 [quant-ph] (Published 2010-05-08, updated 2010-10-11)
On the Efficiency of Quantum Algorithms for Hamiltonian Simulation
arXiv:0906.1811 [quant-ph] (Published 2009-06-09, updated 2009-07-29)
Quantum algorithms know in advance 50% of the solution they will find in the future