{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EYT4CZRBOS4NTXEBPXMAFPWLS4","short_pith_number":"pith:EYT4CZRB","schema_version":"1.0","canonical_sha256":"2627c1662174b8d9dc817dd802becb971ca7ffe02684778919b6bd7d3ea83c09","source":{"kind":"arxiv","id":"1507.03126","version":1},"attestation_state":"computed","paper":{"title":"Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Aleksandrs Belovs, Andris Ambainis, Oded Regev, Ronald de Wolf","submitted_at":"2015-07-11T16:53:57Z","abstract_excerpt":"In the $k$-junta testing problem, a tester has to efficiently decide whether a given function $f:\\{0,1\\}^n\\rightarrow \\{0,1\\}$ is a $k$-junta (i.e., depends on at most $k$ of its input bits) or is $\\epsilon$-far from any $k$-junta. Our main result is a quantum algorithm for this problem with query complexity $\\tilde O(\\sqrt{k/\\epsilon})$ and time complexity $\\tilde O(n\\sqrt{k/\\epsilon})$. This quadratically improves over the query complexity of the previous best quantum junta tester, due to At\\i c\\i\\ and Servedio. Our tester is based on a new quantum algorithm for a gapped version of the combi"},"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":"1507.03126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-11T16:53:57Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"68c1324a463cee4e4e291ee690b8a60aacfa2fc9fcca34f50fb3792d0c704898","abstract_canon_sha256":"a88a5577e2b43484fd7a80b5bc0984c6573a17878aa47f4439b8c3a815e1a718"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:57.925566Z","signature_b64":"9bKCBRAq3BZ9yIjTrkXZq/S4rx6iZOl30bynA22WX0ftjZr0yRebpjguSpxSbNThQf9VhlWmkb4bY9my4MXvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2627c1662174b8d9dc817dd802becb971ca7ffe02684778919b6bd7d3ea83c09","last_reissued_at":"2026-05-18T01:36:57.924867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:57.924867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Aleksandrs Belovs, Andris Ambainis, Oded Regev, Ronald de Wolf","submitted_at":"2015-07-11T16:53:57Z","abstract_excerpt":"In the $k$-junta testing problem, a tester has to efficiently decide whether a given function $f:\\{0,1\\}^n\\rightarrow \\{0,1\\}$ is a $k$-junta (i.e., depends on at most $k$ of its input bits) or is $\\epsilon$-far from any $k$-junta. Our main result is a quantum algorithm for this problem with query complexity $\\tilde O(\\sqrt{k/\\epsilon})$ and time complexity $\\tilde O(n\\sqrt{k/\\epsilon})$. This quadratically improves over the query complexity of the previous best quantum junta tester, due to At\\i c\\i\\ and Servedio. Our tester is based on a new quantum algorithm for a gapped version of the combi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03126","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":"1507.03126","created_at":"2026-05-18T01:36:57.925010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03126v1","created_at":"2026-05-18T01:36:57.925010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03126","created_at":"2026-05-18T01:36:57.925010+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYT4CZRBOS4N","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYT4CZRBOS4NTXEB","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYT4CZRB","created_at":"2026-05-18T12:29:19.899920+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/EYT4CZRBOS4NTXEBPXMAFPWLS4","json":"https://pith.science/pith/EYT4CZRBOS4NTXEBPXMAFPWLS4.json","graph_json":"https://pith.science/api/pith-number/EYT4CZRBOS4NTXEBPXMAFPWLS4/graph.json","events_json":"https://pith.science/api/pith-number/EYT4CZRBOS4NTXEBPXMAFPWLS4/events.json","paper":"https://pith.science/paper/EYT4CZRB"},"agent_actions":{"view_html":"https://pith.science/pith/EYT4CZRBOS4NTXEBPXMAFPWLS4","download_json":"https://pith.science/pith/EYT4CZRBOS4NTXEBPXMAFPWLS4.json","view_paper":"https://pith.science/paper/EYT4CZRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03126&json=true","fetch_graph":"https://pith.science/api/pith-number/EYT4CZRBOS4NTXEBPXMAFPWLS4/graph.json","fetch_events":"https://pith.science/api/pith-number/EYT4CZRBOS4NTXEBPXMAFPWLS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYT4CZRBOS4NTXEBPXMAFPWLS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYT4CZRBOS4NTXEBPXMAFPWLS4/action/storage_attestation","attest_author":"https://pith.science/pith/EYT4CZRBOS4NTXEBPXMAFPWLS4/action/author_attestation","sign_citation":"https://pith.science/pith/EYT4CZRBOS4NTXEBPXMAFPWLS4/action/citation_signature","submit_replication":"https://pith.science/pith/EYT4CZRBOS4NTXEBPXMAFPWLS4/action/replication_record"}},"created_at":"2026-05-18T01:36:57.925010+00:00","updated_at":"2026-05-18T01:36:57.925010+00:00"}