Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , , , , , , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909167913009152 |
|---|---|
| author | Mayer, Karl Ryan-Anderson, Ciarán Brown, Natalie Durso-Sabina, Elijah Baldwin, Charles H. Hayes, David Dreiling, Joan M. Foltz, Cameron Gaebler, John P. Gatterman, Thomas M. Gerber, Justin A. Gilmore, Kevin Gresh, Dan Hewitt, Nathan Horst, Chandler V. Johansen, Jacob Mengle, Tanner Mills, Michael Moses, Steven A. Siegfried, Peter E. Neyenhuis, Brian Pino, Juan Stutz, Russell |
| author_facet | Mayer, Karl Ryan-Anderson, Ciarán Brown, Natalie Durso-Sabina, Elijah Baldwin, Charles H. Hayes, David Dreiling, Joan M. Foltz, Cameron Gaebler, John P. Gatterman, Thomas M. Gerber, Justin A. Gilmore, Kevin Gresh, Dan Hewitt, Nathan Horst, Chandler V. Johansen, Jacob Mengle, Tanner Mills, Michael Moses, Steven A. Siegfried, Peter E. Neyenhuis, Brian Pino, Juan Stutz, Russell |
| contents | We implement logically encoded three-qubit circuits for the quantum Fourier transform (QFT), using the [[7,1,3]] Steane code, and benchmark the circuits on the Quantinuum H2-1 trapped-ion quantum computer. The circuits require multiple logical two-qubit gates, which are implemented transversally, as well as logical non-Clifford single-qubit rotations, which are performed by non-fault-tolerant state preparation followed by a teleportation gadget. First, we benchmark individual logical components using randomized benchmarking for the logical two-qubit gate, and a Ramsey-type experiment for the logical $T$ gate. We then implement the full QFT circuit, using two different methods for performing a logical control-$T$, and benchmark the circuits by applying it to each basis state in a set of bases that is sufficient to lower bound the process fidelity. We compare the logical QFT benchmark results to predictions based on the logical component benchmarks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_08616 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer Mayer, Karl Ryan-Anderson, Ciarán Brown, Natalie Durso-Sabina, Elijah Baldwin, Charles H. Hayes, David Dreiling, Joan M. Foltz, Cameron Gaebler, John P. Gatterman, Thomas M. Gerber, Justin A. Gilmore, Kevin Gresh, Dan Hewitt, Nathan Horst, Chandler V. Johansen, Jacob Mengle, Tanner Mills, Michael Moses, Steven A. Siegfried, Peter E. Neyenhuis, Brian Pino, Juan Stutz, Russell Quantum Physics We implement logically encoded three-qubit circuits for the quantum Fourier transform (QFT), using the [[7,1,3]] Steane code, and benchmark the circuits on the Quantinuum H2-1 trapped-ion quantum computer. The circuits require multiple logical two-qubit gates, which are implemented transversally, as well as logical non-Clifford single-qubit rotations, which are performed by non-fault-tolerant state preparation followed by a teleportation gadget. First, we benchmark individual logical components using randomized benchmarking for the logical two-qubit gate, and a Ramsey-type experiment for the logical $T$ gate. We then implement the full QFT circuit, using two different methods for performing a logical control-$T$, and benchmark the circuits by applying it to each basis state in a set of bases that is sufficient to lower bound the process fidelity. We compare the logical QFT benchmark results to predictions based on the logical component benchmarks. |
| title | Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2404.08616 |