Communication Complexity Protocol for Q-trits

Consider a function where its entries are distributed among many parties. Suppose each party is allowed to transmit only a limited amount of information to a net. One can use a classical protocol to guess the value of the global function. Is there a quantum protocol improving the results of all classical protocols? Brukner et. al. showed the deep connection between such problems and the theory of Bell's inequalities. Here we generalize the theory to trits. There the best classical protocol fails whereas the quantum protocol yields the correct answer.Comment: 8 page

Double-ended queues and joint moments of left-right canonical operators on full Fock space

We follow the guiding line offered by canonical operators on the full Fock space, in order to identify what kind of cumulant functionals should be considered for the concept of bi-free independence introduced in the recent work of Voiculescu. By following this guiding line we arrive to consider, for a general noncommutative probability space (A, phi), a family of "(l,r)-cumulant functionals" which enlarges the family of free cumulant functionals of the space. In the motivating case of canonical operators on the full Fock space we find a simple formula for a relevant family of (l,r)-cumulants of a (2d)-tuple (A_1, ..., A_d, B_1, ..., B_d), with A_1, ... , A_d canonical operators on the left and B_1, ... , B_d canonical operators on the right. This extends a known one-sided formula for free cumulants of A_1, ..., A_d, which establishes a basic operator model for the R-transform of free probability.Comment: In this (final) version, the introduction was re-written to better show the motivation for the question considered in the pape

Systematic errors due to linear congruential random-number generators with the Swendsen-Wang algorithm: A warning

We show that linear congruential pseudo-random-number generators can cause systematic errors in Monte Carlo simulations using the Swendsen-Wang algorithm, if the lattice size is a multiple of a very large power of 2 and one random number is used per bond. These systematic errors arise from correlations within a single bond-update half-sweep. The errors can be eliminated (or at least radically reduced) by updating the bonds in a random order or in an aperiodic manner. It also helps to use a generator of large modulus (e.g. 60 or more bits).Comment: Revtex4, 4 page

Information-Based Physics: An Observer-Centric Foundation

It is generally believed that physical laws, reflecting an inherent order in the universe, are ordained by nature. However, in modern physics the observer plays a central role raising questions about how an observer-centric physics can result in laws apparently worthy of a universal nature-centric physics. Over the last decade, we have found that the consistent apt quantification of algebraic and order-theoretic structures results in calculi that possess constraint equations taking the form of what are often considered to be physical laws. I review recent derivations of the formal relations among relevant variables central to special relativity, probability theory and quantum mechanics in this context by considering a problem where two observers form consistent descriptions of and make optimal inferences about a free particle that simply influences them. I show that this approach to describing such a particle based only on available information leads to the mathematics of relativistic quantum mechanics as well as a description of a free particle that reproduces many of the basic properties of a fermion. The result is an approach to foundational physics where laws derive from both consistent descriptions and optimal information-based inferences made by embedded observers.Comment: To be published in Contemporary Physics. The manuscript consists of 43 pages and 9 Figure

Modeling a Sensor to Improve its Efficacy

Robots rely on sensors to provide them with information about their surroundings. However, high-quality sensors can be extremely expensive and cost-prohibitive. Thus many robotic systems must make due with lower-quality sensors. Here we demonstrate via a case study how modeling a sensor can improve its efficacy when employed within a Bayesian inferential framework. As a test bed we employ a robotic arm that is designed to autonomously take its own measurements using an inexpensive LEGO light sensor to estimate the position and radius of a white circle on a black field. The light sensor integrates the light arriving from a spatially distributed region within its field of view weighted by its Spatial Sensitivity Function (SSF). We demonstrate that by incorporating an accurate model of the light sensor SSF into the likelihood function of a Bayesian inference engine, an autonomous system can make improved inferences about its surroundings. The method presented here is data-based, fairly general, and made with plug-and play in mind so that it could be implemented in similar problems.Comment: 18 pages, 8 figures, submitted to the special issue of "Sensors for Robotics

A Spinorial Formulation of the Maximum Clique Problem of a Graph

We present a new formulation of the maximum clique problem of a graph in complex space. We start observing that the adjacency matrix A of a graph can always be written in the form A = B B where B is a complex, symmetric matrix formed by vectors of zero length (null vectors) and the maximum clique problem can be transformed in a geometrical problem for these vectors. This problem, in turn, is translated in spinorial language and we show that each graph uniquely identifies a set of pure spinors, that is vectors of the endomorphism space of Clifford algebras, and the maximum clique problem is formalized in this setting so that, this much studied problem, may take advantage from recent progresses of pure spinor geometry

Random and exhaustive generation of permutations and cycles

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. This algorithm is very similar to the standard method for generating a random permutation, but is less well known. We consider both methods in a unified way, and discuss their relation with exhaustive generation methods. We analyse several random variables associated with the algorithms and find their grand probability generating functions, which gives easy access to moments and limit laws.Comment: 9 page

Anomalous diffusion at percolation threshold in high dimensions on 10^18 sites

Using an inverse of the standard linear congruential random number generator, large randomly occupied lattices can be visited by a random walker without having to determine the occupation status of every lattice site in advance. In seven dimensions, at the percolation threshold with L^7 sites and L < 420, we confirm the expected time-dependence of the end-to-end distance (including the corrections to the asymptotic behavior).Comment: 8 pages including figures, presentation improved, for Int.J.Mod.Phys.

A generatingfunctionology approach to a problem of Wilf

Wilf posed the following problem: determine asymptotically as $n\to\infty$ the probability that a randomly chosen part size in a randomly chosen composition of n has multiplicity m. One solution of this problem was given by Hitczenko and Savage. In this paper, we study this question using the techniques of generating functions and singularity analysis.Comment: 12 page

Molecular dynamics simulations of ballistic annihilation

Using event-driven molecular dynamics we study one- and two-dimensional ballistic annihilation. We estimate exponents $\xi$ and $\gamma$ that describe the long-time decay of the number of particles ($n(t)\sim t^{-\xi}$) and of their typical velocity ($v(t)\sim t^{-\gamma}$). To a good accuracy our results confirm the scaling relation $\xi + \gamma =1$. In the two-dimensional case our results are in a good agreement with those obtained from the Boltzmann kinetic theory.Comment: 4 pages; some changes; Physical Review E (in press