{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4HBGPYBTCW2TVZLT5FVD6SSHKO","short_pith_number":"pith:4HBGPYBT","schema_version":"1.0","canonical_sha256":"e1c267e03315b53ae573e96a3f4a475380a622a53df30cc6a12fdbe0d1fa762d","source":{"kind":"arxiv","id":"2607.28402","version":1},"attestation_state":"computed","paper":{"title":"Nearly optimal quantum circuits for Boolean oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Junhong Nie, Wei Zi","submitted_at":"2026-07-30T15:51:53Z","abstract_excerpt":"Quantum oracle of Boolean functions is one of the central bridges between classical and quantum algorithms, but the study focusing at quantum circuit optimization of such oracle is yet closed. In this paper, we propose nearly optimal tradeoffs among circuit size, circuit depth and ancilla count, for quantum oracles of three kinds of Boolean functions:\n  general total Boolean functions with output size $b$: with $1\\le m\\le\\Theta\\left(\\frac{2^n}{n}\\right)$ ancilla, size $\\mathcal{O}\\left(\\frac{b2^n}{\\log(n+m)}\\right)$, depth $\\mathcal{O}\\left(\\frac{b2^n}{n+m}\\right)$;\n  partial Boolean functions"},"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":"2607.28402","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T15:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"f1c4de3e4560c659a09fe9e36b75a635c3c3c78a6ff7e4d3c11561384e21fc1b","abstract_canon_sha256":"73fff016b094afee4fbc4119425cf6675c5846e3993f775aac23c8f8fea5b1a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1c267e03315b53ae573e96a3f4a475380a622a53df30cc6a12fdbe0d1fa762d","last_reissued_at":"2026-07-31T01:37:32.600757Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:37:32.600757Z"},"graph_snapshot":{"paper":{"title":"Nearly optimal quantum circuits for Boolean oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Junhong Nie, Wei Zi","submitted_at":"2026-07-30T15:51:53Z","abstract_excerpt":"Quantum oracle of Boolean functions is one of the central bridges between classical and quantum algorithms, but the study focusing at quantum circuit optimization of such oracle is yet closed. In this paper, we propose nearly optimal tradeoffs among circuit size, circuit depth and ancilla count, for quantum oracles of three kinds of Boolean functions:\n  general total Boolean functions with output size $b$: with $1\\le m\\le\\Theta\\left(\\frac{2^n}{n}\\right)$ ancilla, size $\\mathcal{O}\\left(\\frac{b2^n}{\\log(n+m)}\\right)$, depth $\\mathcal{O}\\left(\\frac{b2^n}{n+m}\\right)$;\n  partial Boolean functions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28402","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/2607.28402/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":"2607.28402","created_at":"2026-07-31T01:37:32.604110+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28402v1","created_at":"2026-07-31T01:37:32.604110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28402","created_at":"2026-07-31T01:37:32.604110+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HBGPYBTCW2T","created_at":"2026-07-31T01:37:32.604110+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HBGPYBTCW2TVZLT","created_at":"2026-07-31T01:37:32.604110+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HBGPYBT","created_at":"2026-07-31T01:37:32.604110+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/4HBGPYBTCW2TVZLT5FVD6SSHKO","json":"https://pith.science/pith/4HBGPYBTCW2TVZLT5FVD6SSHKO.json","graph_json":"https://pith.science/api/pith-number/4HBGPYBTCW2TVZLT5FVD6SSHKO/graph.json","events_json":"https://pith.science/api/pith-number/4HBGPYBTCW2TVZLT5FVD6SSHKO/events.json","paper":"https://pith.science/paper/4HBGPYBT"},"agent_actions":{"view_html":"https://pith.science/pith/4HBGPYBTCW2TVZLT5FVD6SSHKO","download_json":"https://pith.science/pith/4HBGPYBTCW2TVZLT5FVD6SSHKO.json","view_paper":"https://pith.science/paper/4HBGPYBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28402&json=true","fetch_graph":"https://pith.science/api/pith-number/4HBGPYBTCW2TVZLT5FVD6SSHKO/graph.json","fetch_events":"https://pith.science/api/pith-number/4HBGPYBTCW2TVZLT5FVD6SSHKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HBGPYBTCW2TVZLT5FVD6SSHKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HBGPYBTCW2TVZLT5FVD6SSHKO/action/storage_attestation","attest_author":"https://pith.science/pith/4HBGPYBTCW2TVZLT5FVD6SSHKO/action/author_attestation","sign_citation":"https://pith.science/pith/4HBGPYBTCW2TVZLT5FVD6SSHKO/action/citation_signature","submit_replication":"https://pith.science/pith/4HBGPYBTCW2TVZLT5FVD6SSHKO/action/replication_record"}},"created_at":"2026-07-31T01:37:32.604110+00:00","updated_at":"2026-07-31T01:37:32.604110+00:00"}