{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:EW3CIQVAZ5YQTMXANWGWRZAL5S","short_pith_number":"pith:EW3CIQVA","schema_version":"1.0","canonical_sha256":"25b62442a0cf7109b2e06d8d68e40becab310b03e17788276f6ba54779c18853","source":{"kind":"arxiv","id":"quant-ph/9904093","version":3},"attestation_state":"computed","paper":{"title":"Optimal lower bounds for quantum automata and random access codes","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ashwin Nayak","submitted_at":"1999-04-27T23:59:48Z","abstract_excerpt":"Consider the finite regular language L_n = {w0 : w \\in {0,1}^*, |w| \\le n}. It was shown by Ambainis, Nayak, Ta-Shma and Vazirani that while this language is accepted by a deterministic finite automaton of size O(n), any one-way quantum finite automaton (QFA) for it has size 2^{Omega(n/log n)}. This was based on the fact that the evolution of a QFA is required to be reversible. When arbitrary intermediate measurements are allowed, this intuition breaks down. Nonetheless, we show a 2^{Omega(n)} lower bound for such QFA for L_n, thus also improving the previous bound. The improved bound is obtai"},"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":"quant-ph/9904093","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-04-27T23:59:48Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4c39f7683ec39a7cb783be5ab95a11a02c99f908a9257bee62b098953c509c31","abstract_canon_sha256":"edf524aa29f17756e290d1884e89cc81984c6b7fd4b3ebe48d19c5c51415cc0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:25.332342Z","signature_b64":"cwS362kP5xCuXPELXQxelyGCGV0OW8ZZfFbVwtXRlUmtfPAv1PipZm0K3zIwmqCooKlNcr+Wwe6qxV7tmt5TCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25b62442a0cf7109b2e06d8d68e40becab310b03e17788276f6ba54779c18853","last_reissued_at":"2026-07-04T14:47:25.331946Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:25.331946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal lower bounds for quantum automata and random access codes","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ashwin Nayak","submitted_at":"1999-04-27T23:59:48Z","abstract_excerpt":"Consider the finite regular language L_n = {w0 : w \\in {0,1}^*, |w| \\le n}. It was shown by Ambainis, Nayak, Ta-Shma and Vazirani that while this language is accepted by a deterministic finite automaton of size O(n), any one-way quantum finite automaton (QFA) for it has size 2^{Omega(n/log n)}. This was based on the fact that the evolution of a QFA is required to be reversible. When arbitrary intermediate measurements are allowed, this intuition breaks down. Nonetheless, we show a 2^{Omega(n)} lower bound for such QFA for L_n, thus also improving the previous bound. The improved bound is obtai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9904093","kind":"arxiv","version":3},"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/quant-ph/9904093/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":"quant-ph/9904093","created_at":"2026-07-04T14:47:25.332001+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9904093v3","created_at":"2026-07-04T14:47:25.332001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9904093","created_at":"2026-07-04T14:47:25.332001+00:00"},{"alias_kind":"pith_short_12","alias_value":"EW3CIQVAZ5YQ","created_at":"2026-07-04T14:47:25.332001+00:00"},{"alias_kind":"pith_short_16","alias_value":"EW3CIQVAZ5YQTMXA","created_at":"2026-07-04T14:47:25.332001+00:00"},{"alias_kind":"pith_short_8","alias_value":"EW3CIQVA","created_at":"2026-07-04T14:47:25.332001+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06345","citing_title":"Dimension-Free Polylogarithmic Quantum Shadow Tomography from Sequential Pretty-Good Measurements","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EW3CIQVAZ5YQTMXANWGWRZAL5S","json":"https://pith.science/pith/EW3CIQVAZ5YQTMXANWGWRZAL5S.json","graph_json":"https://pith.science/api/pith-number/EW3CIQVAZ5YQTMXANWGWRZAL5S/graph.json","events_json":"https://pith.science/api/pith-number/EW3CIQVAZ5YQTMXANWGWRZAL5S/events.json","paper":"https://pith.science/paper/EW3CIQVA"},"agent_actions":{"view_html":"https://pith.science/pith/EW3CIQVAZ5YQTMXANWGWRZAL5S","download_json":"https://pith.science/pith/EW3CIQVAZ5YQTMXANWGWRZAL5S.json","view_paper":"https://pith.science/paper/EW3CIQVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9904093&json=true","fetch_graph":"https://pith.science/api/pith-number/EW3CIQVAZ5YQTMXANWGWRZAL5S/graph.json","fetch_events":"https://pith.science/api/pith-number/EW3CIQVAZ5YQTMXANWGWRZAL5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EW3CIQVAZ5YQTMXANWGWRZAL5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EW3CIQVAZ5YQTMXANWGWRZAL5S/action/storage_attestation","attest_author":"https://pith.science/pith/EW3CIQVAZ5YQTMXANWGWRZAL5S/action/author_attestation","sign_citation":"https://pith.science/pith/EW3CIQVAZ5YQTMXANWGWRZAL5S/action/citation_signature","submit_replication":"https://pith.science/pith/EW3CIQVAZ5YQTMXANWGWRZAL5S/action/replication_record"}},"created_at":"2026-07-04T14:47:25.332001+00:00","updated_at":"2026-07-04T14:47:25.332001+00:00"}