Quantum walks are stochastic processes generated by a quantum evolution mechanism, allowing for speed-up in spreading and hitting-time performance with respect to their classical counterparts. Investigating the role of the memory effects for these models, we address the problem of finding the minimal linear system that exactly reproduces the evolution of the output distribution of a quantum walk. After adapting the classical approach to our setting, we investigate analytically and numerically the structural complexity of quantum walks, both in general and in particular examples. Lastly, we focus on Grover’s algorithm, a quantum computing search algorithm that can be re-framed as a quantum walk, showing that it allows for a dramatic reduction in its representation.
Minimal resources for exact simulation of quantum walks
Grigoletto, Tommaso
;Ticozzi, Francesco
2022
Abstract
Quantum walks are stochastic processes generated by a quantum evolution mechanism, allowing for speed-up in spreading and hitting-time performance with respect to their classical counterparts. Investigating the role of the memory effects for these models, we address the problem of finding the minimal linear system that exactly reproduces the evolution of the output distribution of a quantum walk. After adapting the classical approach to our setting, we investigate analytically and numerically the structural complexity of quantum walks, both in general and in particular examples. Lastly, we focus on Grover’s algorithm, a quantum computing search algorithm that can be re-framed as a quantum walk, showing that it allows for a dramatic reduction in its representation.File | Dimensione | Formato | |
---|---|---|---|
Minimal_resources_for_exact_simulation_of_quantum_walks.pdf
Accesso riservato
Tipologia:
Published (publisher's version)
Licenza:
Accesso privato - non pubblico
Dimensione
996.63 kB
Formato
Adobe PDF
|
996.63 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.