{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EZAQNWOCQVVN2O5FBRXRWO2JI6","short_pith_number":"pith:EZAQNWOC","schema_version":"1.0","canonical_sha256":"264106d9c2856add3ba50c6f1b3b4947b81d4e5a89c5e2187eda99567369aac7","source":{"kind":"arxiv","id":"2404.08616","version":1},"attestation_state":"computed","paper":{"title":"Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Brian Neyenhuis, Cameron Foltz, Chandler V. Horst, Charles H. Baldwin, Ciar\\'an Ryan-Anderson, Dan Gresh, David Hayes, Elijah Durso-Sabina, Jacob Johansen, Joan M. Dreiling, John P. Gaebler, Juan Pino, Justin A. Gerber, Karl Mayer, Kevin Gilmore, Michael Mills, Natalie Brown, Nathan Hewitt, Peter E. Siegfried, Russell Stutz, Steven A. Moses, Tanner Mengle, Thomas M. Gatterman","submitted_at":"2024-04-12T17:27:27Z","abstract_excerpt":"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 l"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2404.08616","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-12T17:27:27Z","cross_cats_sorted":[],"title_canon_sha256":"b037366da77304e56cc57f43b64c55f0dd978be24c9f1f7f0a0c955183078b7a","abstract_canon_sha256":"74f9c24e0c338f32df51ebd9debae0945cee8b449babb861ea003f7733996092"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:24.304571Z","signature_b64":"TRerTfnsfVgmYCBSZaE5KDlQu6XiBmTr+5r+X7RoU6OD6myGB2Q/Mt5LARmeP2s7s0+kz+7fpDGYEV/3m7sXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"264106d9c2856add3ba50c6f1b3b4947b81d4e5a89c5e2187eda99567369aac7","last_reissued_at":"2026-07-05T08:07:24.304142Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:24.304142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Brian Neyenhuis, Cameron Foltz, Chandler V. Horst, Charles H. Baldwin, Ciar\\'an Ryan-Anderson, Dan Gresh, David Hayes, Elijah Durso-Sabina, Jacob Johansen, Joan M. Dreiling, John P. Gaebler, Juan Pino, Justin A. Gerber, Karl Mayer, Kevin Gilmore, Michael Mills, Natalie Brown, Nathan Hewitt, Peter E. Siegfried, Russell Stutz, Steven A. Moses, Tanner Mengle, Thomas M. Gatterman","submitted_at":"2024-04-12T17:27:27Z","abstract_excerpt":"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 l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08616","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.08616/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.08616","created_at":"2026-07-05T08:07:24.304198+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.08616v1","created_at":"2026-07-05T08:07:24.304198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08616","created_at":"2026-07-05T08:07:24.304198+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZAQNWOCQVVN","created_at":"2026-07-05T08:07:24.304198+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZAQNWOCQVVN2O5F","created_at":"2026-07-05T08:07:24.304198+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZAQNWOC","created_at":"2026-07-05T08:07:24.304198+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21468","citing_title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2606.17709","citing_title":"Optimizing bias-tailored quantum error correction beyond code-capacity noise","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29674","citing_title":"Error-corrected phase estimation averaged over variable grids on a trapped-ion quantum computer: hyperacuity spectra of a CO molecule adsorbed onto $\\chi$-Fe$_5$C$_2$","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2408.14828","citing_title":"Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2505.09133","citing_title":"Quantum Error-Corrected Computation of Molecular Energies","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2506.11385","citing_title":"High-speed and high-connectivity two-qubit gates in long chains of trapped ions","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2506.16113","citing_title":"Fully convolutional 3D neural network decoders for surface codes with syndrome circuit noise","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06101","citing_title":"Syndrome resampling enhances quantum error correction thresholds","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21472","citing_title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EZAQNWOCQVVN2O5FBRXRWO2JI6","json":"https://pith.science/pith/EZAQNWOCQVVN2O5FBRXRWO2JI6.json","graph_json":"https://pith.science/api/pith-number/EZAQNWOCQVVN2O5FBRXRWO2JI6/graph.json","events_json":"https://pith.science/api/pith-number/EZAQNWOCQVVN2O5FBRXRWO2JI6/events.json","paper":"https://pith.science/paper/EZAQNWOC"},"agent_actions":{"view_html":"https://pith.science/pith/EZAQNWOCQVVN2O5FBRXRWO2JI6","download_json":"https://pith.science/pith/EZAQNWOCQVVN2O5FBRXRWO2JI6.json","view_paper":"https://pith.science/paper/EZAQNWOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.08616&json=true","fetch_graph":"https://pith.science/api/pith-number/EZAQNWOCQVVN2O5FBRXRWO2JI6/graph.json","fetch_events":"https://pith.science/api/pith-number/EZAQNWOCQVVN2O5FBRXRWO2JI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZAQNWOCQVVN2O5FBRXRWO2JI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZAQNWOCQVVN2O5FBRXRWO2JI6/action/storage_attestation","attest_author":"https://pith.science/pith/EZAQNWOCQVVN2O5FBRXRWO2JI6/action/author_attestation","sign_citation":"https://pith.science/pith/EZAQNWOCQVVN2O5FBRXRWO2JI6/action/citation_signature","submit_replication":"https://pith.science/pith/EZAQNWOCQVVN2O5FBRXRWO2JI6/action/replication_record"}},"created_at":"2026-07-05T08:07:24.304198+00:00","updated_at":"2026-07-05T08:07:24.304198+00:00"}