{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DILDBWRLUAX3VAGKJLOIXZ3OFZ","short_pith_number":"pith:DILDBWRL","schema_version":"1.0","canonical_sha256":"1a1630da2ba02fba80ca4adc8be76e2e72c4ac69e119822ee1c8c48a6a6e7aec","source":{"kind":"arxiv","id":"1008.4643","version":2},"attestation_state":"computed","paper":{"title":"Quantum Oracles in Terms of Universal Gate Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Masahito Tada-Umezaki, Mikio Nakahara, Tsubasa Ichikawa, Yuji Tanaka, Yukihiro Ota","submitted_at":"2010-08-27T05:12:00Z","abstract_excerpt":"We present a systematic construction of quantum circuits implementing Grover's database search algorithm for arbitrary number of targets. We introduce a new operator which flips the sign of the targets and evaluate its circuit complexity. We find the condition under which the circuit complexity of the database search algorithm based on this operator is less than that of the conventional one."},"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":"1008.4643","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-08-27T05:12:00Z","cross_cats_sorted":[],"title_canon_sha256":"fe5ab67f7b6308f4aa0924507e4ee8f6724354739a17982623e89d35723ff659","abstract_canon_sha256":"12a2e7817ab0856ca456ff1fbe80ea8ca17c80cf77728a742e27338bab1f1003"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:09.080019Z","signature_b64":"4LFjw4ukdO9s+eAjfo/7UsPASgSxVg4Ep8s6zh4K94oMxUfboOIaR2thO17Tu8Yo7hn2BV9/75cQPOxKFhRNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a1630da2ba02fba80ca4adc8be76e2e72c4ac69e119822ee1c8c48a6a6e7aec","last_reissued_at":"2026-05-18T04:10:09.079078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:09.079078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Oracles in Terms of Universal Gate Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Masahito Tada-Umezaki, Mikio Nakahara, Tsubasa Ichikawa, Yuji Tanaka, Yukihiro Ota","submitted_at":"2010-08-27T05:12:00Z","abstract_excerpt":"We present a systematic construction of quantum circuits implementing Grover's database search algorithm for arbitrary number of targets. We introduce a new operator which flips the sign of the targets and evaluate its circuit complexity. We find the condition under which the circuit complexity of the database search algorithm based on this operator is less than that of the conventional one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4643","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":"1008.4643","created_at":"2026-05-18T04:10:09.079226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4643v2","created_at":"2026-05-18T04:10:09.079226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4643","created_at":"2026-05-18T04:10:09.079226+00:00"},{"alias_kind":"pith_short_12","alias_value":"DILDBWRLUAX3","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DILDBWRLUAX3VAGK","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DILDBWRL","created_at":"2026-05-18T12:26:06.534383+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/DILDBWRLUAX3VAGKJLOIXZ3OFZ","json":"https://pith.science/pith/DILDBWRLUAX3VAGKJLOIXZ3OFZ.json","graph_json":"https://pith.science/api/pith-number/DILDBWRLUAX3VAGKJLOIXZ3OFZ/graph.json","events_json":"https://pith.science/api/pith-number/DILDBWRLUAX3VAGKJLOIXZ3OFZ/events.json","paper":"https://pith.science/paper/DILDBWRL"},"agent_actions":{"view_html":"https://pith.science/pith/DILDBWRLUAX3VAGKJLOIXZ3OFZ","download_json":"https://pith.science/pith/DILDBWRLUAX3VAGKJLOIXZ3OFZ.json","view_paper":"https://pith.science/paper/DILDBWRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4643&json=true","fetch_graph":"https://pith.science/api/pith-number/DILDBWRLUAX3VAGKJLOIXZ3OFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DILDBWRLUAX3VAGKJLOIXZ3OFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DILDBWRLUAX3VAGKJLOIXZ3OFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DILDBWRLUAX3VAGKJLOIXZ3OFZ/action/storage_attestation","attest_author":"https://pith.science/pith/DILDBWRLUAX3VAGKJLOIXZ3OFZ/action/author_attestation","sign_citation":"https://pith.science/pith/DILDBWRLUAX3VAGKJLOIXZ3OFZ/action/citation_signature","submit_replication":"https://pith.science/pith/DILDBWRLUAX3VAGKJLOIXZ3OFZ/action/replication_record"}},"created_at":"2026-05-18T04:10:09.079226+00:00","updated_at":"2026-05-18T04:10:09.079226+00:00"}