{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AT5BVNECMLVAEJ22KBWZ2D75KW","short_pith_number":"pith:AT5BVNEC","schema_version":"1.0","canonical_sha256":"04fa1ab48262ea02275a506d9d0ffd55bbc7d5b6bf6d96eadbd0895bccbe3939","source":{"kind":"arxiv","id":"2102.13071","version":1},"attestation_state":"computed","paper":{"title":"Logical-qubit operations in an error-detecting surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.supr-con"],"primary_cat":"quant-ph","authors_text":"A. Bruno, B. M. Terhal, B. M. Varbanov, C. Zachariadis, F. Battistel, H. Ali, J. F. Marques, L. DiCarlo, M. Beekman, M. S. Moreira, N. Haider, N. Muthusubramanian, W. Vlothuizen","submitted_at":"2021-02-25T18:40:02Z","abstract_excerpt":"We realize a suite of logical operations on a distance-two logical qubit stabilized using repeated error detection cycles. Logical operations include initialization into arbitrary states, measurement in the cardinal bases of the Bloch sphere, and a universal set of single-qubit gates. For each type of operation, we observe higher performance for fault-tolerant variants over non-fault-tolerant variants, and quantify the difference through detailed characterization. In particular, we demonstrate process tomography of logical gates, using the notion of a logical Pauli transfer matrix. This integr"},"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":"2102.13071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-02-25T18:40:02Z","cross_cats_sorted":["cond-mat.supr-con"],"title_canon_sha256":"0c872b483fc4108582436efacd5df06c5f11ca46f284c707c5ea873e20da76be","abstract_canon_sha256":"601537135a82f758d6803a488beb7d30b5561bd608bca30c8372738d681b86c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:31.283803Z","signature_b64":"P4vlICDF03tK6L4f3BWFT+e6s/InYQpNjScUu1jQV/z4Y6xLgfxr+UGdVKvR++uozPIpcy6gnasMA8zEuJr+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04fa1ab48262ea02275a506d9d0ffd55bbc7d5b6bf6d96eadbd0895bccbe3939","last_reissued_at":"2026-07-05T05:59:31.283369Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:31.283369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logical-qubit operations in an error-detecting surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.supr-con"],"primary_cat":"quant-ph","authors_text":"A. Bruno, B. M. Terhal, B. M. Varbanov, C. Zachariadis, F. Battistel, H. Ali, J. F. Marques, L. DiCarlo, M. Beekman, M. S. Moreira, N. Haider, N. Muthusubramanian, W. Vlothuizen","submitted_at":"2021-02-25T18:40:02Z","abstract_excerpt":"We realize a suite of logical operations on a distance-two logical qubit stabilized using repeated error detection cycles. Logical operations include initialization into arbitrary states, measurement in the cardinal bases of the Bloch sphere, and a universal set of single-qubit gates. For each type of operation, we observe higher performance for fault-tolerant variants over non-fault-tolerant variants, and quantify the difference through detailed characterization. In particular, we demonstrate process tomography of logical gates, using the notion of a logical Pauli transfer matrix. This integr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.13071","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/2102.13071/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":"2102.13071","created_at":"2026-07-05T05:59:31.283427+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.13071v1","created_at":"2026-07-05T05:59:31.283427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.13071","created_at":"2026-07-05T05:59:31.283427+00:00"},{"alias_kind":"pith_short_12","alias_value":"AT5BVNECMLVA","created_at":"2026-07-05T05:59:31.283427+00:00"},{"alias_kind":"pith_short_16","alias_value":"AT5BVNECMLVAEJ22","created_at":"2026-07-05T05:59:31.283427+00:00"},{"alias_kind":"pith_short_8","alias_value":"AT5BVNEC","created_at":"2026-07-05T05:59:31.283427+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AT5BVNECMLVAEJ22KBWZ2D75KW","json":"https://pith.science/pith/AT5BVNECMLVAEJ22KBWZ2D75KW.json","graph_json":"https://pith.science/api/pith-number/AT5BVNECMLVAEJ22KBWZ2D75KW/graph.json","events_json":"https://pith.science/api/pith-number/AT5BVNECMLVAEJ22KBWZ2D75KW/events.json","paper":"https://pith.science/paper/AT5BVNEC"},"agent_actions":{"view_html":"https://pith.science/pith/AT5BVNECMLVAEJ22KBWZ2D75KW","download_json":"https://pith.science/pith/AT5BVNECMLVAEJ22KBWZ2D75KW.json","view_paper":"https://pith.science/paper/AT5BVNEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.13071&json=true","fetch_graph":"https://pith.science/api/pith-number/AT5BVNECMLVAEJ22KBWZ2D75KW/graph.json","fetch_events":"https://pith.science/api/pith-number/AT5BVNECMLVAEJ22KBWZ2D75KW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AT5BVNECMLVAEJ22KBWZ2D75KW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AT5BVNECMLVAEJ22KBWZ2D75KW/action/storage_attestation","attest_author":"https://pith.science/pith/AT5BVNECMLVAEJ22KBWZ2D75KW/action/author_attestation","sign_citation":"https://pith.science/pith/AT5BVNECMLVAEJ22KBWZ2D75KW/action/citation_signature","submit_replication":"https://pith.science/pith/AT5BVNECMLVAEJ22KBWZ2D75KW/action/replication_record"}},"created_at":"2026-07-05T05:59:31.283427+00:00","updated_at":"2026-07-05T05:59:31.283427+00:00"}