{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QAHRKTBHXDSQAJ64RBCGNDD6EL","short_pith_number":"pith:QAHRKTBH","schema_version":"1.0","canonical_sha256":"800f154c27b8e50027dc8844668c7e22de4424729cb38f27d49c9b97d8c10aa1","source":{"kind":"arxiv","id":"1503.05270","version":4},"attestation_state":"computed","paper":{"title":"Efficiently Controllable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Can Gokler, Kevin Thompson, Peter Shor, Seth Lloyd","submitted_at":"2015-03-18T02:39:46Z","abstract_excerpt":"We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in the sense that universal quantum computation can be performed using a control sequence polynomial in the size of the network while controlling a vanishingly small fraction of subsystems. We show that networks corresponding to finite-dimensional lattices are efficently controllable, and explore generalizations to percolation clusters and random graphs. We show"},"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":"1503.05270","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-18T02:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"b8377de2b42a3a5b882ce2a72d644b9000a0a530cba209c089801b4cef8f69c7","abstract_canon_sha256":"ed2e09e1fee5d34bb7e5b87047984c7ec664a4bd79f0c15f8068bd71fea6bb51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:02.443231Z","signature_b64":"V8ArgME7QU40gcKvyv3I2pfBoXei5WBiHSIKa7uVCQk95zLw/Se6eT0QnPPdmgQc+nhc4b9HGdYik99Ta8tBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"800f154c27b8e50027dc8844668c7e22de4424729cb38f27d49c9b97d8c10aa1","last_reissued_at":"2026-05-18T00:41:02.442667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:02.442667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Controllable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Can Gokler, Kevin Thompson, Peter Shor, Seth Lloyd","submitted_at":"2015-03-18T02:39:46Z","abstract_excerpt":"We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in the sense that universal quantum computation can be performed using a control sequence polynomial in the size of the network while controlling a vanishingly small fraction of subsystems. We show that networks corresponding to finite-dimensional lattices are efficently controllable, and explore generalizations to percolation clusters and random graphs. We show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05270","kind":"arxiv","version":4},"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":"1503.05270","created_at":"2026-05-18T00:41:02.442766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05270v4","created_at":"2026-05-18T00:41:02.442766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05270","created_at":"2026-05-18T00:41:02.442766+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAHRKTBHXDSQ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAHRKTBHXDSQAJ64","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAHRKTBH","created_at":"2026-05-18T12:29:37.295048+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/QAHRKTBHXDSQAJ64RBCGNDD6EL","json":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL.json","graph_json":"https://pith.science/api/pith-number/QAHRKTBHXDSQAJ64RBCGNDD6EL/graph.json","events_json":"https://pith.science/api/pith-number/QAHRKTBHXDSQAJ64RBCGNDD6EL/events.json","paper":"https://pith.science/paper/QAHRKTBH"},"agent_actions":{"view_html":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL","download_json":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL.json","view_paper":"https://pith.science/paper/QAHRKTBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05270&json=true","fetch_graph":"https://pith.science/api/pith-number/QAHRKTBHXDSQAJ64RBCGNDD6EL/graph.json","fetch_events":"https://pith.science/api/pith-number/QAHRKTBHXDSQAJ64RBCGNDD6EL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/action/storage_attestation","attest_author":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/action/author_attestation","sign_citation":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/action/citation_signature","submit_replication":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/action/replication_record"}},"created_at":"2026-05-18T00:41:02.442766+00:00","updated_at":"2026-05-18T00:41:02.442766+00:00"}