{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:W4STAXVCSUFZ2JNKLQ3SS5AVWN","short_pith_number":"pith:W4STAXVC","schema_version":"1.0","canonical_sha256":"b725305ea2950b9d25aa5c37297415b35c2de0617fcb3cdc0d5043b715eb9579","source":{"kind":"arxiv","id":"1105.4032","version":1},"attestation_state":"computed","paper":{"title":"A quantum no-reflection theorem and the speeding up of Grover's search algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"G. S. Paraoanu, Karthikeyan S. Kumar","submitted_at":"2011-05-20T08:40:51Z","abstract_excerpt":"We prove that it is impossible to built a universal quantum machine that produces reflections about an unknown state. We then point out a connection between this result and the optimality of Grover's search algorithm: if such reflection machines were available, it would be possible to accelerate Grover's search algorithm to exponential speedups."},"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":"1105.4032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-05-20T08:40:51Z","cross_cats_sorted":[],"title_canon_sha256":"0e159db4422378ef19bb20804046e68ce18c4b19c46620fcaa8d910d19bbf7f4","abstract_canon_sha256":"80dfa32a47c48a5787dcd7a34807406128a29fc2e84b97229592da4a47c26a8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:50.133897Z","signature_b64":"CfebAPkiYc6pfs+EngThvKNtHd0N9FE4/bzH/S1Wjzjk7XyFjwo684NcYG9yuC1DiD5Qdoat4ww1z71ygxvKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b725305ea2950b9d25aa5c37297415b35c2de0617fcb3cdc0d5043b715eb9579","last_reissued_at":"2026-05-18T04:21:50.133272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:50.133272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantum no-reflection theorem and the speeding up of Grover's search algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"G. S. Paraoanu, Karthikeyan S. Kumar","submitted_at":"2011-05-20T08:40:51Z","abstract_excerpt":"We prove that it is impossible to built a universal quantum machine that produces reflections about an unknown state. We then point out a connection between this result and the optimality of Grover's search algorithm: if such reflection machines were available, it would be possible to accelerate Grover's search algorithm to exponential speedups."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4032","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":"1105.4032","created_at":"2026-05-18T04:21:50.133389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4032v1","created_at":"2026-05-18T04:21:50.133389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4032","created_at":"2026-05-18T04:21:50.133389+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4STAXVCSUFZ","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4STAXVCSUFZ2JNK","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4STAXVC","created_at":"2026-05-18T12:26:44.992195+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/W4STAXVCSUFZ2JNKLQ3SS5AVWN","json":"https://pith.science/pith/W4STAXVCSUFZ2JNKLQ3SS5AVWN.json","graph_json":"https://pith.science/api/pith-number/W4STAXVCSUFZ2JNKLQ3SS5AVWN/graph.json","events_json":"https://pith.science/api/pith-number/W4STAXVCSUFZ2JNKLQ3SS5AVWN/events.json","paper":"https://pith.science/paper/W4STAXVC"},"agent_actions":{"view_html":"https://pith.science/pith/W4STAXVCSUFZ2JNKLQ3SS5AVWN","download_json":"https://pith.science/pith/W4STAXVCSUFZ2JNKLQ3SS5AVWN.json","view_paper":"https://pith.science/paper/W4STAXVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4032&json=true","fetch_graph":"https://pith.science/api/pith-number/W4STAXVCSUFZ2JNKLQ3SS5AVWN/graph.json","fetch_events":"https://pith.science/api/pith-number/W4STAXVCSUFZ2JNKLQ3SS5AVWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4STAXVCSUFZ2JNKLQ3SS5AVWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4STAXVCSUFZ2JNKLQ3SS5AVWN/action/storage_attestation","attest_author":"https://pith.science/pith/W4STAXVCSUFZ2JNKLQ3SS5AVWN/action/author_attestation","sign_citation":"https://pith.science/pith/W4STAXVCSUFZ2JNKLQ3SS5AVWN/action/citation_signature","submit_replication":"https://pith.science/pith/W4STAXVCSUFZ2JNKLQ3SS5AVWN/action/replication_record"}},"created_at":"2026-05-18T04:21:50.133389+00:00","updated_at":"2026-05-18T04:21:50.133389+00:00"}