{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RIB7WGSSHAT2TE44C5S3L4AEWK","short_pith_number":"pith:RIB7WGSS","schema_version":"1.0","canonical_sha256":"8a03fb1a523827a9939c1765b5f004b2939e904b005270b70a164ba1ec740d20","source":{"kind":"arxiv","id":"2007.03402","version":2},"attestation_state":"computed","paper":{"title":"Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Andris Ambainis, J\\=anis Iraids, Jevg\\=enijs Vihrovs, Juris Smotrovs, Kamil Khadiev, Kaspars Balodis, Kri\\v{s}j\\=anis Pr\\=usis, Vladislavs K\\c{l}evickis, Yixin Shen","submitted_at":"2020-07-06T09:51:41Z","abstract_excerpt":"We study the quantum query complexity of two problems.\n  First, we consider the problem of determining if a sequence of parentheses is a properly balanced one (a Dyck word), with a depth of at most $k$. We call this the $Dyck_{k,n}$ problem. We prove a lower bound of $\\Omega(c^k \\sqrt{n})$, showing that the complexity of this problem increases exponentially in $k$. Here $n$ is the length of the word. When $k$ is a constant, this is interesting as a representative example of star-free languages for which a surprising $\\tilde{O}(\\sqrt{n})$ query quantum algorithm was recently constructed by Aaro"},"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":"2007.03402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-06T09:51:41Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"7b0fff1ed6238785057d627c397ce55c4cfa3b4b05c784e40a3d7b0847387cfd","abstract_canon_sha256":"6330a2c68abff752e8ab8ff0ed685b94b3c5658e73d8d4c037e43a4c8deb4ff3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:29.110867Z","signature_b64":"c/+AgOmBAswtartywTECgLh0PO2/3pG4Elekakem3g3nO+yp+GIiNpPRn2UJVqDirGPtMWcYmjsdJ6lp8jFFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a03fb1a523827a9939c1765b5f004b2939e904b005270b70a164ba1ec740d20","last_reissued_at":"2026-07-05T01:17:29.110428Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:29.110428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Andris Ambainis, J\\=anis Iraids, Jevg\\=enijs Vihrovs, Juris Smotrovs, Kamil Khadiev, Kaspars Balodis, Kri\\v{s}j\\=anis Pr\\=usis, Vladislavs K\\c{l}evickis, Yixin Shen","submitted_at":"2020-07-06T09:51:41Z","abstract_excerpt":"We study the quantum query complexity of two problems.\n  First, we consider the problem of determining if a sequence of parentheses is a properly balanced one (a Dyck word), with a depth of at most $k$. We call this the $Dyck_{k,n}$ problem. We prove a lower bound of $\\Omega(c^k \\sqrt{n})$, showing that the complexity of this problem increases exponentially in $k$. Here $n$ is the length of the word. When $k$ is a constant, this is interesting as a representative example of star-free languages for which a surprising $\\tilde{O}(\\sqrt{n})$ query quantum algorithm was recently constructed by Aaro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03402","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.03402/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":"2007.03402","created_at":"2026-07-05T01:17:29.110501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03402v2","created_at":"2026-07-05T01:17:29.110501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03402","created_at":"2026-07-05T01:17:29.110501+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIB7WGSSHAT2","created_at":"2026-07-05T01:17:29.110501+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIB7WGSSHAT2TE44","created_at":"2026-07-05T01:17:29.110501+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIB7WGSS","created_at":"2026-07-05T01:17:29.110501+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/RIB7WGSSHAT2TE44C5S3L4AEWK","json":"https://pith.science/pith/RIB7WGSSHAT2TE44C5S3L4AEWK.json","graph_json":"https://pith.science/api/pith-number/RIB7WGSSHAT2TE44C5S3L4AEWK/graph.json","events_json":"https://pith.science/api/pith-number/RIB7WGSSHAT2TE44C5S3L4AEWK/events.json","paper":"https://pith.science/paper/RIB7WGSS"},"agent_actions":{"view_html":"https://pith.science/pith/RIB7WGSSHAT2TE44C5S3L4AEWK","download_json":"https://pith.science/pith/RIB7WGSSHAT2TE44C5S3L4AEWK.json","view_paper":"https://pith.science/paper/RIB7WGSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03402&json=true","fetch_graph":"https://pith.science/api/pith-number/RIB7WGSSHAT2TE44C5S3L4AEWK/graph.json","fetch_events":"https://pith.science/api/pith-number/RIB7WGSSHAT2TE44C5S3L4AEWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIB7WGSSHAT2TE44C5S3L4AEWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIB7WGSSHAT2TE44C5S3L4AEWK/action/storage_attestation","attest_author":"https://pith.science/pith/RIB7WGSSHAT2TE44C5S3L4AEWK/action/author_attestation","sign_citation":"https://pith.science/pith/RIB7WGSSHAT2TE44C5S3L4AEWK/action/citation_signature","submit_replication":"https://pith.science/pith/RIB7WGSSHAT2TE44C5S3L4AEWK/action/replication_record"}},"created_at":"2026-07-05T01:17:29.110501+00:00","updated_at":"2026-07-05T01:17:29.110501+00:00"}