{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5NM33MWDLOGRYNTMYBFSC4PDPA","short_pith_number":"pith:5NM33MWD","schema_version":"1.0","canonical_sha256":"eb59bdb2c35b8d1c366cc04b2171e3782a99bb25fb140fa0afb29392c239076a","source":{"kind":"arxiv","id":"1805.09337","version":2},"attestation_state":"computed","paper":{"title":"Variationally Learning Grover's Quantum Search Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jacob Biamonte, Mauro E.S. Morales, Timur Tlyachev","submitted_at":"2018-05-23T18:00:03Z","abstract_excerpt":"Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm recover these settings and hence learn Grover's algorithm? We studied several constrained variations of this problem and answered this question in the affirmative, with some caveats. Grover's quantum search algorithm is optimal up to a constant. The success probability of Grover's algorithm goes from unity for two-qubits, decreases for three- and four-qubits and returns near unity for five-qubits then oscillates ever-"},"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":"1805.09337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-23T18:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"55533c1276b3cc66a6d234f8bcf42ddef9a0fca4b9bcb2217cbbc6d3f1695104","abstract_canon_sha256":"028cf5410bad9de5e38dc8e73d8e00de64a8231bfd4356f72e99a676c39bd6b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:10.319805Z","signature_b64":"XX8GXTHRK1o6A0jzl6emkoih7IgcD5tOOc31Pnp3sT5hLypqU44CI5RtAQEodQURz0oqHlN2fsOTaH6VoPH0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb59bdb2c35b8d1c366cc04b2171e3782a99bb25fb140fa0afb29392c239076a","last_reissued_at":"2026-05-17T23:57:10.319375Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:10.319375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variationally Learning Grover's Quantum Search Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jacob Biamonte, Mauro E.S. Morales, Timur Tlyachev","submitted_at":"2018-05-23T18:00:03Z","abstract_excerpt":"Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm recover these settings and hence learn Grover's algorithm? We studied several constrained variations of this problem and answered this question in the affirmative, with some caveats. Grover's quantum search algorithm is optimal up to a constant. The success probability of Grover's algorithm goes from unity for two-qubits, decreases for three- and four-qubits and returns near unity for five-qubits then oscillates ever-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09337","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":""},"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":"1805.09337","created_at":"2026-05-17T23:57:10.319448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09337v2","created_at":"2026-05-17T23:57:10.319448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09337","created_at":"2026-05-17T23:57:10.319448+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NM33MWDLOGR","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NM33MWDLOGRYNTM","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NM33MWD","created_at":"2026-05-18T12:32:08.215937+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/5NM33MWDLOGRYNTMYBFSC4PDPA","json":"https://pith.science/pith/5NM33MWDLOGRYNTMYBFSC4PDPA.json","graph_json":"https://pith.science/api/pith-number/5NM33MWDLOGRYNTMYBFSC4PDPA/graph.json","events_json":"https://pith.science/api/pith-number/5NM33MWDLOGRYNTMYBFSC4PDPA/events.json","paper":"https://pith.science/paper/5NM33MWD"},"agent_actions":{"view_html":"https://pith.science/pith/5NM33MWDLOGRYNTMYBFSC4PDPA","download_json":"https://pith.science/pith/5NM33MWDLOGRYNTMYBFSC4PDPA.json","view_paper":"https://pith.science/paper/5NM33MWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09337&json=true","fetch_graph":"https://pith.science/api/pith-number/5NM33MWDLOGRYNTMYBFSC4PDPA/graph.json","fetch_events":"https://pith.science/api/pith-number/5NM33MWDLOGRYNTMYBFSC4PDPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NM33MWDLOGRYNTMYBFSC4PDPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NM33MWDLOGRYNTMYBFSC4PDPA/action/storage_attestation","attest_author":"https://pith.science/pith/5NM33MWDLOGRYNTMYBFSC4PDPA/action/author_attestation","sign_citation":"https://pith.science/pith/5NM33MWDLOGRYNTMYBFSC4PDPA/action/citation_signature","submit_replication":"https://pith.science/pith/5NM33MWDLOGRYNTMYBFSC4PDPA/action/replication_record"}},"created_at":"2026-05-17T23:57:10.319448+00:00","updated_at":"2026-05-17T23:57:10.319448+00:00"}