{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:5TF4SXHXTSATYJPRTFMYSYSDJM","short_pith_number":"pith:5TF4SXHX","schema_version":"1.0","canonical_sha256":"eccbc95cf79c813c25f199598962434b30fdc8a002e77a5f840a179ee0c41414","source":{"kind":"arxiv","id":"quant-ph/9704027","version":1},"attestation_state":"computed","paper":{"title":"An Exact Quantum Polynomial-Time Algorithm for Simon's Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gilles Brassard (Universite de Montreal), Peter Hoyer (Odense University)","submitted_at":"1997-04-14T23:15:05Z","abstract_excerpt":"We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the worst-case running time. This is achieved by generalizing both Simon's and Grover's algorithms and combining them in a novel way. It follows that there is a decision problem that can be solved in exact quant"},"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/9704027","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-04-14T23:15:05Z","cross_cats_sorted":[],"title_canon_sha256":"89e1abcf087c5fca253a7ad2a1707e31c6274f29f0b89ee327ea5875bcd679f0","abstract_canon_sha256":"7140d386dd56389e9ef69f52d536b16a37d4bb7a8b336470179b970b22bc9d44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:26.434246Z","signature_b64":"7tsRyH6AcgXoMv02u04WQtqrbsJ7RFqrB/iL9FdL6PHyxic/SMisWnvLq2xeIYT2Js/39g3wE6g3WQyYyfEOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eccbc95cf79c813c25f199598962434b30fdc8a002e77a5f840a179ee0c41414","last_reissued_at":"2026-05-18T00:53:26.433863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:26.433863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Exact Quantum Polynomial-Time Algorithm for Simon's Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gilles Brassard (Universite de Montreal), Peter Hoyer (Odense University)","submitted_at":"1997-04-14T23:15:05Z","abstract_excerpt":"We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the worst-case running time. This is achieved by generalizing both Simon's and Grover's algorithms and combining them in a novel way. It follows that there is a decision problem that can be solved in exact quant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9704027","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/9704027","created_at":"2026-05-18T00:53:26.433923+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9704027v1","created_at":"2026-05-18T00:53:26.433923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9704027","created_at":"2026-05-18T00:53:26.433923+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TF4SXHXTSAT","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TF4SXHXTSATYJPR","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TF4SXHX","created_at":"2026-05-18T12:25:48.327863+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/5TF4SXHXTSATYJPRTFMYSYSDJM","json":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM.json","graph_json":"https://pith.science/api/pith-number/5TF4SXHXTSATYJPRTFMYSYSDJM/graph.json","events_json":"https://pith.science/api/pith-number/5TF4SXHXTSATYJPRTFMYSYSDJM/events.json","paper":"https://pith.science/paper/5TF4SXHX"},"agent_actions":{"view_html":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM","download_json":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM.json","view_paper":"https://pith.science/paper/5TF4SXHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9704027&json=true","fetch_graph":"https://pith.science/api/pith-number/5TF4SXHXTSATYJPRTFMYSYSDJM/graph.json","fetch_events":"https://pith.science/api/pith-number/5TF4SXHXTSATYJPRTFMYSYSDJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/action/storage_attestation","attest_author":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/action/author_attestation","sign_citation":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/action/citation_signature","submit_replication":"https://pith.science/pith/5TF4SXHXTSATYJPRTFMYSYSDJM/action/replication_record"}},"created_at":"2026-05-18T00:53:26.433923+00:00","updated_at":"2026-05-18T00:53:26.433923+00:00"}