{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2UYRB36TWVPFXMKEQSDFSKLAFO","short_pith_number":"pith:2UYRB36T","schema_version":"1.0","canonical_sha256":"d53110efd3b55e5bb14484865929602bacf9e9192b7fcc2dab203e06eaef7f06","source":{"kind":"arxiv","id":"1506.01396","version":1},"attestation_state":"computed","paper":{"title":"Trading classical and quantum computational resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Graeme Smith, John Smolin, Sergey Bravyi","submitted_at":"2015-06-03T20:34:48Z","abstract_excerpt":"We propose examples of a hybrid quantum-classical simulation where a classical computer assisted by a small quantum processor can efficiently simulate a larger quantum system. First we consider sparse quantum circuits such that each qubit participates in O(1) two-qubit gates. It is shown that any sparse circuit on n+k qubits can be simulated by sparse circuits on n qubits and a classical processing that takes time $2^{O(k)} poly(n)$. Secondly, we study Pauli-based computation (PBC) where allowed operations are non-destructive eigenvalue measurements of n-qubit Pauli operators. The computation "},"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":"1506.01396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-06-03T20:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"eb634d3b36b90c79c69267123bd92bc286fae9705c71b6394e2540e236901a92","abstract_canon_sha256":"80d4b67dc8218c276619a75216d949a259b2c2fdbc5f2e860ff660ad6236a080"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:33.571520Z","signature_b64":"MwigsKM2A7dork986pQXZtK7pVAp1kskEHx7psY4Abaz3HSfzNUZDHPaNiFZx71tWtQ8q5uazTluVB5taff5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d53110efd3b55e5bb14484865929602bacf9e9192b7fcc2dab203e06eaef7f06","last_reissued_at":"2026-05-18T01:11:33.571098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:33.571098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trading classical and quantum computational resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Graeme Smith, John Smolin, Sergey Bravyi","submitted_at":"2015-06-03T20:34:48Z","abstract_excerpt":"We propose examples of a hybrid quantum-classical simulation where a classical computer assisted by a small quantum processor can efficiently simulate a larger quantum system. First we consider sparse quantum circuits such that each qubit participates in O(1) two-qubit gates. It is shown that any sparse circuit on n+k qubits can be simulated by sparse circuits on n qubits and a classical processing that takes time $2^{O(k)} poly(n)$. Secondly, we study Pauli-based computation (PBC) where allowed operations are non-destructive eigenvalue measurements of n-qubit Pauli operators. The computation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01396","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":""},"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":"1506.01396","created_at":"2026-05-18T01:11:33.571158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01396v1","created_at":"2026-05-18T01:11:33.571158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01396","created_at":"2026-05-18T01:11:33.571158+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UYRB36TWVPF","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UYRB36TWVPFXMKE","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UYRB36T","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.08841","citing_title":"Universal Non-stabilizerness Dynamics Across Quantum Phase Transitions","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14271","citing_title":"Magic and Non-Clifford Gates in Topological Quantum Field Theory","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2UYRB36TWVPFXMKEQSDFSKLAFO","json":"https://pith.science/pith/2UYRB36TWVPFXMKEQSDFSKLAFO.json","graph_json":"https://pith.science/api/pith-number/2UYRB36TWVPFXMKEQSDFSKLAFO/graph.json","events_json":"https://pith.science/api/pith-number/2UYRB36TWVPFXMKEQSDFSKLAFO/events.json","paper":"https://pith.science/paper/2UYRB36T"},"agent_actions":{"view_html":"https://pith.science/pith/2UYRB36TWVPFXMKEQSDFSKLAFO","download_json":"https://pith.science/pith/2UYRB36TWVPFXMKEQSDFSKLAFO.json","view_paper":"https://pith.science/paper/2UYRB36T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01396&json=true","fetch_graph":"https://pith.science/api/pith-number/2UYRB36TWVPFXMKEQSDFSKLAFO/graph.json","fetch_events":"https://pith.science/api/pith-number/2UYRB36TWVPFXMKEQSDFSKLAFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UYRB36TWVPFXMKEQSDFSKLAFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UYRB36TWVPFXMKEQSDFSKLAFO/action/storage_attestation","attest_author":"https://pith.science/pith/2UYRB36TWVPFXMKEQSDFSKLAFO/action/author_attestation","sign_citation":"https://pith.science/pith/2UYRB36TWVPFXMKEQSDFSKLAFO/action/citation_signature","submit_replication":"https://pith.science/pith/2UYRB36TWVPFXMKEQSDFSKLAFO/action/replication_record"}},"created_at":"2026-05-18T01:11:33.571158+00:00","updated_at":"2026-05-18T01:11:33.571158+00:00"}