{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7ZKUOTYFOUF52QDIKLJBAQPGD4","short_pith_number":"pith:7ZKUOTYF","schema_version":"1.0","canonical_sha256":"fe55474f05750bdd406852d21041e61f2c95af375e788e3e46fb23dd056631be","source":{"kind":"arxiv","id":"1610.01920","version":5},"attestation_state":"computed","paper":{"title":"Optimal Separation in Exact Query Complexities for Simon's Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Guangya Cai","submitted_at":"2016-10-06T16:08:35Z","abstract_excerpt":"Simon's problem is one of the most important problems demonstrating the power of quantum computers, which achieves a large separation between quantum and classical query complexities. However, Simon's discussion on his problem was limited to bounded-error setting, which means his algorithm can not always get the correct answer. Exact quantum algorithms for Simon's problem have also been proposed, which deterministically solve the problem with O(n) queries. Also the quantum lower bound \\Omega(n) for Simon's problem is known. Although these algorithms are either complicated or specialized, their"},"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":"1610.01920","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-06T16:08:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3d7102b2198099756d0ae73784c941bc16606c66e886ec13d2a7a9165290fb75","abstract_canon_sha256":"bbb64d73d1e0a6d926f9d5a7cf6ec2e737a04f372090501bdacd52a61b511c0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:30.013113Z","signature_b64":"71C+5yMK/l7UY0Y5TmGWrwNIbKxZlVF5bJsRLDv7N1r7uzyuFpwI/enATSolFG9ld8RR0cMJb1XcbZZAGqHvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe55474f05750bdd406852d21041e61f2c95af375e788e3e46fb23dd056631be","last_reissued_at":"2026-05-18T00:53:30.012708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:30.012708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Separation in Exact Query Complexities for Simon's Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Guangya Cai","submitted_at":"2016-10-06T16:08:35Z","abstract_excerpt":"Simon's problem is one of the most important problems demonstrating the power of quantum computers, which achieves a large separation between quantum and classical query complexities. However, Simon's discussion on his problem was limited to bounded-error setting, which means his algorithm can not always get the correct answer. Exact quantum algorithms for Simon's problem have also been proposed, which deterministically solve the problem with O(n) queries. Also the quantum lower bound \\Omega(n) for Simon's problem is known. Although these algorithms are either complicated or specialized, their"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01920","kind":"arxiv","version":5},"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":"1610.01920","created_at":"2026-05-18T00:53:30.012772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01920v5","created_at":"2026-05-18T00:53:30.012772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01920","created_at":"2026-05-18T00:53:30.012772+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZKUOTYFOUF5","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZKUOTYFOUF52QDI","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZKUOTYF","created_at":"2026-05-18T12:30:04.600751+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/7ZKUOTYFOUF52QDIKLJBAQPGD4","json":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4.json","graph_json":"https://pith.science/api/pith-number/7ZKUOTYFOUF52QDIKLJBAQPGD4/graph.json","events_json":"https://pith.science/api/pith-number/7ZKUOTYFOUF52QDIKLJBAQPGD4/events.json","paper":"https://pith.science/paper/7ZKUOTYF"},"agent_actions":{"view_html":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4","download_json":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4.json","view_paper":"https://pith.science/paper/7ZKUOTYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01920&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZKUOTYFOUF52QDIKLJBAQPGD4/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZKUOTYFOUF52QDIKLJBAQPGD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/action/storage_attestation","attest_author":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/action/author_attestation","sign_citation":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/action/citation_signature","submit_replication":"https://pith.science/pith/7ZKUOTYFOUF52QDIKLJBAQPGD4/action/replication_record"}},"created_at":"2026-05-18T00:53:30.012772+00:00","updated_at":"2026-05-18T00:53:30.012772+00:00"}