Efficiency of open quantum walk implementation of dissipative quantum computing algorithms
From MaRDI portal
Publication:1757877
DOI10.1007/s11128-012-0426-3zbMath1258.81023arXiv1401.6658WikidataQ62390340 ScholiaQ62390340MaRDI QIDQ1757877
Francesco Petruccione, Yutaka Ilya Sinayskiy
Publication date: 7 November 2012
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.6658
81P68: Quantum computation
65T50: Numerical methods for discrete and fast Fourier transforms
82C41: Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics
81S22: Open systems, reduced dynamics, master equations, decoherence
68Q12: Quantum algorithms and complexity in the theory of computing
Related Items
Unnamed Item, Recurrence and Transience of Continuous-Time Open Quantum Walks, Quantum optical implementation of open quantum walks, Open quantum random walks: reducibility, period, ergodic properties, Open quantum random walks with decoherence on coins with \(n\) degrees of freedom, The quest for a quantum neural network, Homogeneous open quantum random walks on a lattice, Central limit theorem and large deviation principle for continuous time open quantum walks, A generalization of Schur functions: applications to Nevanlinna functions, orthogonal polynomials, random walks and unitary and open quantum walks, Absorption in invariant domains for semigroups of quantum channels, Mean hitting times of quantum Markov chains in terms of generalized inverses, On a generalized central limit theorem and large deviations for homogeneous open quantum walks, Quantum hidden Markov models based on transition operation matrices, Quantum walk and its application domains: a systematic review, Microscopic Derivation of Open Quantum Walk on Two-Node Graph
Cites Work