Sciweavers

7 search results - page 1 / 2
» Notions of Bidirectional Computation and Entangled State Mon...
Sort
View
ENTCS
2007
174views more  ENTCS 2007»
13 years 4 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
13 years 10 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
ICFP
2005
ACM
14 years 4 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
GTTSE
2007
Springer
13 years 10 months ago
A Landscape of Bidirectional Model Transformations
Model transformations are a key element in the OMG’s Model Driven Development agenda. They did not begin here: the fundamental idea of transforming, automatically, one model into...
Perdita Stevens
LOGCOM
2010
120views more  LOGCOM 2010»
12 years 11 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli