{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:4K5GO4HDZDETTWX7F6NO5DSH2Q","short_pith_number":"pith:4K5GO4HD","schema_version":"1.0","canonical_sha256":"e2ba6770e3c8c939daff2f9aee8e47d403a96ff79bb0e67306cd11361afbf1e7","source":{"kind":"arxiv","id":"quant-ph/0301063","version":2},"attestation_state":"computed","paper":{"title":"Efficient classical simulation of slightly entangled quantum computations","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guifre Vidal","submitted_at":"2003-01-15T04:35:35Z","abstract_excerpt":"We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted. The evolution of a pure state of n qubits can be simulated by using computational resources that grow linearly in n and exponentially in the entanglement. We show that a pure-state quantum computation can only yield an exponential speed-up with respect to classical computations if the entanglement increases with the size n of the computation, and gives a lower"},"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":"quant-ph/0301063","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-01-15T04:35:35Z","cross_cats_sorted":[],"title_canon_sha256":"ef5939b903c9baacb3b600c0e8d3d3a2dbd2df9a1d5680bb640b9b2d783820c2","abstract_canon_sha256":"4870e77a188f7fd491297cb52535917f4b60ce270dbb40a3854199400dbdb562"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:04.155254Z","signature_b64":"LowBWFCLHs65bFogRhyF17K532e16iYZk882j3eRJYFbhF7e8oMKHPJgfMBoQ0vqWgQqku0Ldw/2ti5uC6p5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2ba6770e3c8c939daff2f9aee8e47d403a96ff79bb0e67306cd11361afbf1e7","last_reissued_at":"2026-05-18T01:05:04.154574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:04.154574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient classical simulation of slightly entangled quantum computations","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guifre Vidal","submitted_at":"2003-01-15T04:35:35Z","abstract_excerpt":"We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted. The evolution of a pure state of n qubits can be simulated by using computational resources that grow linearly in n and exponentially in the entanglement. We show that a pure-state quantum computation can only yield an exponential speed-up with respect to classical computations if the entanglement increases with the size n of the computation, and gives a lower"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0301063","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":"quant-ph/0301063","created_at":"2026-05-18T01:05:04.154679+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0301063v2","created_at":"2026-05-18T01:05:04.154679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0301063","created_at":"2026-05-18T01:05:04.154679+00:00"},{"alias_kind":"pith_short_12","alias_value":"4K5GO4HDZDET","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"4K5GO4HDZDETTWX7","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"4K5GO4HD","created_at":"2026-05-18T12:25:51.375804+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":7,"sample":[{"citing_arxiv_id":"2603.08841","citing_title":"Universal Non-stabilizerness Dynamics Across Quantum Phase Transitions","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08224","citing_title":"The one clean qubit model without entanglement is classically simulable","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21457","citing_title":"An Exponential Sample-Complexity Advantage for Coherent Quantum Inference","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20331","citing_title":"Bowtie VarQTE: A Resource-Efficient Quantum State Preparation Primitive","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2507.08080","citing_title":"Diagonal Isometric Form for Tensor Product States in Two Dimensions","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":63,"is_internal_anchor":true},{"citing_arxiv_id":"2509.25821","citing_title":"On the Complexity of the Succinct State Local Hamiltonian Problem","ref_index":59,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4K5GO4HDZDETTWX7F6NO5DSH2Q","json":"https://pith.science/pith/4K5GO4HDZDETTWX7F6NO5DSH2Q.json","graph_json":"https://pith.science/api/pith-number/4K5GO4HDZDETTWX7F6NO5DSH2Q/graph.json","events_json":"https://pith.science/api/pith-number/4K5GO4HDZDETTWX7F6NO5DSH2Q/events.json","paper":"https://pith.science/paper/4K5GO4HD"},"agent_actions":{"view_html":"https://pith.science/pith/4K5GO4HDZDETTWX7F6NO5DSH2Q","download_json":"https://pith.science/pith/4K5GO4HDZDETTWX7F6NO5DSH2Q.json","view_paper":"https://pith.science/paper/4K5GO4HD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0301063&json=true","fetch_graph":"https://pith.science/api/pith-number/4K5GO4HDZDETTWX7F6NO5DSH2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/4K5GO4HDZDETTWX7F6NO5DSH2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4K5GO4HDZDETTWX7F6NO5DSH2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4K5GO4HDZDETTWX7F6NO5DSH2Q/action/storage_attestation","attest_author":"https://pith.science/pith/4K5GO4HDZDETTWX7F6NO5DSH2Q/action/author_attestation","sign_citation":"https://pith.science/pith/4K5GO4HDZDETTWX7F6NO5DSH2Q/action/citation_signature","submit_replication":"https://pith.science/pith/4K5GO4HDZDETTWX7F6NO5DSH2Q/action/replication_record"}},"created_at":"2026-05-18T01:05:04.154679+00:00","updated_at":"2026-05-18T01:05:04.154679+00:00"}