Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0408002

Contextual Observables and Quantum Information

Marian Kupczyński

Published Jul 31, 2004• 7 citations
arXivHTMLPDF

Abstract

In this short paper we present the main features of a new quantum programming language proposed recently by Peter Selinger which gives a good idea about the difficulties of constructing a scalable quantum computer. We show how some of these difficulties are related to the contextuality of quantum observables and to the abstract and statistical character of quantun theory (QT). We discuss also, in some detail, the statistical interpretation (SI) of QT and the contextuality of observables indicating the importance of these concepts for the whole domain of quantum information.

DOI
10.48550/arxiv.quant-ph/0408002

Related papers

A Hierarchy of Quantum Semantics

Simon Perdrix

Several domains [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004; B. Coecke and K. Martin. A partial order on classical and quantum states. Technical report, PRG-RR-02-07, 2002; Ph. Jorrand and S. Perdrix. Towards a quantum calculus. In To appear in Proceedings of the 4th International Workshop on Quantum Programming Languages, ENTCS, 2006; P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004] can be used to define the semantics of quantum programs. Among them Abramsky [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004] has introduced a semantics based on probabilistic power domains, whereas the one by Selinger [P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004] associates with every program a completely positive map. In this paper, we mainly introduce a semantical domain based on admissible transformations, i.e. multisets of linear operators. In order to establish a comparison with existing domains, we introduce a simple quantum imperative language (QIL), equipped with three different denotational semantics, called pure, observable, and admissible respectively. The pure semantics is a natural extension of probabilistic (classical) semantics and is similar to the semantics proposed by Abramsky [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004]. The observable semantics, à la Selinger [P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004], associates with any program a superoperator over density matrices. Finally, we introduce an admissible semantics which associates with any program an admissible transformation. These semantics are not equivalent, but exact abstraction [P. Cousot. Types as abstract interpretations. In POPL, pages 316–331, 1997] or interpretation relations are established between them, leading to a hierarchy of quantum semantics.

Electronic Notes in Theoretical Computer Science•Nov 1, 2008•6 citations

The essence of quantum theory for computers

William C. Parke

. Quantum computers take advantage of interfering quantum alternatives in order to handle problems that might be too time consuming with algorithms based on classical logic. Developing quantum computers requires new ways of thinking beyond those in the familiar classical world. To help in this thinking, we give a description of the foundational ideas that hold in all of our successful physical models, including quantum theory. Our emphasis will be on the proper interpretation of our theories, and not just their statements. Our tact will be to build on the concept of information, which lies central to the operation of not just computers, but the Universe. For application to quantum computing, the essence of quantum theory is given, together with special precautions and limitations. Introduction. Having a grasp on the ideas behind a theory helps to apply it correctly, to understand its limitations, and to generate new ideas. Getting a firm hold on quantum theory is not an easy task, because our experiences and even our genetic predispositions have been developed in a world in which quantum effects are largely washed out. Remarkably, our predilection for finding logic behind the behavior of what we observe, including that of electrons and atoms, has led us to quantum theory, a description of nature that is hard for us to conceptualize, but is logical, accurate, and explains a wide variety of phenomena with only a few statements and input. As background to quantum theory and quantum computing, an attempt is made here to give the primitive notions and essential observations that underlie current physical theories, so that foundational ideas are explicit, and a common language is established. In our description, information storage and transfer is made central. A short description of quantum theory follows, and then applied to quantum computing, focusing on what the theory says, and particularly does not say, in areas where conceptual difficulties have arisen. Physical theory and reality. A physical theory is a logical model capable of making predictions of what we observe. It is judged by its accuracy in matching measurements, and by its economy, i.e. whether the proposed theory has only a few relationships and input data needed for its ability to explain observations over a wide realm.

arXiv:1409.2790•Cambridge University Press eBooks•Feb 26, 2016•0 citations

On Contextuality as a Feature of Logic and Probability Theory

Ask Ellingsen

In quantum mechanics, not everything that can be observed can be observed simultaneously. Observational data exhibits \emph{contextuality} -- a generalisation of nonlocality -- if the result of an observation is necessarily dependent on which combination of observables was measured. This article gives a mathematical introduction to contextuality, emphasising its nature as a general feature of probability theory and logic, rather than of any particular quantum theory.

quant-pharXiv:2603.11857•Complex Analysis and Operator Theory•Mar 13, 2026•0 citations

Challenges in Quantum Programming Languages (Invited Talk)

Peter Selinger

In this talk, I will give an overview of some recent progress and current challenges in the design of quantum programming languages. Unlike classical programs, which can in principle be debugged by stopping the program at critical moments and examining the contents of variables, quantum programs are not amenable to traditional debugging because the state of a quantum system cannot usually be examined in a meaningful way. Therefore, we need other methods for ensuring the correctness of quantum programs, such as formal verification. For this reason, I advocate the use of strongly typed, functional programming languages for quantum computing. As far as functional quantum programming languages are concerned, there is currently a relatively wide gap between theory and practice. On the one hand, we have languages with strong theoretical foundations, such as the quantum lambda calculus, which operate at a relatively low level of abstraction and lack many features that would be useful to practical quantum programmers. On the other hand, we have practical functional quantum programming languages such as Quipper, which is implemented as an embedded language in Haskell, has many high-level features, and has been used in large-scale projects, but lacks a theoretical basis and a strong type system [Green et al., 2013; Green et al., 2013; Green et al., 2013; Smith et al., 2014]. We have recently attempted to narrow this gap through a family of languages called Proto-Quipper, which are designed to offer Quipper-like features while having sound theoretical foundations [Ross, 2015; Rios and Selinger, 2018]. I will give an overview of Quipper and its most useful features, report on the progress we made with formalizing fragments of Quipper, and outline several of the still remaining challenges.

Leibniz international proceedings in informatics•Jan 1, 2018•2 citations

Quantum Theory: An Information Processing Approach

Jochen Rau

Recent advances in quantum technology – from quantum computers and simulators to communication and metrology – have not only opened up a whole new world of applications but also changed the understanding of quantum theory itself. This text introduces quantum theory entirely from this new perspective. It does away with the traditional approach to quantum theory as a theory of microscopic matter, and focuses instead on quantum theory as a framework for information processing. Accordingly, the emphasis is on concepts like measurement, probability, statistical correlations, and transformations, rather than waves and particles. The text begins with experimental evidence that forces one to abandon the classical description and to re-examine such basic notions as measurement, probability, and state. Thorough investigation of these concepts leads to the alternative framework of quantum theory. The requisite mathematics is developed and linked to its operational meaning. This part of the text culminates in an exploration of some of the most vexing issues of quantum theory, regarding locality, non-contextuality, and realism. The second half of the text explains how the peculiar features of quantum theory are harnessed to tackle information processing tasks that are intractable or even impossible classically. It provides the tools for understanding and designing the pertinent protocols, and discusses a range of examples representative of current quantum technology.

Oxford University Press eBooks•May 27, 2021•3 citations

Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity

Samson Abramsky

We discuss quantum non-locality and contextuality, emphasising logical and structural aspects. We also show how the same mathematical structures arise in various areas of classical computation.

arXiv:1406.7386•Advanced series on mathematical psychology•Nov 24, 2015•34 citations
In this short paper we present the main features of a new quantum programming language proposed recently by Peter Selinger which gives a good idea about the difficulties of constructing a scalable quantum computer. We show how some of these difficulties are related to the contextuality of quantum observables and to the abstract and statistical character of quantun theory (QT). We discuss also, in some detail, the statistical interpretation (SI) of QT and the contextuality of observables indicating the importance of these concepts for the whole domain of quantum information.
Several domains [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004; B. Coecke and K. Martin. A partial order on classical and quantum states. Technical report, PRG-RR-02-07, 2002; Ph. Jorrand and S. Perdrix. Towards a quantum calculus. In To appear in Proceedings of the 4th International Workshop on Quantum Programming Languages, ENTCS, 2006; P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004] can be used to define the semantics of quantum programs. Among them Abramsky [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004] has introduced a semantics based on probabilistic power domains, whereas the one by Selinger [P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004] associates with every program a completely positive map. In this paper, we mainly introduce a semantical domain based on admissible transformations, i.e. multisets of linear operators. In order to establish a comparison with existing domains, we introduce a simple quantum imperative language (QIL), equipped with three different denotational semantics, called pure, observable, and admissible respectively. The pure semantics is a natural extension of probabilistic (classical) semantics and is similar to the semantics proposed by Abramsky [S. Abramsky. A Cook's tour of a simple quantum programming language. 3rd International Symposium on Domain Theory, Xi'an, China, May 2004]. The observable semantics, à la Selinger [P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004], associates with any program a superoperator over density matrices. Finally, we introduce an admissible semantics which associates with any program an admissible transformation. These semantics are not equivalent, but exact abstraction [P. Cousot. Types as abstract interpretations. In POPL, pages 316–331, 1997] or interpretation relations are established between them, leading to a hierarchy of quantum semantics.
. Quantum computers take advantage of interfering quantum alternatives in order to handle problems that might be too time consuming with algorithms based on classical logic. Developing quantum computers requires new ways of thinking beyond those in the familiar classical world. To help in this thinking, we give a description of the foundational ideas that hold in all of our successful physical models, including quantum theory. Our emphasis will be on the proper interpretation of our theories, and not just their statements. Our tact will be to build on the concept of information, which lies central to the operation of not just computers, but the Universe. For application to quantum computing, the essence of quantum theory is given, together with special precautions and limitations. Introduction. Having a grasp on the ideas behind a theory helps to apply it correctly, to understand its limitations, and to generate new ideas. Getting a firm hold on quantum theory is not an easy task, because our experiences and even our genetic predispositions have been developed in a world in which quantum effects are largely washed out. Remarkably, our predilection for finding logic behind the behavior of what we observe, including that of electrons and atoms, has led us to quantum theory, a description of nature that is hard for us to conceptualize, but is logical, accurate, and explains a wide variety of phenomena with only a few statements and input. As background to quantum theory and quantum computing, an attempt is made here to give the primitive notions and essential observations that underlie current physical theories, so that foundational ideas are explicit, and a common language is established. In our description, information storage and transfer is made central. A short description of quantum theory follows, and then applied to quantum computing, focusing on what the theory says, and particularly does not say, in areas where conceptual difficulties have arisen. Physical theory and reality. A physical theory is a logical model capable of making predictions of what we observe. It is judged by its accuracy in matching measurements, and by its economy, i.e. whether the proposed theory has only a few relationships and input data needed for its ability to explain observations over a wide realm.
In this talk, I will give an overview of some recent progress and current challenges in the design of quantum programming languages. Unlike classical programs, which can in principle be debugged by stopping the program at critical moments and examining the contents of variables, quantum programs are not amenable to traditional debugging because the state of a quantum system cannot usually be examined in a meaningful way. Therefore, we need other methods for ensuring the correctness of quantum programs, such as formal verification. For this reason, I advocate the use of strongly typed, functional programming languages for quantum computing. As far as functional quantum programming languages are concerned, there is currently a relatively wide gap between theory and practice. On the one hand, we have languages with strong theoretical foundations, such as the quantum lambda calculus, which operate at a relatively low level of abstraction and lack many features that would be useful to practical quantum programmers. On the other hand, we have practical functional quantum programming languages such as Quipper, which is implemented as an embedded language in Haskell, has many high-level features, and has been used in large-scale projects, but lacks a theoretical basis and a strong type system [Green et al., 2013; Green et al., 2013; Green et al., 2013; Smith et al., 2014]. We have recently attempted to narrow this gap through a family of languages called Proto-Quipper, which are designed to offer Quipper-like features while having sound theoretical foundations [Ross, 2015; Rios and Selinger, 2018]. I will give an overview of Quipper and its most useful features, report on the progress we made with formalizing fragments of Quipper, and outline several of the still remaining challenges.
Recent advances in quantum technology – from quantum computers and simulators to communication and metrology – have not only opened up a whole new world of applications but also changed the understanding of quantum theory itself. This text introduces quantum theory entirely from this new perspective. It does away with the traditional approach to quantum theory as a theory of microscopic matter, and focuses instead on quantum theory as a framework for information processing. Accordingly, the emphasis is on concepts like measurement, probability, statistical correlations, and transformations, rather than waves and particles. The text begins with experimental evidence that forces one to abandon the classical description and to re-examine such basic notions as measurement, probability, and state. Thorough investigation of these concepts leads to the alternative framework of quantum theory. The requisite mathematics is developed and linked to its operational meaning. This part of the text culminates in an exploration of some of the most vexing issues of quantum theory, regarding locality, non-contextuality, and realism. The second half of the text explains how the peculiar features of quantum theory are harnessed to tackle information processing tasks that are intractable or even impossible classically. It provides the tools for understanding and designing the pertinent protocols, and discusses a range of examples representative of current quantum technology.