An extended quantum process algebra (eQPAlg) approach for distributed quantum systems

• URL: http://arxiv.org/abs/2001.04249v1
• Date: Mon, 6 Jan 2020 11:02:35 GMT
• Title: An extended quantum process algebra (eQPAlg) approach for distributed quantum systems
• Authors: Salman Haider, Dr. Syed Asad Raza Kazmi
• Abstract summary: We have expounded the communication procedure of quantum systems by means of process algebra. The main objective of our research effort is to formally represent the communication between distributed quantum systems.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: In this work, we have expounded the communication procedure of quantum systems by means of process algebra. The main objective of our research effort is to formally represent the communication between distributed quantum systems. In this new proposed communication model we have ameliorated the existing rules of Lalire's quantum process algebra QPAlg. We have brought some important modification in QPAlg by introducing the concept of formally specifying the Quantum teleportation protocol. We have further introduced the formal description of protocol by using programs that best explains its working and satisfies the specification. Examples have been provided to describe the working of the improved algebra that formally explain the sending and receiving of both classical as well as quantum data, keeping in mind the principal features of quantum mechanics.

Related papers

• Formal verification of higher dimensional quantum protocols [0.0]
  We present our preliminary results in extending the theory of behavioural equivalence in CQP to verify higher dimensional quantum protocols using qudits. This is a work-in-progress and we present our preliminary results in extending the theory of behavioural equivalence in CQP to verify higher dimensional quantum protocols using qudits.
  arXiv  Detail & Related papers  (2024-09-26T15:53:14Z)
• The Quantum Abstract Machine [4.968520732123632]
  The work is motivated by the need for conceptual tools for the development of quantum-communication systems. This paper defines a quantum abstract machine (QAM) whose operations correspond to well-known quantum circuits. It shows via examples how it may be used to model and reason about existing quantum communication protocols.
  arXiv  Detail & Related papers  (2024-02-21T01:55:59Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• LQP: The Dynamic Logic of Quantum Information [77.34726150561087]
  This paper introduces a dynamic logic formalism for reasoning about information flow in composite quantum systems. We present a finitary syntax, a relational semantics and a sound proof system for this logic. As applications, we use our system to give formal correctness for the Teleportation protocol and for a standard Quantum Secret Sharing protocol.
  arXiv  Detail & Related papers  (2021-10-04T12:20:23Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• High-fidelity quantum gates for OAM qudits on quantum memory [0.0]
  We propose a method for implementing single-qudit gates for qudits based on light modes with orbital angular momentum. We show that the considered gates provide an extremely high level of fidelity of single-qudit transformations.
  arXiv  Detail & Related papers  (2021-05-25T19:13:27Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum Consensus: an overview [0.0]
  We report on a formal definition of quantum consensus and the protocols proposed. Proposals are classified according to the quantum feature used to achieve agreement.
  arXiv  Detail & Related papers  (2021-01-11T21:10:06Z)
• Certified Quantum Computation in Isabelle/HOL [1.2730070122798456]
  We present an effort to formalise quantum algorithms and results in quantum information theory using the proof assistant Isabelle/HOL. We have developed a large library for quantum computing in Isabelle based on a matrix representation for quantum circuits. We discuss the design choices made and report on an outcome of our work in the field of quantum game theory.
  arXiv  Detail & Related papers  (2020-12-27T11:45:49Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.