{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PA5CXN2UBGLOF7I7BL5QGYSROS","short_pith_number":"pith:PA5CXN2U","schema_version":"1.0","canonical_sha256":"783a2bb7540996e2fd1f0afb03625174872ba9af7fc0c7506d271322c8e18d73","source":{"kind":"arxiv","id":"1908.04232","version":2},"attestation_state":"computed","paper":{"title":"Span Programs and Quantum Space Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Stacey Jeffery","submitted_at":"2019-08-12T16:32:33Z","abstract_excerpt":"While quantum computers hold the promise of significant computational speedups, the limited size of early quantum machines motivates the study of space-bounded quantum computation. We relate the quantum space complexity of computing a function f with one-sided error to the logarithm of its span program size, a classical quantity that is well-studied in attempts to prove formula size lower bounds.\n  In the more natural bounded error model, we show that the amount of space needed for a unitary quantum algorithm to compute f with bounded (two-sided) error is lower bounded by the logarithm of its "},"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.04232","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-12T16:32:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"fc8f82e33e923c24b301cd22ba14d51f6f6b1e7f0ff155a88fa03847b4041d9e","abstract_canon_sha256":"aa9ef404207a2cbc1f5670df928779a07cecf893f39ccd794c399c142cbd75ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:27.723150Z","signature_b64":"W0zxWvQjqGbgKyTzhcCMrh7h+TH4XwkOBl/sIb6A9teHyMHuabmh6DidDb6OOHL/yHVliB2YEO8VxkG/7pCqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"783a2bb7540996e2fd1f0afb03625174872ba9af7fc0c7506d271322c8e18d73","last_reissued_at":"2026-07-05T00:00:27.722678Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:27.722678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Span Programs and Quantum Space Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Stacey Jeffery","submitted_at":"2019-08-12T16:32:33Z","abstract_excerpt":"While quantum computers hold the promise of significant computational speedups, the limited size of early quantum machines motivates the study of space-bounded quantum computation. We relate the quantum space complexity of computing a function f with one-sided error to the logarithm of its span program size, a classical quantity that is well-studied in attempts to prove formula size lower bounds.\n  In the more natural bounded error model, we show that the amount of space needed for a unitary quantum algorithm to compute f with bounded (two-sided) error is lower bounded by the logarithm of its "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04232","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04232/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.04232","created_at":"2026-07-05T00:00:27.722735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04232v2","created_at":"2026-07-05T00:00:27.722735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04232","created_at":"2026-07-05T00:00:27.722735+00:00"},{"alias_kind":"pith_short_12","alias_value":"PA5CXN2UBGLO","created_at":"2026-07-05T00:00:27.722735+00:00"},{"alias_kind":"pith_short_16","alias_value":"PA5CXN2UBGLOF7I7","created_at":"2026-07-05T00:00:27.722735+00:00"},{"alias_kind":"pith_short_8","alias_value":"PA5CXN2U","created_at":"2026-07-05T00:00:27.722735+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/PA5CXN2UBGLOF7I7BL5QGYSROS","json":"https://pith.science/pith/PA5CXN2UBGLOF7I7BL5QGYSROS.json","graph_json":"https://pith.science/api/pith-number/PA5CXN2UBGLOF7I7BL5QGYSROS/graph.json","events_json":"https://pith.science/api/pith-number/PA5CXN2UBGLOF7I7BL5QGYSROS/events.json","paper":"https://pith.science/paper/PA5CXN2U"},"agent_actions":{"view_html":"https://pith.science/pith/PA5CXN2UBGLOF7I7BL5QGYSROS","download_json":"https://pith.science/pith/PA5CXN2UBGLOF7I7BL5QGYSROS.json","view_paper":"https://pith.science/paper/PA5CXN2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04232&json=true","fetch_graph":"https://pith.science/api/pith-number/PA5CXN2UBGLOF7I7BL5QGYSROS/graph.json","fetch_events":"https://pith.science/api/pith-number/PA5CXN2UBGLOF7I7BL5QGYSROS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PA5CXN2UBGLOF7I7BL5QGYSROS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PA5CXN2UBGLOF7I7BL5QGYSROS/action/storage_attestation","attest_author":"https://pith.science/pith/PA5CXN2UBGLOF7I7BL5QGYSROS/action/author_attestation","sign_citation":"https://pith.science/pith/PA5CXN2UBGLOF7I7BL5QGYSROS/action/citation_signature","submit_replication":"https://pith.science/pith/PA5CXN2UBGLOF7I7BL5QGYSROS/action/replication_record"}},"created_at":"2026-07-05T00:00:27.722735+00:00","updated_at":"2026-07-05T00:00:27.722735+00:00"}