{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NGQOYYCJEUOQQSHN33INRRB56R","short_pith_number":"pith:NGQOYYCJ","schema_version":"1.0","canonical_sha256":"69a0ec6049251d0848edded0d8c43df45e193402f7290a3f250bb93a2d477b9f","source":{"kind":"arxiv","id":"1710.05867","version":4},"attestation_state":"computed","paper":{"title":"Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Edgar Solomonik, Edwin Pednault, Eric T. Holland, Erik W. Draeger, Giacomo Nannicini, John A. Gunnels, Lior Horesh, Robert Wisnieff, Thomas Magerlein","submitted_at":"2017-10-16T17:00:59Z","abstract_excerpt":"With the current rate of progress in quantum computing technologies, systems with more than 50 qubits will soon become reality. Computing ideal quantum state amplitudes for circuits of such and larger sizes is a fundamental step to assess both the correctness, performance, and scaling behavior of quantum algorithms and the fidelities of quantum devices. However, resource requirements for such calculations on classical computers grow exponentially. We show that deferring tensor contractions can extend the boundaries of what can be computed on classical systems. To demonstrate this technique, we"},"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":"1710.05867","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-16T17:00:59Z","cross_cats_sorted":[],"title_canon_sha256":"93932085fda430ec9ce98b780105e25f4fcf1963204f621dbaf3623f1e2426e8","abstract_canon_sha256":"59d1e1104454b43fdfce2b9f1d266b0c2580018185648558f745bfd468b88bd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:30:47.830252Z","signature_b64":"hb8rpPUPl7XmgmxowHfK1yjsrc9m8ozc0alMyPOOY4lCEr/x0WcAPg1hqXCFVZCXOV1J1esjZgf6cpitdPRvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69a0ec6049251d0848edded0d8c43df45e193402f7290a3f250bb93a2d477b9f","last_reissued_at":"2026-07-05T01:30:47.829832Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:30:47.829832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Edgar Solomonik, Edwin Pednault, Eric T. Holland, Erik W. Draeger, Giacomo Nannicini, John A. Gunnels, Lior Horesh, Robert Wisnieff, Thomas Magerlein","submitted_at":"2017-10-16T17:00:59Z","abstract_excerpt":"With the current rate of progress in quantum computing technologies, systems with more than 50 qubits will soon become reality. Computing ideal quantum state amplitudes for circuits of such and larger sizes is a fundamental step to assess both the correctness, performance, and scaling behavior of quantum algorithms and the fidelities of quantum devices. However, resource requirements for such calculations on classical computers grow exponentially. We show that deferring tensor contractions can extend the boundaries of what can be computed on classical systems. To demonstrate this technique, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05867","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1710.05867/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":"1710.05867","created_at":"2026-07-05T01:30:47.829890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05867v4","created_at":"2026-07-05T01:30:47.829890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05867","created_at":"2026-07-05T01:30:47.829890+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGQOYYCJEUOQ","created_at":"2026-07-05T01:30:47.829890+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGQOYYCJEUOQQSHN","created_at":"2026-07-05T01:30:47.829890+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGQOYYCJ","created_at":"2026-07-05T01:30:47.829890+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.05030","citing_title":"Many-Body Physics and Quantum Simulations with Strongly Interacting Photons","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03816","citing_title":"GPU-Accelerated Quantum Simulation: Empirical Backend Selection, Gate Fusion, and Adaptive Precision","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NGQOYYCJEUOQQSHN33INRRB56R","json":"https://pith.science/pith/NGQOYYCJEUOQQSHN33INRRB56R.json","graph_json":"https://pith.science/api/pith-number/NGQOYYCJEUOQQSHN33INRRB56R/graph.json","events_json":"https://pith.science/api/pith-number/NGQOYYCJEUOQQSHN33INRRB56R/events.json","paper":"https://pith.science/paper/NGQOYYCJ"},"agent_actions":{"view_html":"https://pith.science/pith/NGQOYYCJEUOQQSHN33INRRB56R","download_json":"https://pith.science/pith/NGQOYYCJEUOQQSHN33INRRB56R.json","view_paper":"https://pith.science/paper/NGQOYYCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05867&json=true","fetch_graph":"https://pith.science/api/pith-number/NGQOYYCJEUOQQSHN33INRRB56R/graph.json","fetch_events":"https://pith.science/api/pith-number/NGQOYYCJEUOQQSHN33INRRB56R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGQOYYCJEUOQQSHN33INRRB56R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGQOYYCJEUOQQSHN33INRRB56R/action/storage_attestation","attest_author":"https://pith.science/pith/NGQOYYCJEUOQQSHN33INRRB56R/action/author_attestation","sign_citation":"https://pith.science/pith/NGQOYYCJEUOQQSHN33INRRB56R/action/citation_signature","submit_replication":"https://pith.science/pith/NGQOYYCJEUOQQSHN33INRRB56R/action/replication_record"}},"created_at":"2026-07-05T01:30:47.829890+00:00","updated_at":"2026-07-05T01:30:47.829890+00:00"}