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.
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Publishing Group
2017-12-01
|
| Series: | Nature Communications |
| Online Access: | https://doi.org/10.1038/s41467-017-01904-7 |
| id |
doaj-ee3d918527fd45aab807cb68ef2a18aa |
|---|---|
| record_format |
Article |
| spelling |
doaj-ee3d918527fd45aab807cb68ef2a18aa2021-05-11T07:24:34ZengNature Publishing GroupNature Communications2041-17232017-12-01811910.1038/s41467-017-01904-7Complete 3-Qubit Grover search on a programmable quantum computerC. Figgatt0D. Maslov1K. A. Landsman2N. M. Linke3S. Debnath4C. Monroe5Joint Quantum Institute, Department of Physics, Joint Center for Quantum Information and Computer Science, University of MarylandJoint Quantum Institute, Department of Physics, Joint Center for Quantum Information and Computer Science, University of MarylandJoint Quantum Institute, Department of Physics, Joint Center for Quantum Information and Computer Science, University of MarylandJoint Quantum Institute, Department of Physics, Joint Center for Quantum Information and Computer Science, University of MarylandJoint Quantum Institute, Department of Physics, Joint Center for Quantum Information and Computer Science, University of MarylandJoint Quantum Institute, Department of Physics, Joint Center for Quantum Information and Computer Science, University of MarylandGrover’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.https://doi.org/10.1038/s41467-017-01904-7 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
C. Figgatt D. Maslov K. A. Landsman N. M. Linke S. Debnath C. Monroe |
| spellingShingle |
C. Figgatt D. Maslov K. A. Landsman N. M. Linke S. Debnath C. Monroe Complete 3-Qubit Grover search on a programmable quantum computer Nature Communications |
| author_facet |
C. Figgatt D. Maslov K. A. Landsman N. M. Linke S. Debnath C. Monroe |
| author_sort |
C. Figgatt |
| title |
Complete 3-Qubit Grover search on a programmable quantum computer |
| title_short |
Complete 3-Qubit Grover search on a programmable quantum computer |
| title_full |
Complete 3-Qubit Grover search on a programmable quantum computer |
| title_fullStr |
Complete 3-Qubit Grover search on a programmable quantum computer |
| title_full_unstemmed |
Complete 3-Qubit Grover search on a programmable quantum computer |
| title_sort |
complete 3-qubit grover search on a programmable quantum computer |
| publisher |
Nature Publishing Group |
| series |
Nature Communications |
| issn |
2041-1723 |
| publishDate |
2017-12-01 |
| description |
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. |
| url |
https://doi.org/10.1038/s41467-017-01904-7 |
| work_keys_str_mv |
AT cfiggatt complete3qubitgroversearchonaprogrammablequantumcomputer AT dmaslov complete3qubitgroversearchonaprogrammablequantumcomputer AT kalandsman complete3qubitgroversearchonaprogrammablequantumcomputer AT nmlinke complete3qubitgroversearchonaprogrammablequantumcomputer AT sdebnath complete3qubitgroversearchonaprogrammablequantumcomputer AT cmonroe complete3qubitgroversearchonaprogrammablequantumcomputer |
| _version_ |
1721452306528993280 |