TY - JOUR
T1 - ENCODABILITY CRITERIA FOR QUANTUM BASED SYSTEMS
AU - Schmitt, Anna
AU - Peters, Kirstin
AU - Deng, Yuxin
N1 - Publisher Copyright:
© 2024, Logical Methods in Computer Science. All rights reserved.
PY - 2024
Y1 - 2024
N2 - Quantum based systems are a relatively new research area for that different modelling languages including process calculi are currently under development. Encodings are often used to compare process calculi. Quality criteria are used then to rule out trivial or meaningless encodings. In this new context of quantum based systems, it is necessary to analyse the applicability of these quality criteria and to potentially extend or adapt them. As a first step, we test the suitability of classical criteria for encodings between quantum based languages and discuss new criteria. Concretely, we present an encoding, from a language inspired by CQP into a language inspired by qCCS. We show that this encoding satisfies compositionality, name invariance (for channel and qubit names), operational correspondence, divergence reflection, success sensitiveness, and that it preserves the size of quantum registers. Then we show that there is no encoding from qCCS into CQP that is compositional, operationally corresponding, and success sensitive.
AB - Quantum based systems are a relatively new research area for that different modelling languages including process calculi are currently under development. Encodings are often used to compare process calculi. Quality criteria are used then to rule out trivial or meaningless encodings. In this new context of quantum based systems, it is necessary to analyse the applicability of these quality criteria and to potentially extend or adapt them. As a first step, we test the suitability of classical criteria for encodings between quantum based languages and discuss new criteria. Concretely, we present an encoding, from a language inspired by CQP into a language inspired by qCCS. We show that this encoding satisfies compositionality, name invariance (for channel and qubit names), operational correspondence, divergence reflection, success sensitiveness, and that it preserves the size of quantum registers. Then we show that there is no encoding from qCCS into CQP that is compositional, operationally corresponding, and success sensitive.
KW - Process calculi and Quantum Based Systems and Encodings
UR - https://www.scopus.com/pages/publications/85193264880
U2 - 10.46298/lmcs-20(2:5)2024
DO - 10.46298/lmcs-20(2:5)2024
M3 - 文章
AN - SCOPUS:85193264880
SN - 1860-5974
VL - 20
SP - 5:1-5:45
JO - Logical Methods in Computer Science
JF - Logical Methods in Computer Science
IS - 2
ER -