Results 1  10
of
17
Dagger compact closed categories and completely positive maps (Extended Abstract)
 QPL 2005
, 2005
"... ..."
Towards modelchecking quantum security protocols
 PROCEEDINGS OF THE FIRST WORKSHOP ON QUANTUM SECURITY: QSEC’07
, 2007
"... Logics for reasoning about quantum states have been given in the literature. In this paper, we extend one such logic with temporal constructs mimicking the standard computational tree logic used to reason about classical transition systems. We investigate the modelchecking problem for this temporal ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Logics for reasoning about quantum states have been given in the literature. In this paper, we extend one such logic with temporal constructs mimicking the standard computational tree logic used to reason about classical transition systems. We investigate the modelchecking problem for this temporal quantum logic and illustrate its use by reasoning about the BB84 key distribution protocol.
Quantum computation tree logic – model checking and complete calculus
 International Journal of Quantum Information
"... Logics for reasoning about quantum states and their evolution have been given in the literature. In this paper we consider Quantum Computation Tree Logic (QCTL), which adds temporal modalities to exogenous quantum propositional logic. We give a sound and complete axiomatization of QCTL and combine t ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Logics for reasoning about quantum states and their evolution have been given in the literature. In this paper we consider Quantum Computation Tree Logic (QCTL), which adds temporal modalities to exogenous quantum propositional logic. We give a sound and complete axiomatization of QCTL and combine the standard CTL modelchecking algorithm with the dEQPL modelchecking algorithm to obtain a modelchecking algorithm for QCTL. Finally we illustrate the use of the logic by reasoning about the BB84 key distribution protocol.
Programming Telepathy: Implementing Quantum Nonlocality Games
 SBMF 2008
, 2008
"... Quantum pseudotelepathy is an intriguing phenomenon which results from the application of quantum information theory to communication complexity. To demonstrate this phenomenon researchers in the field of quantum communication complexity devised a number of quantum nonlocality games. The setting o ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Quantum pseudotelepathy is an intriguing phenomenon which results from the application of quantum information theory to communication complexity. To demonstrate this phenomenon researchers in the field of quantum communication complexity devised a number of quantum nonlocality games. The setting of these games is as follows: the players are separated so that no communication between them is possible and are given a certain computational task. When the players have access to a quantum resource called entanglement, they can accomplish the task: something that is impossible in a classical setting. To an observer who is unfamiliar with the laws of quantum mechanics it seems that the players employ some sort of telepathy; that is, they somehow exchange information without sharing a communication channel. This paper provides a formal framework for specifying, implementing, and analysing quantum nonlocality games.
Abstract
, 2005
"... We propose a calculus of local equations over oneway measurement patterns [1], which preserves interpretations, and allows the rewriting of any pattern to a standard form where entanglement is done first, then measurements, then local corrections. We infer from this that patterns with no dependenci ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We propose a calculus of local equations over oneway measurement patterns [1], which preserves interpretations, and allows the rewriting of any pattern to a standard form where entanglement is done first, then measurements, then local corrections. We infer from this that patterns with no dependencies, or using only Pauli measurements, can only realise unitaries belonging to the Clifford group. 1
Proof rules for purely quantum programs
, 507
"... We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a purely quantum language fragment which describes the quantum part of a future quantum computer in Knill’s architecture. The denotational semantics, weakest precondition semantics, and weakest liberal preconditio ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a purely quantum language fragment which describes the quantum part of a future quantum computer in Knill’s architecture. The denotational semantics, weakest precondition semantics, and weakest liberal precondition semantics of this language fragment are introduced. To help reasoning about quantum programs involving quantum loops, we extend proof rules for classical probabilistic programs to our purely quantum programs. 1
Programming with Quantum Communication
"... Abstract. We present a formal framework for specifying, implementing, and analysing quantum communication protocols. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We present a formal framework for specifying, implementing, and analysing quantum communication protocols. 1
Heterotic Computing
"... Abstract. Nonclassical computation has tended to consider only single computational models: neural, analog, quantum, etc. However, combined computational models can both have more computational power, and more natural programming approaches, than such ‘pure ’ models alone. Here we outline a propose ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Nonclassical computation has tended to consider only single computational models: neural, analog, quantum, etc. However, combined computational models can both have more computational power, and more natural programming approaches, than such ‘pure ’ models alone. Here we outline a proposed new approach, which we term heterotic computing 4. We discuss how this might be incorporated in an accessible refinementbased computational framework for combining diverse computational models, and describe a range of physical exemplars (combinations of classical discrete, quantum discrete, classical analog, and quantum analog) that could be used to demonstrate the capability. 1
On Research: incremental semantics
, 2008
"... Centre of the United Nations University (UNU). It is based in Macao, and was founded in 1991. It started operations in July 1992. UNUIIST is jointly funded by the government of Macao and the governments of the People’s Republic of China and Portugal through a contribution to the UNU Endowment Fund. ..."
Abstract
 Add to MetaCart
Centre of the United Nations University (UNU). It is based in Macao, and was founded in 1991. It started operations in July 1992. UNUIIST is jointly funded by the government of Macao and the governments of the People’s Republic of China and Portugal through a contribution to the UNU Endowment Fund. As well as providing twothirds of the endowment fund, the Macao authorities also supply UNUIIST with its office premises and furniture and subsidise fellow accommodation. The mission of UNUIIST is to assist developing countries in the application and development of software technology. UNUIIST contributes through its programmatic activities: 1. Advanced development projects, in which software techniques supported by tools are applied, 2. Research projects, in which new techniques for software development are investigated, 3. Curriculum development projects, in which courses of software technology for universities in developing countries are developed, 4. University development projects, which complement the curriculum development projects by aiming to strengthen all aspects of computer science teaching in universities in developing countries, 5. Schools and Courses, which typically teach advanced software development techniques, 6. Events, in which conferences and workshops are organised or supported by UNUIIST, and
A Programmer’s Survey of the Quantum Computing Paradigm
, 2005
"... Research in quantum computation is looking for the consequences of having information encoding, processing and communication exploit the laws of quantum physics, i.e. the laws which govern the ultimate knowledge that we have, today, of the foreign world of elementary particles, as described by quan ..."
Abstract
 Add to MetaCart
Research in quantum computation is looking for the consequences of having information encoding, processing and communication exploit the laws of quantum physics, i.e. the laws which govern the ultimate knowledge that we have, today, of the foreign world of elementary particles, as described by quantum mechanics. This paper starts with a short survey of the principles which underlie quantum computing, and of some of the major breakthroughs brought by the first ten to fifteen years of research in this domain; quantum algorithms and quantum teleportation are very biefly presented. The next sections are devoted to one among the many directions of current research in the quantum computation paradigm, namely quantum programming languages and their semantics. A few other hot topics and open problems in quantum information processing and communication are mentionned in few words in the concluding remarks, the most difficult of them being the physical implementation of a quantum computer. The interested reader will find a list of useful references at the end of the paper.