{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NVN5R5FPGAGIVAVDZMQO4QMVFY","short_pith_number":"pith:NVN5R5FP","schema_version":"1.0","canonical_sha256":"6d5bd8f4af300c8a82a3cb20ee41952e07f06f2760aec74e783f5e71e0007972","source":{"kind":"arxiv","id":"1902.08117","version":2},"attestation_state":"computed","paper":{"title":"Time versus Hardware: Reducing Qubit Counts with a (Surface Code) Data Bus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexandru Paler, Daniel Herr, Franco Nori, Simon J. Devitt","submitted_at":"2019-02-21T16:14:55Z","abstract_excerpt":"We introduce a data bus, for reducing the qubit counts within quantum computations (protected by surface codes). For general computations, an automated trade-off analysis (software tool and source code are open sourced and available online) is performed to determine to what degree qubit counts are reduced by the data bus: is the time penalty worth the qubit count reductions? We provide two examples where the qubit counts are convincingly reduced: 1) interaction of two surface code patches on NISQ machines with 28 and 68 qubits, and 2) very large-scale circuits with a structure similar to state"},"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":"1902.08117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-21T16:14:55Z","cross_cats_sorted":[],"title_canon_sha256":"234209facf88714822b957886d1d20b5b5cde138ada80ea0fa9b1348d1012798","abstract_canon_sha256":"d109c73845ffef0c822c5a889c9ce135e6d69accc9e296eed0be1de0ff635c63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:38.853598Z","signature_b64":"9ThOKUyxH+hCMib/rvbxn7B97rO2jJTxAGh1uBz/7bsgB6JEwRMvAmWyMdy7hpL46GRTLgH9ergvBLhUt65NAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d5bd8f4af300c8a82a3cb20ee41952e07f06f2760aec74e783f5e71e0007972","last_reissued_at":"2026-05-17T23:49:38.852961Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:38.852961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time versus Hardware: Reducing Qubit Counts with a (Surface Code) Data Bus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexandru Paler, Daniel Herr, Franco Nori, Simon J. Devitt","submitted_at":"2019-02-21T16:14:55Z","abstract_excerpt":"We introduce a data bus, for reducing the qubit counts within quantum computations (protected by surface codes). For general computations, an automated trade-off analysis (software tool and source code are open sourced and available online) is performed to determine to what degree qubit counts are reduced by the data bus: is the time penalty worth the qubit count reductions? We provide two examples where the qubit counts are convincingly reduced: 1) interaction of two surface code patches on NISQ machines with 28 and 68 qubits, and 2) very large-scale circuits with a structure similar to state"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08117","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1902.08117","created_at":"2026-05-17T23:49:38.853040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08117v2","created_at":"2026-05-17T23:49:38.853040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08117","created_at":"2026-05-17T23:49:38.853040+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVN5R5FPGAGI","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVN5R5FPGAGIVAVD","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVN5R5FP","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":114,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVN5R5FPGAGIVAVDZMQO4QMVFY","json":"https://pith.science/pith/NVN5R5FPGAGIVAVDZMQO4QMVFY.json","graph_json":"https://pith.science/api/pith-number/NVN5R5FPGAGIVAVDZMQO4QMVFY/graph.json","events_json":"https://pith.science/api/pith-number/NVN5R5FPGAGIVAVDZMQO4QMVFY/events.json","paper":"https://pith.science/paper/NVN5R5FP"},"agent_actions":{"view_html":"https://pith.science/pith/NVN5R5FPGAGIVAVDZMQO4QMVFY","download_json":"https://pith.science/pith/NVN5R5FPGAGIVAVDZMQO4QMVFY.json","view_paper":"https://pith.science/paper/NVN5R5FP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08117&json=true","fetch_graph":"https://pith.science/api/pith-number/NVN5R5FPGAGIVAVDZMQO4QMVFY/graph.json","fetch_events":"https://pith.science/api/pith-number/NVN5R5FPGAGIVAVDZMQO4QMVFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVN5R5FPGAGIVAVDZMQO4QMVFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVN5R5FPGAGIVAVDZMQO4QMVFY/action/storage_attestation","attest_author":"https://pith.science/pith/NVN5R5FPGAGIVAVDZMQO4QMVFY/action/author_attestation","sign_citation":"https://pith.science/pith/NVN5R5FPGAGIVAVDZMQO4QMVFY/action/citation_signature","submit_replication":"https://pith.science/pith/NVN5R5FPGAGIVAVDZMQO4QMVFY/action/replication_record"}},"created_at":"2026-05-17T23:49:38.853040+00:00","updated_at":"2026-05-17T23:49:38.853040+00:00"}