Steve Bleiler

Learn More
We develop an octonionic representation of the payoff function for a three player, two strategy, maximally entangled quantum game. Up until now, to quantize games most authors have, like Meyer, focused their efforts on the quantization of the players' strategy spaces, essentially the domain of the payoff function that defines the game to be quantized (see(More)
This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary functions with no ancillary (garbage) bits. Existing algorithms are constrained to functions of small number of variables because they store the entire truth table of 2 n terms in memory or require a huge amount of time to yield results because they must(More)
  • 1