{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1995:Q4QFHMUDM4HTXZJCQNRKOS5MVH","short_pith_number":"pith:Q4QFHMUD","schema_version":"1.0","canonical_sha256":"872053b283670f3be5228362a74baca9dc642f7dd7870d81eba3697306407283","source":{"kind":"arxiv","id":"quant-ph/9503007","version":1},"attestation_state":"computed","paper":{"title":"Quantum Computers, Factoring, and Decoherence","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"I. Chuang, P. Shor, Raymond Laflamme, W. Zurek","submitted_at":"1995-03-08T16:39:04Z","abstract_excerpt":"In a quantum computer any superposition of inputs evolves unitarily into the corresponding superposition of outputs. It has been recently demonstrated that such computers can dramatically speed up the task of finding factors of large numbers -- a problem of great practical significance because of its cryptographic applications. Instead of the nearly exponential ($\\sim \\exp L^{1/3}$, for a number with $L$ digits) time required by the fastest classical algorithm, the quantum algorithm gives factors in a time polynomial in $L$ ($\\sim L^2$). This enormous speed-up is possible in principle because "},"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/9503007","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1995-03-08T16:39:04Z","cross_cats_sorted":[],"title_canon_sha256":"3e05af71823033ddc60f7915c013906539f01cf0bac5883384d2e816f16349ff","abstract_canon_sha256":"614767a19230d35eeb738b5020926429ee0ba9ad2bcd3291e94c7343adad5bc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:02.229067Z","signature_b64":"kDsA2gJAA1sASuYhwgevnZ1Q67OQSKlNT/bTCzMNc3WWaIPe9JWFf8AafBYpwmImxD94pOaXs2NpSsKtlFt4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"872053b283670f3be5228362a74baca9dc642f7dd7870d81eba3697306407283","last_reissued_at":"2026-05-18T01:05:02.228355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:02.228355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Computers, Factoring, and Decoherence","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"I. Chuang, P. Shor, Raymond Laflamme, W. Zurek","submitted_at":"1995-03-08T16:39:04Z","abstract_excerpt":"In a quantum computer any superposition of inputs evolves unitarily into the corresponding superposition of outputs. It has been recently demonstrated that such computers can dramatically speed up the task of finding factors of large numbers -- a problem of great practical significance because of its cryptographic applications. Instead of the nearly exponential ($\\sim \\exp L^{1/3}$, for a number with $L$ digits) time required by the fastest classical algorithm, the quantum algorithm gives factors in a time polynomial in $L$ ($\\sim L^2$). This enormous speed-up is possible in principle because "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9503007","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":"quant-ph/9503007","created_at":"2026-05-18T01:05:02.228463+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9503007v1","created_at":"2026-05-18T01:05:02.228463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9503007","created_at":"2026-05-18T01:05:02.228463+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4QFHMUDM4HT","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4QFHMUDM4HTXZJC","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4QFHMUD","created_at":"2026-05-18T12:25:47.700082+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/Q4QFHMUDM4HTXZJCQNRKOS5MVH","json":"https://pith.science/pith/Q4QFHMUDM4HTXZJCQNRKOS5MVH.json","graph_json":"https://pith.science/api/pith-number/Q4QFHMUDM4HTXZJCQNRKOS5MVH/graph.json","events_json":"https://pith.science/api/pith-number/Q4QFHMUDM4HTXZJCQNRKOS5MVH/events.json","paper":"https://pith.science/paper/Q4QFHMUD"},"agent_actions":{"view_html":"https://pith.science/pith/Q4QFHMUDM4HTXZJCQNRKOS5MVH","download_json":"https://pith.science/pith/Q4QFHMUDM4HTXZJCQNRKOS5MVH.json","view_paper":"https://pith.science/paper/Q4QFHMUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9503007&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4QFHMUDM4HTXZJCQNRKOS5MVH/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4QFHMUDM4HTXZJCQNRKOS5MVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4QFHMUDM4HTXZJCQNRKOS5MVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4QFHMUDM4HTXZJCQNRKOS5MVH/action/storage_attestation","attest_author":"https://pith.science/pith/Q4QFHMUDM4HTXZJCQNRKOS5MVH/action/author_attestation","sign_citation":"https://pith.science/pith/Q4QFHMUDM4HTXZJCQNRKOS5MVH/action/citation_signature","submit_replication":"https://pith.science/pith/Q4QFHMUDM4HTXZJCQNRKOS5MVH/action/replication_record"}},"created_at":"2026-05-18T01:05:02.228463+00:00","updated_at":"2026-05-18T01:05:02.228463+00:00"}