{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:22Z","timestamp":1753894402533,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Quantum based systems are a relatively new research area for that different\nmodelling languages including process calculi are currently under development.\nEncodings are often used to compare process calculi. Quality criteria are used\nthen to rule out trivial or meaningless encodings. In this new context of\nquantum based systems, it is necessary to analyse the applicability of these\nquality criteria and to potentially extend or adapt them. As a first step, we\ntest the suitability of classical criteria for encodings between quantum based\nlanguages and discuss new criteria. Concretely, we present an encoding, from a\nlanguage inspired by CQP into a language inspired by qCCS. We show that this\nencoding satisfies compositionality, name invariance (for channel and qubit\nnames), operational correspondence, divergence reflection, success\nsensitiveness, and that it preserves the size of quantum registers. Then we\nshow that there is no encoding from qCCS into CQP that is compositional,\noperationally corresponding, and success sensitive.<\/jats:p>","DOI":"10.46298\/lmcs-20(2:5)2024","type":"journal-article","created":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T10:40:09Z","timestamp":1714473609000},"source":"Crossref","is-referenced-by-count":0,"title":["Encodability Criteria for Quantum Based Systems"],"prefix":"10.46298","volume":"Volume 20, Issue 2","author":[{"given":"Anna","family":"Schmitt","sequence":"first","affiliation":[]},{"given":"Kirstin","family":"Peters","sequence":"additional","affiliation":[]},{"given":"Yuxin","family":"Deng","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2024,4,30]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/13492\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/13492\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T10:40:09Z","timestamp":1714473609000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/10423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,30]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-20(2:5)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2204.06068v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2204.06068v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2204.06068","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2204.06068","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2024,4,30]]},"article-number":"10423"}}