The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A general definition of a quantum predicate and quantum labelled transition systems for finite quantum computation systems is presented. The notion of a quantum predicate as a positive operator-valued measure is developed. The main results of this paper are a theorem about the existence of generalised predicates for quantum programs defined as completely positive maps and a theorem about the existence of a GSOS format for quantum labelled transition systems. The first theorem is a slight generalisation...
We introduce a new model of cellular automaton called a one-dimensional number-conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a triple of non-negative integers, and the total (i.e., sum) of integers over the configuration is conserved throughout its evolving (computing) process. It can be thought as a kind of modelization of the physical conservation law of mass (particles) or energy. We also define a reversible version of...
We introduce a new model of cellular automaton called a
one-dimensional number-conserving partitioned cellular automaton (NC-PCA).
An NC-PCA is a system such that a state of a cell is represented by a
triple of non-negative integers, and the total (i.e., sum) of integers over
the configuration is conserved throughout its evolving (computing) process.
It can be thought as a kind of modelization of the physical conservation
law of mass (particles) or energy.
We also define a reversible version...
Currently displaying 1 –
5 of
5