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: | , , , , , |
|---|---|
| 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!
|
| Sumario: | 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. |
|---|