Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/1B906674-9CC9-4F39-AC4F-DB97A9ECBE4F | ||
| Year | 2016 | ||
| Type of Item | Peer-Reviewed Journal Publication | ||
| License |
|
||
| Bibliographic Citation | D. Ellinas and C. Konstandakis, "Parametric quantum search algorithm as quantum walk: a quantum simulation," Rep. Math. Phys., vol. 77, no. 1, pp. 105-128, Feb. 2016. doi: 10.1016/S0034-4877(16)30008-8 https://doi.org/10.1016/S0034-4877(16)30008-8 | ||
| Appears in Collections |
Parametric quantum search algorithm (PQSA) is a form of quantum search that results by relaxing the unitarity of the original algorithm. PQSA can naturally be cast in the form of quantum walk, by means of the formalism of oracle algebra. This is due to the fact that the completely positive trace preserving search map used by PQSA, admits a unitarization (unitary dilation) a la quantum walk, at the expense of introducing auxiliary quantum coin-qubit space. The ensuing QW describes a process of spiral motion, chosen to be driven by two unitary Kraus generators, generating planar rotations of Bloch vector around an axis. The quadratic acceleration of quantum search translates into an equivalent quadratic saving of the number of coin qubits in the QW analogue. The associated to QW model Hamiltonian operator is obtained and is shown to represent a multi-particle long-range interacting quantum system that simulates parametric search. Finally, the relation of PQSA-QW simulator to the QW search algorithm is elucidated.
Copyright © DIAS 2013
