{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OKCNNMGPPPDEBCQYDYSATGWRUU","short_pith_number":"pith:OKCNNMGP","schema_version":"1.0","canonical_sha256":"7284d6b0cf7bc6408a181e24099ad1a51c94e9642ea84f170d7a444ad632f536","source":{"kind":"arxiv","id":"1703.10535","version":1},"attestation_state":"computed","paper":{"title":"Complete 3-Qubit Grover Search on a Programmable Quantum Computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"C. Figgatt, C. Monroe, D. Maslov, K. A. Landsman, N. M. Linke, S. Debnath","submitted_at":"2017-03-30T15:41:50Z","abstract_excerpt":"Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries over classical computers. It is an optimal search algorithm for a quantum computer, and has further applications as a subroutine for other quantum algorithms. Searches with two qubits have been demonstrated on a variety of platforms and proposed for others, but larger search spaces have only been demonstrated on a non-scalable NMR system. Here, we report res"},"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":"1703.10535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-30T15:41:50Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"c457dedbfa9381a5f07f0e637ef6b23f57b2126f6b3c11a8f85e3523516f83c4","abstract_canon_sha256":"c3b8eff1b90d8fc364708c9eab601b228b21539fc5ea46633af96a6bae052f4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:01.569454Z","signature_b64":"dqAFuNfAlcItCSk9Ayaa80HPv1wkV6LDgvksFOBlxCtqO1dTHPQhlcoqWPlgKsMyXD5xIcK0RUR/yMCMU5wkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7284d6b0cf7bc6408a181e24099ad1a51c94e9642ea84f170d7a444ad632f536","last_reissued_at":"2026-05-18T00:29:01.569018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:01.569018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete 3-Qubit Grover Search on a Programmable Quantum Computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"C. Figgatt, C. Monroe, D. Maslov, K. A. Landsman, N. M. Linke, S. Debnath","submitted_at":"2017-03-30T15:41:50Z","abstract_excerpt":"Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries over classical computers. It is an optimal search algorithm for a quantum computer, and has further applications as a subroutine for other quantum algorithms. Searches with two qubits have been demonstrated on a variety of platforms and proposed for others, but larger search spaces have only been demonstrated on a non-scalable NMR system. Here, we report res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10535","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":"1703.10535","created_at":"2026-05-18T00:29:01.569093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10535v1","created_at":"2026-05-18T00:29:01.569093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10535","created_at":"2026-05-18T00:29:01.569093+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKCNNMGPPPDE","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKCNNMGPPPDEBCQY","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKCNNMGP","created_at":"2026-05-18T12:31:34.259226+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/OKCNNMGPPPDEBCQYDYSATGWRUU","json":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU.json","graph_json":"https://pith.science/api/pith-number/OKCNNMGPPPDEBCQYDYSATGWRUU/graph.json","events_json":"https://pith.science/api/pith-number/OKCNNMGPPPDEBCQYDYSATGWRUU/events.json","paper":"https://pith.science/paper/OKCNNMGP"},"agent_actions":{"view_html":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU","download_json":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU.json","view_paper":"https://pith.science/paper/OKCNNMGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10535&json=true","fetch_graph":"https://pith.science/api/pith-number/OKCNNMGPPPDEBCQYDYSATGWRUU/graph.json","fetch_events":"https://pith.science/api/pith-number/OKCNNMGPPPDEBCQYDYSATGWRUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/action/storage_attestation","attest_author":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/action/author_attestation","sign_citation":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/action/citation_signature","submit_replication":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/action/replication_record"}},"created_at":"2026-05-18T00:29:01.569093+00:00","updated_at":"2026-05-18T00:29:01.569093+00:00"}