{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BSRCZ3XTLF6PXEMBAWUYNMMTHP","short_pith_number":"pith:BSRCZ3XT","schema_version":"1.0","canonical_sha256":"0ca22ceef3597cfb918105a986b1933bfc1f11a211c6ba924f7a6611bf92418b","source":{"kind":"arxiv","id":"2205.00117","version":1},"attestation_state":"computed","paper":{"title":"A Scalable 5,6-Qubit Grover's Quantum Search Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.ET"],"primary_cat":"quant-ph","authors_text":"Attila Cangi, Debanjan Konar, Dinesh Reddy Vemula, Sri Mounica Kalidasu, Sudeep Satheesan","submitted_at":"2022-04-30T00:35:54Z","abstract_excerpt":"Recent studies have been spurred on by the promise of advanced quantum computing technology, which has led to the development of quantum computer simulations on classical hardware. Grover's quantum search algorithm is one of the well-known applications of quantum computing, enabling quantum computers to perform a database search (unsorted array) and quadratically outperform their classical counterparts in terms of time. Given the restricted access to database search for an oracle model (black-box), researchers have demonstrated various implementations of Grover's circuit for two to four qubits"},"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":"2205.00117","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2022-04-30T00:35:54Z","cross_cats_sorted":["cs.AI","cs.DS","cs.ET"],"title_canon_sha256":"0da0d4b16bf9001ca4c65cb7be01f2e0d984347dd562c328a059cf04a052a159","abstract_canon_sha256":"e201b221be6e53b07229ea623af4283f932614d6b72af42863080ce2635fa38a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:19:09.794120Z","signature_b64":"w6gTD+oe7SM/lQf4frzFb1Q/zPmpBUnhIMzWpawfLotWHzH06z7ZbvNk85lTmvMReILBRCG+8qu/eARiXGbfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ca22ceef3597cfb918105a986b1933bfc1f11a211c6ba924f7a6611bf92418b","last_reissued_at":"2026-07-05T04:19:09.793743Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:19:09.793743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Scalable 5,6-Qubit Grover's Quantum Search Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.ET"],"primary_cat":"quant-ph","authors_text":"Attila Cangi, Debanjan Konar, Dinesh Reddy Vemula, Sri Mounica Kalidasu, Sudeep Satheesan","submitted_at":"2022-04-30T00:35:54Z","abstract_excerpt":"Recent studies have been spurred on by the promise of advanced quantum computing technology, which has led to the development of quantum computer simulations on classical hardware. Grover's quantum search algorithm is one of the well-known applications of quantum computing, enabling quantum computers to perform a database search (unsorted array) and quadratically outperform their classical counterparts in terms of time. Given the restricted access to database search for an oracle model (black-box), researchers have demonstrated various implementations of Grover's circuit for two to four qubits"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00117","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.00117/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.00117","created_at":"2026-07-05T04:19:09.793796+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.00117v1","created_at":"2026-07-05T04:19:09.793796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00117","created_at":"2026-07-05T04:19:09.793796+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSRCZ3XTLF6P","created_at":"2026-07-05T04:19:09.793796+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSRCZ3XTLF6PXEMB","created_at":"2026-07-05T04:19:09.793796+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSRCZ3XT","created_at":"2026-07-05T04:19:09.793796+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06318","citing_title":"Breaking Memory Bottlenecks in Quantum Control Systems for More Precise Experiments and Higher Throughput Computing","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSRCZ3XTLF6PXEMBAWUYNMMTHP","json":"https://pith.science/pith/BSRCZ3XTLF6PXEMBAWUYNMMTHP.json","graph_json":"https://pith.science/api/pith-number/BSRCZ3XTLF6PXEMBAWUYNMMTHP/graph.json","events_json":"https://pith.science/api/pith-number/BSRCZ3XTLF6PXEMBAWUYNMMTHP/events.json","paper":"https://pith.science/paper/BSRCZ3XT"},"agent_actions":{"view_html":"https://pith.science/pith/BSRCZ3XTLF6PXEMBAWUYNMMTHP","download_json":"https://pith.science/pith/BSRCZ3XTLF6PXEMBAWUYNMMTHP.json","view_paper":"https://pith.science/paper/BSRCZ3XT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.00117&json=true","fetch_graph":"https://pith.science/api/pith-number/BSRCZ3XTLF6PXEMBAWUYNMMTHP/graph.json","fetch_events":"https://pith.science/api/pith-number/BSRCZ3XTLF6PXEMBAWUYNMMTHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSRCZ3XTLF6PXEMBAWUYNMMTHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSRCZ3XTLF6PXEMBAWUYNMMTHP/action/storage_attestation","attest_author":"https://pith.science/pith/BSRCZ3XTLF6PXEMBAWUYNMMTHP/action/author_attestation","sign_citation":"https://pith.science/pith/BSRCZ3XTLF6PXEMBAWUYNMMTHP/action/citation_signature","submit_replication":"https://pith.science/pith/BSRCZ3XTLF6PXEMBAWUYNMMTHP/action/replication_record"}},"created_at":"2026-07-05T04:19:09.793796+00:00","updated_at":"2026-07-05T04:19:09.793796+00:00"}