{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/benchmarking-logical-three-qubit-quantum","title":"Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer","arxiv_id":"2404.08616","date":"2024-04-12","proceeding":null,"authors":["Karl Mayer","Ciarán Ryan-Anderson","Natalie Brown","Elijah Durso-Sabina","Charles H. Baldwin","David Hayes","Joan M. Dreiling","Cameron Foltz","John P. Gaebler","Thomas M. Gatterman","Justin A. Gerber","Kevin Gilmore","Dan Gresh","Nathan Hewitt","Chandler V. Horst","Jacob Johansen","Tanner Mengle","Michael Mills","Steven A. Moses","Peter E. Siegfried","Brian Neyenhuis","Juan Pino","Russell Stutz"],"abstract":"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.","url_abs":"https://arxiv.org/abs/2404.08616v1","url_pdf":"https://arxiv.org/pdf/2404.08616v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"benchmarking-logical-three-qubit-quantum","repo_url":"https://github.com/khmayer01/logical-qft-paper-data","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}