Related papers: Playing Pool with $|\psi \rangle$: from Bouncing B…
Billiards tables - a minimal model for particles moving in a confined region - are known to present classical (and quantum) different features according to their shape, ranging from strongly chaotic to integrable dynamics. Here we consider…
Classical transport in a doubly connected polygonal billiard, i.e. the annulus square billiard, is considered. Dynamical properties of the billiard flow with a fixed initial direction are analyzed by means of the moments of arbitrary order…
We show how the Gillespie algorithm, originally developed to describe coupled chemical reactions, can be used to perform numerical simulations of a granular intruder particle colliding with thermalized bath particles. The algorithm…
We study the dynamics of one-particle and few-particle billiard systems in containers of various shapes. In few-particle systems, the particles collide elastically both against the boundary and against each other. In the one-particle case,…
Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in a faster way than any other known classical…
The arithmetic triangular billiards are classically chaotic but have Poissonian energy level statistics, in ostensible violation of the BGS conjecture. We show that the length spectra of their periodic orbits divides into subspectra…
We analyse the classical and quantum behaviour of a particle trapped in a diamond shaped billiard. We defined this billiard as a half stadium connected with a triangular billiard. A parameter $\xi$ which gradually change the shape of the…
We offer some theorems, mainly of finiteness, for certain patterns in elliptical billiards, related to periodic trajectories. For instance, if two players hit a ball at a given position and with directions forming a fixed angle in…
The barrier billiard is the simplest example of pseudo-integrable models with interesting and intricate classical and quantum properties. Using the Wiener-Hopf method it is demonstrated that quantum mechanics of a rectangular billiard with…
In information theory, one area of interest is gambling, where mutual information characterizes the maximal gain in wealth growth rate due to knowledge of side information; the betting strategy that achieves this maximum is named the Kelly…
Billiard models of single particles moving freely in two-dimensional regions enclosed by hard walls, have long provided ideal toy models for the investigation of dynamical systems and chaos. Recently, billiards with (semi-)permeable walls…
This article demonstrates a new approach to finding ideal bowling targeting strategies through computer simulation. To model bowling ball behaviour, a system of five coupled differential equations is derived using Euler equations for rigid…
The poles of the S-matrix and the wave functions of open 2D quantum billiards with convex boundary of different shape are calculated by the method of complex scaling. Two leads are attached to the cavities. The conductance of the cavities…
For a given rotation number we compute the Hausdorff dimension of the set of well approximable numbers. We use this result and an inhomogeneous version of Jarnik's theorem to show strong recurrence properties of the billiard flow in certain…
An approach towards quantum games is proposed that uses the unusual probabilities involved in EPR-type experiments directly in two-player games.
The dynamics of a system consisting of many spherical hard particles can be described as a single point particle moving in a high-dimensional space with fixed hypercylindrical scatterers with specific orientations and positions. In this…
In this work we address two questions concerning Grover's algorithm. In the first we give an answer to the question how to employ Grover's algorithm for actual search over database. We introduce a quantum model of an unordered phone book…
The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search…
We study analytically and numerically the classical diffusive process which takes place in a chaotic billiard. This allows to estimate the conditions under which the statistical properties of eigenvalues and eigenfunctions can be described…
Studies on Quantum Computing have been developed since the 1980s, motivating researches on quantum algorithms better than any classical algorithm possible. An example of such algorithms is Grover's algorithm, capable of finding $k$ (marked)…