Coherence as resource in scattering quantum walk search on complete graph
Abstract We investigate the behavior of coherence in scattering quantum walk search on complete graph under the condition that the total number of vertices of the graph is significantly larger than the marked number of vertices we are searching, N ≫ v. We find that the consumption of coherence repre...
Guardado en:
Autores principales: | Yun-Long Su, Si-Yuan Liu, Xiao-Hui Wang, Heng Fan, Wen-Li Yang |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Nature Portfolio
2018
|
Materias: | |
Acceso en línea: | https://doaj.org/article/ba37c018f8834aca8409ae57da2155fa |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Complete 3-Qubit Grover search on a programmable quantum computer
por: C. Figgatt, et al.
Publicado: (2017) -
Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances
por: Ernesto Campos, et al.
Publicado: (2021) -
Efficient quantum walk on a quantum processor
por: Xiaogang Qiang, et al.
Publicado: (2016) -
Entangled state generation via quantum walks with multiple coins
por: Meng Li, et al.
Publicado: (2021) -
Searching for metastable particles using graph computing
por: Ashutosh V. Kotwal
Publicado: (2021)