{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UCH4N6VQNHPHPYHCE5DMCMNGRB","short_pith_number":"pith:UCH4N6VQ","schema_version":"1.0","canonical_sha256":"a08fc6fab069de77e0e22746c131a6887abaa518dc630c9f1dd185ae60f5bd23","source":{"kind":"arxiv","id":"2111.12654","version":3},"attestation_state":"computed","paper":{"title":"Demonstration of fault-tolerant universal quantum gate operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christian D. Marciniak, Ivan Pogorelov, Lukas Postler, Manuel Rispler, Markus M\\\"uller, Martin Ringbauer, Michael Meth, Philipp Schindler, Rainer Blatt, Roman Stricker, Sascha Heu{\\ss}en, Thomas Feldker, Thomas Monz","submitted_at":"2021-11-24T17:34:14Z","abstract_excerpt":"Quantum computers can be protected from noise by encoding the logical quantum information redundantly into multiple qubits using error correcting codes. When manipulating the logical quantum states, it is imperative that errors caused by imperfect operations do not spread uncontrollably through the quantum register. This requires that all operations on the quantum register obey a fault-tolerant circuit design which, in general, increases the complexity of the implementation. Here, we demonstrate a fault-tolerant universal set of gates on two logical qubits in a trapped-ion quantum computer. In"},"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":"2111.12654","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-11-24T17:34:14Z","cross_cats_sorted":[],"title_canon_sha256":"8d97f5fa1a17d6feb3fbf066ba833b9b5ed52070f04ac07eeb2371fc474fd57e","abstract_canon_sha256":"9ca12c3785f737ab80af5e77d108a71cb0feb0032d5e285abf0e08a4aa7e103f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:26.931850Z","signature_b64":"DIPDuYVbAP7a6VvZYJZ77uxNm7/u3+nexilrRJ7hRwBvOjIel6rWB2NerAF4xFWJ4CEQruzCsnzQ7syPQ3XRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a08fc6fab069de77e0e22746c131a6887abaa518dc630c9f1dd185ae60f5bd23","last_reissued_at":"2026-07-05T05:12:26.931386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:26.931386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Demonstration of fault-tolerant universal quantum gate operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christian D. Marciniak, Ivan Pogorelov, Lukas Postler, Manuel Rispler, Markus M\\\"uller, Martin Ringbauer, Michael Meth, Philipp Schindler, Rainer Blatt, Roman Stricker, Sascha Heu{\\ss}en, Thomas Feldker, Thomas Monz","submitted_at":"2021-11-24T17:34:14Z","abstract_excerpt":"Quantum computers can be protected from noise by encoding the logical quantum information redundantly into multiple qubits using error correcting codes. When manipulating the logical quantum states, it is imperative that errors caused by imperfect operations do not spread uncontrollably through the quantum register. This requires that all operations on the quantum register obey a fault-tolerant circuit design which, in general, increases the complexity of the implementation. Here, we demonstrate a fault-tolerant universal set of gates on two logical qubits in a trapped-ion quantum computer. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12654","kind":"arxiv","version":3},"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/2111.12654/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":"2111.12654","created_at":"2026-07-05T05:12:26.931454+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.12654v3","created_at":"2026-07-05T05:12:26.931454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12654","created_at":"2026-07-05T05:12:26.931454+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCH4N6VQNHPH","created_at":"2026-07-05T05:12:26.931454+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCH4N6VQNHPHPYHC","created_at":"2026-07-05T05:12:26.931454+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCH4N6VQ","created_at":"2026-07-05T05:12:26.931454+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.02280","citing_title":"Demonstration of logical qubits and repeated error correction with better-than-physical error rates","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UCH4N6VQNHPHPYHCE5DMCMNGRB","json":"https://pith.science/pith/UCH4N6VQNHPHPYHCE5DMCMNGRB.json","graph_json":"https://pith.science/api/pith-number/UCH4N6VQNHPHPYHCE5DMCMNGRB/graph.json","events_json":"https://pith.science/api/pith-number/UCH4N6VQNHPHPYHCE5DMCMNGRB/events.json","paper":"https://pith.science/paper/UCH4N6VQ"},"agent_actions":{"view_html":"https://pith.science/pith/UCH4N6VQNHPHPYHCE5DMCMNGRB","download_json":"https://pith.science/pith/UCH4N6VQNHPHPYHCE5DMCMNGRB.json","view_paper":"https://pith.science/paper/UCH4N6VQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.12654&json=true","fetch_graph":"https://pith.science/api/pith-number/UCH4N6VQNHPHPYHCE5DMCMNGRB/graph.json","fetch_events":"https://pith.science/api/pith-number/UCH4N6VQNHPHPYHCE5DMCMNGRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCH4N6VQNHPHPYHCE5DMCMNGRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCH4N6VQNHPHPYHCE5DMCMNGRB/action/storage_attestation","attest_author":"https://pith.science/pith/UCH4N6VQNHPHPYHCE5DMCMNGRB/action/author_attestation","sign_citation":"https://pith.science/pith/UCH4N6VQNHPHPYHCE5DMCMNGRB/action/citation_signature","submit_replication":"https://pith.science/pith/UCH4N6VQNHPHPYHCE5DMCMNGRB/action/replication_record"}},"created_at":"2026-07-05T05:12:26.931454+00:00","updated_at":"2026-07-05T05:12:26.931454+00:00"}