Probabilistic bisimulations for quantum processes

Feng, Yuan; Duan, Runyao; Ji, Zhengfeng; Ying, Mingsheng

doi:10.1016/j.ic.2007.08.002

Cited by 24 publications

(49 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, the classical information capacity of deterministic superdense coding with non-maximally entangled states has been studied by [26,27,28]. Recently, various kinds of quantum channels have been explored for deterministic and unambiguous superdense coding [31,32,33].…”

Section: Introductionmentioning

confidence: 99%

The states of W-class as shared resources for perfect teleportation and superdense coding

Li¹,

Qiu²

2007

J. Phys. A: Math. Theor.

View full text Add to dashboard Cite

As we know, the states of triqubit systems have two important classes: GHZ-class and W-class. In this paper, the states of W-class are considered for teleportation and superdense coding, and are generalized to multi-particle systems. First we describe two transformations of the shared resources for teleportation and superdense coding, which allow many new protocols from some known ones for that. As an application of these transformations, we obtain a sufficient and necessary condition for a state of W-class being suitable for perfect teleportation and superdense coding. As another application, we find that state |W 123 = 1 2 (|100 123 + |010 123 + √ 2|001 123 ) can be used to transmit three classical bits by sending two qubits, which was considered to be impossible by P. Agrawal and A. Pati [Phys. Rev. A to be published]. We generalize the states of W-class to multi-qubit systems and multi-particle systems with higher dimension. We propose two protocols for teleportation and superdense coding by using W-states of multi-qubit systems that generalize the protocols by using |W 123 proposed by P. Agrawal and A. Pati. We obtain an optimal way to partition some W-states of multi-qubit systems into two subsystems, such that the entanglement between them achieves maximum value.

show abstract

Section: Introductionmentioning

confidence: 99%

The states of W-class as shared resources for perfect teleportation and superdense coding

Li¹,

Qiu²

2007

J. Phys. A: Math. Theor.

View full text Add to dashboard Cite

show abstract

“…For further studies, we are going to use qCCS, a quantum extension of CCS developed by one of the authors and his colleagues [7,8,19], as our modelling language. This will make the protocol description more intuitive and more readable.…”

Section: Discussionmentioning

confidence: 99%

QPMC: A Model Checker for Quantum Programs and Protocols

Feng

Hahn

Turrini

et al. 2015

FM 2015: Formal Methods

Self Cite

View full text Add to dashboard Cite

Abstract. We present QPMC (Quantum Program/Protocol Model Checker), an extension of the probabilistic model checker ISCASMC to automatically verify quantum programs and quantum protocols. QPMC distinguishes itself from the previous quantum model checkers proposed in the literature in that it works for general quantum programs and protocols, not only those using Clifford operations. A command-line version of QPMC is available at http://iscasmc.ios.ac.cn/tool/qmc/.

show abstract

“…To model concurrent quantum computation, Jorrand and Lalire [47] defined the QPAlg language by adding primitives expressing unitary transformations and quantum measurements, as well as communications of quantum states, to a classical process algebra, which is similar to CCS. In a series of papers [48][49][50][51], the authors proposed a model qCCS for concurrent quantum computation, which is a natural quantum extension of classical valuepassing CCS and can deal with input and output of quantum states, and unitary transformations and measurements on quantum systems. In particular, the notion of probabilistic bisimulation between quantum processes was introduced, and their congruence properties were established.…”

Section: Quantum Process Algebrasmentioning

confidence: 99%

“…It seems that entanglement is more essential in quantum concurrent computation than in sequential quantum computation. The algebra of quantum processes developed in [48,49,51] should provide us with a natural and cleaned up formal framework for analyzing the role of entanglement in concurrent quantum computation.…”

Section: Quantum Process Algebrasmentioning

confidence: 99%

Quantum programming: From theories to implementations

et al. 2012

Self Cite

View full text Add to dashboard Cite

This paper surveys the new field of programming methodology and techniques for future quantum computers, including design of sequential and concurrent quantum programming languages, their semantics and implementations. Several verification methods for quantum programs and communication protocols are also reviewed. The potential applications of programming techniques and related formal methods in quantum engineering are pointed out. Chin Sci Bull, 2012, 57: 1903-1909, doi: 10.1007 Even though quantum hardware is still in its infancy, people widely believe that building a large-scale and functional quantum computer is merely a matter of time and concentrated effort. As the techniques of quantum devices progress, architectural studies will become critical for designing and implementing bigger quantum computing systems. Indeed, a research group from top US universities, including MIT and UC Berkeley, has conducted their research on quantum computing architecture, with support from the DARPA Quantum Information Program [1]. On the other hand, once quantum computers come into being, quantum software will play the key role in exploiting the power of quantum computers. However, today's software development methodologies and techniques are purely classical, and they are not suited to quantum computers. In the last 15 years, researchers began to realize the importance of quantum software. In fact, quantum software engineering was listed as a grand challenge in UK Grand Challenges in Computing Research, and the goal of research on quantum software is explained clearly by The challenge is to rework and extend the whole of classical software engineering into the quantum domain so that programmers can manipulate quantum programs with the same ease and confidence that they manipulate today's classical programs. In US, EU and Canada there are already several research teams devoting to theoretical studies of quantum software, in particular quantum programming. More recently in 2010, IARPA in US initiated a Quantum Computer Science Program, and one of its major research issues is high-level quantum programming languages and quantum programming environments, including quantum compilers. Two excellent survey papers of quantum programming are [3,4], two newer surveys are [5] by one of the authors and [6], and [7,8] also contain a brief survey of quantum programming. This paper will further review the field of quantum programming, with emphasis on the authors' recent work conducted at Tsinghua (China) and UTS (Australia). Another quantum programming research group in China is led by Profs. Jiafu Xu and Fangmin Song at Nanjing University [9].

show abstract

Probabilistic bisimulations for quantum processes

Cited by 24 publications

References 21 publications

The states of W-class as shared resources for perfect teleportation and superdense coding

The states of W-class as shared resources for perfect teleportation and superdense coding

QPMC: A Model Checker for Quantum Programs and Protocols

Quantum programming: From theories to implementations

Contact Info

Product

Resources

About