A Technique for Verifying Measurements

Authors:
Keye Martin;Prakash Panangaden
Affiliations:
Center for High Assurance Computer Systems, U.S. Naval Research Laboratory, Washington D.C. 20375, United States of America and School of Computer Science, McGill University, Montreal, Quebec H3A ...;Center for High Assurance Computer Systems, U.S. Naval Research Laboratory, Washington D.C. 20375, United States of America and School of Computer Science, McGill University, Montreal, Quebec H3A ...
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 6
Cited 1

Domain theory

Handbook of logic in computer science (vol. 3)
A foundation for computation

A foundation for computation
Entropy as a fixed point

Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Topology in information theory in topology

Theoretical Computer Science
Algebraic Information Theory For Binary Channels

Electronic Notes in Theoretical Computer Science (ENTCS)
Majorization and the interconversion of bipartite states

Quantum Information & Computation

Presenting Dcpos and Dcpo Algebras

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a technique that can be used to prove that a given function is a measurement. We demonstrate its applicability by using it to resolve three notoriously difficult cases: capacity in information theory, entropy in quantum mechanics and global time in general relativity. We then show that this technique provides a new and surprising characterization of measurement. Thus, in principle, it can always be used.