{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BD2MK75OBCRUHBTDMISN7HALOW","short_pith_number":"pith:BD2MK75O","schema_version":"1.0","canonical_sha256":"08f4c57fae08a34386636224df9c0b75a0b1558a5c04a990a9f4d58d825af0ec","source":{"kind":"arxiv","id":"1702.02577","version":3},"attestation_state":"computed","paper":{"title":"Near-optimal quantum circuit for Grover's unstructured search using a transverse field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eleanor G. Rieffel, Zhang Jiang, Zhihui Wang","submitted_at":"2017-02-08T19:00:25Z","abstract_excerpt":"Inspired by a class of algorithms proposed by Farhi et al. (arXiv:1411.4028), namely the quantum approximate optimization algorithm (QAOA), we present a circuit-based quantum algorithm to search for a needle in a haystack, obtaining the same quadratic speedup achieved by Grover's original algorithm. In our algorithm, the problem Hamiltonian (oracle) and a transverse field are applied alternately to the system in a periodic manner. We introduce a technique, based on spin-coherent states, to analyze the composite unitary in a single period. This composite unitary drives a closed transition betwe"},"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":"1702.02577","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-02-08T19:00:25Z","cross_cats_sorted":[],"title_canon_sha256":"ef1520bdc52c397a69a3b459311dc815a9e4c14b5d2e7ea8afa33af407f32e7b","abstract_canon_sha256":"42b0386e97ae715c5acdae0b1c1171204196cc4074f763387080ad0d58d009db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:01.932268Z","signature_b64":"HX09WefSD6qSULb7MmJHezKm/np9NvIpANJgP0VsBfQ01NXBA9U9VrUJsJVi8P6lbYyru1wD2hg66p81MZlxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08f4c57fae08a34386636224df9c0b75a0b1558a5c04a990a9f4d58d825af0ec","last_reissued_at":"2026-05-18T00:42:01.931826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:01.931826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-optimal quantum circuit for Grover's unstructured search using a transverse field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eleanor G. Rieffel, Zhang Jiang, Zhihui Wang","submitted_at":"2017-02-08T19:00:25Z","abstract_excerpt":"Inspired by a class of algorithms proposed by Farhi et al. (arXiv:1411.4028), namely the quantum approximate optimization algorithm (QAOA), we present a circuit-based quantum algorithm to search for a needle in a haystack, obtaining the same quadratic speedup achieved by Grover's original algorithm. In our algorithm, the problem Hamiltonian (oracle) and a transverse field are applied alternately to the system in a periodic manner. We introduce a technique, based on spin-coherent states, to analyze the composite unitary in a single period. This composite unitary drives a closed transition betwe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02577","kind":"arxiv","version":3},"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":"1702.02577","created_at":"2026-05-18T00:42:01.931889+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02577v3","created_at":"2026-05-18T00:42:01.931889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02577","created_at":"2026-05-18T00:42:01.931889+00:00"},{"alias_kind":"pith_short_12","alias_value":"BD2MK75OBCRU","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BD2MK75OBCRUHBTD","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BD2MK75O","created_at":"2026-05-18T12:31:08.081275+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/BD2MK75OBCRUHBTDMISN7HALOW","json":"https://pith.science/pith/BD2MK75OBCRUHBTDMISN7HALOW.json","graph_json":"https://pith.science/api/pith-number/BD2MK75OBCRUHBTDMISN7HALOW/graph.json","events_json":"https://pith.science/api/pith-number/BD2MK75OBCRUHBTDMISN7HALOW/events.json","paper":"https://pith.science/paper/BD2MK75O"},"agent_actions":{"view_html":"https://pith.science/pith/BD2MK75OBCRUHBTDMISN7HALOW","download_json":"https://pith.science/pith/BD2MK75OBCRUHBTDMISN7HALOW.json","view_paper":"https://pith.science/paper/BD2MK75O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02577&json=true","fetch_graph":"https://pith.science/api/pith-number/BD2MK75OBCRUHBTDMISN7HALOW/graph.json","fetch_events":"https://pith.science/api/pith-number/BD2MK75OBCRUHBTDMISN7HALOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BD2MK75OBCRUHBTDMISN7HALOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BD2MK75OBCRUHBTDMISN7HALOW/action/storage_attestation","attest_author":"https://pith.science/pith/BD2MK75OBCRUHBTDMISN7HALOW/action/author_attestation","sign_citation":"https://pith.science/pith/BD2MK75OBCRUHBTDMISN7HALOW/action/citation_signature","submit_replication":"https://pith.science/pith/BD2MK75OBCRUHBTDMISN7HALOW/action/replication_record"}},"created_at":"2026-05-18T00:42:01.931889+00:00","updated_at":"2026-05-18T00:42:01.931889+00:00"}