TY - GEN
T1 - Encodability Criteria for Quantum Based Systems
AU - Schmitt, Anna
AU - Peters, Kirstin
AU - Deng, Yuxin
N1 - Publisher Copyright:
© 2022, IFIP International Federation for Information Processing.
PY - 2022
Y1 - 2022
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 sublanguage of CQP into 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 (or its sublanguage) 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 sublanguage of CQP into 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 (or its sublanguage) that is compositional, operationally corresponding, and success sensitive.
KW - Encodings
KW - Process calculi
KW - Quantum based systems
UR - https://www.scopus.com/pages/publications/85132993458
U2 - 10.1007/978-3-031-08679-3_10
DO - 10.1007/978-3-031-08679-3_10
M3 - 会议稿件
AN - SCOPUS:85132993458
SN - 9783031086786
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 151
EP - 169
BT - Formal Techniques for Distributed Objects, Components, and Systems - 42nd IFIP WG 6.1 International Conference, FORTE 2022, Held as Part of the 17th International Federated Conference on Distributed Computing Techniques, DisCoTec 2022, Proceedings
A2 - Mousavi, Mohammad Reza
A2 - Philippou, Anna
PB - Springer Science and Business Media Deutschland GmbH
T2 - 42nd IFIPWG6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2022 Held as Part of the 17th International Federated Conference on Distributed Computing Techniques, DisCoTec 2022
Y2 - 13 June 2022 through 17 June 2022
ER -