{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2DTXC67V6RXHWQZ4Q256M4ZHTQ","short_pith_number":"pith:2DTXC67V","schema_version":"1.0","canonical_sha256":"d0e7717bf5f46e7b433c86bbe673279c1587f22e1493e0dfd4fb0099a3c1a902","source":{"kind":"arxiv","id":"2211.06382","version":1},"attestation_state":"computed","paper":{"title":"Hardware optimized parity check gates for superconducting surface codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Rodriguez Perez, Eyob A. Sete, Matthew J. Reagor, Thomas C. Bohdanowicz, William J. Zeng","submitted_at":"2022-11-11T18:00:30Z","abstract_excerpt":"Error correcting codes use multi-qubit measurements to realize fault-tolerant quantum logic steps. In fact, the resources needed to scale-up fault-tolerant quantum computing hardware are largely set by this task. Tailoring next-generation processors for joint measurements, therefore, could result in improvements to speed, accuracy, or cost -- accelerating the development large-scale quantum computers. Here, we motivate such explorations by analyzing an unconventional surface code based on multi-body interactions between superconducting transmon qubits. Our central consideration, Hardware Optim"},"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":"2211.06382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-11-11T18:00:30Z","cross_cats_sorted":[],"title_canon_sha256":"6e0cdfe71665fc42a23756c96ec96531abbbdca43b0ffccad32e8a1fa77ae202","abstract_canon_sha256":"79b8d765d7fd703cf9289d4811e9c5483093520483fcac1afbbc2b867bae61ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:15:20.335920Z","signature_b64":"SKaQApuyP5p729I+Y1rBtDSswBQEHLMLvebQyCBQg6xZSrkPFMKSVFjyelgrm5PI7qjqkqltyxzPZfWWNGm/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0e7717bf5f46e7b433c86bbe673279c1587f22e1493e0dfd4fb0099a3c1a902","last_reissued_at":"2026-07-05T05:15:20.335441Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:15:20.335441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardware optimized parity check gates for superconducting surface codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Rodriguez Perez, Eyob A. Sete, Matthew J. Reagor, Thomas C. Bohdanowicz, William J. Zeng","submitted_at":"2022-11-11T18:00:30Z","abstract_excerpt":"Error correcting codes use multi-qubit measurements to realize fault-tolerant quantum logic steps. In fact, the resources needed to scale-up fault-tolerant quantum computing hardware are largely set by this task. Tailoring next-generation processors for joint measurements, therefore, could result in improvements to speed, accuracy, or cost -- accelerating the development large-scale quantum computers. Here, we motivate such explorations by analyzing an unconventional surface code based on multi-body interactions between superconducting transmon qubits. Our central consideration, Hardware Optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.06382","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/2211.06382/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":"2211.06382","created_at":"2026-07-05T05:15:20.335494+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.06382v1","created_at":"2026-07-05T05:15:20.335494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06382","created_at":"2026-07-05T05:15:20.335494+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DTXC67V6RXH","created_at":"2026-07-05T05:15:20.335494+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DTXC67V6RXHWQZ4","created_at":"2026-07-05T05:15:20.335494+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DTXC67V","created_at":"2026-07-05T05:15:20.335494+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14918","citing_title":"Short two-qubit pulse sequences for exchange-only spin qubits in 2D layouts","ref_index":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2DTXC67V6RXHWQZ4Q256M4ZHTQ","json":"https://pith.science/pith/2DTXC67V6RXHWQZ4Q256M4ZHTQ.json","graph_json":"https://pith.science/api/pith-number/2DTXC67V6RXHWQZ4Q256M4ZHTQ/graph.json","events_json":"https://pith.science/api/pith-number/2DTXC67V6RXHWQZ4Q256M4ZHTQ/events.json","paper":"https://pith.science/paper/2DTXC67V"},"agent_actions":{"view_html":"https://pith.science/pith/2DTXC67V6RXHWQZ4Q256M4ZHTQ","download_json":"https://pith.science/pith/2DTXC67V6RXHWQZ4Q256M4ZHTQ.json","view_paper":"https://pith.science/paper/2DTXC67V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.06382&json=true","fetch_graph":"https://pith.science/api/pith-number/2DTXC67V6RXHWQZ4Q256M4ZHTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/2DTXC67V6RXHWQZ4Q256M4ZHTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DTXC67V6RXHWQZ4Q256M4ZHTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DTXC67V6RXHWQZ4Q256M4ZHTQ/action/storage_attestation","attest_author":"https://pith.science/pith/2DTXC67V6RXHWQZ4Q256M4ZHTQ/action/author_attestation","sign_citation":"https://pith.science/pith/2DTXC67V6RXHWQZ4Q256M4ZHTQ/action/citation_signature","submit_replication":"https://pith.science/pith/2DTXC67V6RXHWQZ4Q256M4ZHTQ/action/replication_record"}},"created_at":"2026-07-05T05:15:20.335494+00:00","updated_at":"2026-07-05T05:15:20.335494+00:00"}