Complete 3-Qubit Grover search on a programmable quantum computer
Grover’s algorithm provides a quantum speedup when searching through an unsorted database. Here, the authors perform it on 3 qubits using trapped ions, demonstrating two methods for marking the correct result in the algorithm’s oracle and providing data for searches yielding 1 or 2 solutions.
Guardado en:
Autores principales: | C. Figgatt, D. Maslov, K. A. Landsman, N. M. Linke, S. Debnath, C. Monroe |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Nature Portfolio
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/ee3d918527fd45aab807cb68ef2a18aa |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Benchmarking an 11-qubit quantum computer
por: K. Wright, et al.
Publicado: (2019) -
Privacy-preserving Quantum Sealed-bid Auction Based on Grover’s Search Algorithm
por: Run-hua Shi, et al.
Publicado: (2019) -
Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer
por: C. Huerta Alderete, et al.
Publicado: (2020) -
Quantifying computational advantage of Grover’s algorithm with the trace speed
por: Valentin Gebhart, et al.
Publicado: (2021) -
Error suppression in adiabatic quantum computing with qubit ensembles
por: Naeimeh Mohseni, et al.
Publicado: (2021)