{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EQPFDXZTCFY6E5BZTWA54WIPK5","short_pith_number":"pith:EQPFDXZT","schema_version":"1.0","canonical_sha256":"241e51df331171e274399d81de590f5749c41709587a31b803da17a046063640","source":{"kind":"arxiv","id":"1908.04802","version":3},"attestation_state":"computed","paper":{"title":"Entanglement bounds on the performance of quantum computing architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhinav Deshpande, Alexey V. Gorshkov, Aniruddha Bapat, Frederic T. Chong, James R. Garrison, Leo Zhou, Zachary Eldredge","submitted_at":"2019-08-13T18:01:39Z","abstract_excerpt":"There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture can be difficult. In this paper, we show that a quantity known as the isoperimetric number establishes a lower bound on the time required to create highly entangled states. This metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We use this metric to eva"},"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":"1908.04802","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-13T18:01:39Z","cross_cats_sorted":[],"title_canon_sha256":"afec5d1b111129449bf1d0826e8f9bd9d685dcc3888330036f6654d1f02fbb29","abstract_canon_sha256":"d023d84dd928e2d4894174a02ee0e833918d912f7e64c401d38104efa30f1824"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:22.832455Z","signature_b64":"4O0yCKrGW/R3OZSLyiehp7g375K30krOL9cLyXsWe8yeI25X/lSpV8WNIb54zENtMfKLtFNOeo9INT7jsy6EBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"241e51df331171e274399d81de590f5749c41709587a31b803da17a046063640","last_reissued_at":"2026-07-05T01:37:22.832076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:22.832076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entanglement bounds on the performance of quantum computing architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhinav Deshpande, Alexey V. Gorshkov, Aniruddha Bapat, Frederic T. Chong, James R. Garrison, Leo Zhou, Zachary Eldredge","submitted_at":"2019-08-13T18:01:39Z","abstract_excerpt":"There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture can be difficult. In this paper, we show that a quantity known as the isoperimetric number establishes a lower bound on the time required to create highly entangled states. This metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We use this metric to eva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04802","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/1908.04802/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":"1908.04802","created_at":"2026-07-05T01:37:22.832131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04802v3","created_at":"2026-07-05T01:37:22.832131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04802","created_at":"2026-07-05T01:37:22.832131+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQPFDXZTCFY6","created_at":"2026-07-05T01:37:22.832131+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQPFDXZTCFY6E5BZ","created_at":"2026-07-05T01:37:22.832131+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQPFDXZT","created_at":"2026-07-05T01:37:22.832131+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQPFDXZTCFY6E5BZTWA54WIPK5","json":"https://pith.science/pith/EQPFDXZTCFY6E5BZTWA54WIPK5.json","graph_json":"https://pith.science/api/pith-number/EQPFDXZTCFY6E5BZTWA54WIPK5/graph.json","events_json":"https://pith.science/api/pith-number/EQPFDXZTCFY6E5BZTWA54WIPK5/events.json","paper":"https://pith.science/paper/EQPFDXZT"},"agent_actions":{"view_html":"https://pith.science/pith/EQPFDXZTCFY6E5BZTWA54WIPK5","download_json":"https://pith.science/pith/EQPFDXZTCFY6E5BZTWA54WIPK5.json","view_paper":"https://pith.science/paper/EQPFDXZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04802&json=true","fetch_graph":"https://pith.science/api/pith-number/EQPFDXZTCFY6E5BZTWA54WIPK5/graph.json","fetch_events":"https://pith.science/api/pith-number/EQPFDXZTCFY6E5BZTWA54WIPK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQPFDXZTCFY6E5BZTWA54WIPK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQPFDXZTCFY6E5BZTWA54WIPK5/action/storage_attestation","attest_author":"https://pith.science/pith/EQPFDXZTCFY6E5BZTWA54WIPK5/action/author_attestation","sign_citation":"https://pith.science/pith/EQPFDXZTCFY6E5BZTWA54WIPK5/action/citation_signature","submit_replication":"https://pith.science/pith/EQPFDXZTCFY6E5BZTWA54WIPK5/action/replication_record"}},"created_at":"2026-07-05T01:37:22.832131+00:00","updated_at":"2026-07-05T01:37:22.832131+00:00"}