{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UDSGGIOR7QC2ARH2UVEQOGNRQD","short_pith_number":"pith:UDSGGIOR","schema_version":"1.0","canonical_sha256":"a0e46321d1fc05a044faa5490719b180c7f89c2a3c5aab873f8917d3bec686b8","source":{"kind":"arxiv","id":"1902.03660","version":1},"attestation_state":"computed","paper":{"title":"Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Robin Kothari, Shalev Ben-David","submitted_at":"2019-02-10T19:48:27Z","abstract_excerpt":"We define a new query measure we call quantum distinguishing complexity, denoted QD(f) for a Boolean function f. Unlike a quantum query algorithm, which must output a state close to |0> on a 0-input and a state close to |1> on a 1-input, a \"quantum distinguishing algorithm\" can output any state, as long as the output states for any 0-input and 1-input are distinguishable.\n  Using this measure, we establish a new relationship in query complexity: For all total functions f, Q_0(f)=O~(Q(f)^5), where Q_0(f) and Q(f) denote the zero-error and bounded-error quantum query complexity of f respectively"},"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":"1902.03660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-10T19:48:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"100b240e3efba7a9330016e804e5f1c93e7ef2f258fa381cc756caa9b0e4acfd","abstract_canon_sha256":"8e5add6a8e98bdc7bc70cb0107796e982e7d6b1f3259fc3d9e336d08dc57f384"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:20.005334Z","signature_b64":"imnUA2G773M/VtS9bMhZq8wRKzt9xckCNTABmFEAWWnXwTLCDlaBbl7ZecyjJ7UqQbWs7OdPF1nJKZTyhCFLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0e46321d1fc05a044faa5490719b180c7f89c2a3c5aab873f8917d3bec686b8","last_reissued_at":"2026-05-17T23:54:20.004423Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:20.004423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Robin Kothari, Shalev Ben-David","submitted_at":"2019-02-10T19:48:27Z","abstract_excerpt":"We define a new query measure we call quantum distinguishing complexity, denoted QD(f) for a Boolean function f. Unlike a quantum query algorithm, which must output a state close to |0> on a 0-input and a state close to |1> on a 1-input, a \"quantum distinguishing algorithm\" can output any state, as long as the output states for any 0-input and 1-input are distinguishable.\n  Using this measure, we establish a new relationship in query complexity: For all total functions f, Q_0(f)=O~(Q(f)^5), where Q_0(f) and Q(f) denote the zero-error and bounded-error quantum query complexity of f respectively"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03660","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":"1902.03660","created_at":"2026-05-17T23:54:20.004525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03660v1","created_at":"2026-05-17T23:54:20.004525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03660","created_at":"2026-05-17T23:54:20.004525+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDSGGIOR7QC2","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDSGGIOR7QC2ARH2","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDSGGIOR","created_at":"2026-05-18T12:33:30.264802+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/UDSGGIOR7QC2ARH2UVEQOGNRQD","json":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD.json","graph_json":"https://pith.science/api/pith-number/UDSGGIOR7QC2ARH2UVEQOGNRQD/graph.json","events_json":"https://pith.science/api/pith-number/UDSGGIOR7QC2ARH2UVEQOGNRQD/events.json","paper":"https://pith.science/paper/UDSGGIOR"},"agent_actions":{"view_html":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD","download_json":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD.json","view_paper":"https://pith.science/paper/UDSGGIOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03660&json=true","fetch_graph":"https://pith.science/api/pith-number/UDSGGIOR7QC2ARH2UVEQOGNRQD/graph.json","fetch_events":"https://pith.science/api/pith-number/UDSGGIOR7QC2ARH2UVEQOGNRQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/action/storage_attestation","attest_author":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/action/author_attestation","sign_citation":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/action/citation_signature","submit_replication":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/action/replication_record"}},"created_at":"2026-05-17T23:54:20.004525+00:00","updated_at":"2026-05-17T23:54:20.004525+00:00"}