{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XIA6T4DHIWYIK3QWMASGMC5EUD","short_pith_number":"pith:XIA6T4DH","schema_version":"1.0","canonical_sha256":"ba01e9f06745b0856e166024660ba4a0f941e2ad29de2e656243b4d168124df0","source":{"kind":"arxiv","id":"2105.06184","version":1},"attestation_state":"computed","paper":{"title":"Implementing Quantum Finite Automata Algorithms on Noisy Devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"quant-ph","authors_text":"Abuzer Yakary{\\i}lmaz, Cem Nurlu, \\\"Ozlem Salehi, Utku Birkan, Viktor Olejar","submitted_at":"2021-05-13T10:51:28Z","abstract_excerpt":"Quantum finite automata (QFAs) literature offers an alternative mathematical model for studying quantum systems with finite memory. As a superiority of quantum computing, QFAs have been shown exponentially more succinct on certain problems such as recognizing the language $ MOD_p = \\{a^j \\mid j \\equiv 0 \\mod p\\} $ with bounded error, where $p$ is a prime number. In this paper we present improved circuit based implementations for QFA algorithms recognizing the $ MOD_p $ problem using the Qiskit framework. We focus on the case $p=11$ and provide a 3 qubit implementation for the $MOD_{11}$ proble"},"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":"2105.06184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-05-13T10:51:28Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"11af31e28de9d431d6b52aeda1a055a815170d4cb905c9b13d151af2d2eb4a22","abstract_canon_sha256":"c61546250a5d0e595ef578b916b9898712aaf30f773d80a01c7c2ae5eaca1c50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:05.115520Z","signature_b64":"rGpG8k44hEIVyXxe89IeLXml2DSevGWyia6DjSxya50ZFERdu/qEZYxpAruHyK5kKp3/IPj1Oi6Q5GyArmcmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba01e9f06745b0856e166024660ba4a0f941e2ad29de2e656243b4d168124df0","last_reissued_at":"2026-07-05T02:40:05.114982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:05.114982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implementing Quantum Finite Automata Algorithms on Noisy Devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"quant-ph","authors_text":"Abuzer Yakary{\\i}lmaz, Cem Nurlu, \\\"Ozlem Salehi, Utku Birkan, Viktor Olejar","submitted_at":"2021-05-13T10:51:28Z","abstract_excerpt":"Quantum finite automata (QFAs) literature offers an alternative mathematical model for studying quantum systems with finite memory. As a superiority of quantum computing, QFAs have been shown exponentially more succinct on certain problems such as recognizing the language $ MOD_p = \\{a^j \\mid j \\equiv 0 \\mod p\\} $ with bounded error, where $p$ is a prime number. In this paper we present improved circuit based implementations for QFA algorithms recognizing the $ MOD_p $ problem using the Qiskit framework. We focus on the case $p=11$ and provide a 3 qubit implementation for the $MOD_{11}$ proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.06184","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/2105.06184/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":"2105.06184","created_at":"2026-07-05T02:40:05.115040+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.06184v1","created_at":"2026-07-05T02:40:05.115040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.06184","created_at":"2026-07-05T02:40:05.115040+00:00"},{"alias_kind":"pith_short_12","alias_value":"XIA6T4DHIWYI","created_at":"2026-07-05T02:40:05.115040+00:00"},{"alias_kind":"pith_short_16","alias_value":"XIA6T4DHIWYIK3QW","created_at":"2026-07-05T02:40:05.115040+00:00"},{"alias_kind":"pith_short_8","alias_value":"XIA6T4DH","created_at":"2026-07-05T02:40:05.115040+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00507","citing_title":"Quantum Memory Advantage from Contextuality","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XIA6T4DHIWYIK3QWMASGMC5EUD","json":"https://pith.science/pith/XIA6T4DHIWYIK3QWMASGMC5EUD.json","graph_json":"https://pith.science/api/pith-number/XIA6T4DHIWYIK3QWMASGMC5EUD/graph.json","events_json":"https://pith.science/api/pith-number/XIA6T4DHIWYIK3QWMASGMC5EUD/events.json","paper":"https://pith.science/paper/XIA6T4DH"},"agent_actions":{"view_html":"https://pith.science/pith/XIA6T4DHIWYIK3QWMASGMC5EUD","download_json":"https://pith.science/pith/XIA6T4DHIWYIK3QWMASGMC5EUD.json","view_paper":"https://pith.science/paper/XIA6T4DH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.06184&json=true","fetch_graph":"https://pith.science/api/pith-number/XIA6T4DHIWYIK3QWMASGMC5EUD/graph.json","fetch_events":"https://pith.science/api/pith-number/XIA6T4DHIWYIK3QWMASGMC5EUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XIA6T4DHIWYIK3QWMASGMC5EUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XIA6T4DHIWYIK3QWMASGMC5EUD/action/storage_attestation","attest_author":"https://pith.science/pith/XIA6T4DHIWYIK3QWMASGMC5EUD/action/author_attestation","sign_citation":"https://pith.science/pith/XIA6T4DHIWYIK3QWMASGMC5EUD/action/citation_signature","submit_replication":"https://pith.science/pith/XIA6T4DHIWYIK3QWMASGMC5EUD/action/replication_record"}},"created_at":"2026-07-05T02:40:05.115040+00:00","updated_at":"2026-07-05T02:40:05.115040+00:00"}