相关论文: Playing Pool with $|\psi \rangle$: from Bouncing B…

Galperin introduced an interesting method to learn the digits of $\pi $ by counting the collisions of two billiard balls and a hard wall. This paper studies two quantum versions of the Galperin billiards. It is shown that the digits of $\pi…

In Galperin billiards, two balls colliding with a hard wall form an analog calculator for the digits of the number $\pi$. This classical, one-dimensional three-body system (counting the hard wall) calculates the digits of $\pi$ in a base…

Have you ever played or watched a game of pool? If so, you have already seen a billiard system in action. In mathematics and physics, a billiard system describes a ball that moves in straight lines and bounces off walls. Despite these…

By making use of the greatest common divisor's ($gcd$) properties we can highlight some connections between playing billiard inside a unit square and the Fibonacci sequence as well as the Euclidean algorithm. In particular by defining two…

Starting from billiard partitions which arose recently in the description of periodic trajectories of ellipsoidal billiards in $d$-dimensional Euclidean space, we introduce a new type of separable integer partition classes, called type B.…

We indulge in what mathematicians call frivolous activities. In Arithmetic Billiards, a ball is bouncing around in a rectangle. In Parity Checkers we place checkers on a checkerboard under certain parity constraints. Both activities turn…

This paper explores two instances where dissipation plays a crucial role in curbing the unbounded energy growth of particles in time-dependent billiards. The first example involves an elliptical-like billiard with inelastic collisions…

Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…

This paper studies a well-known $\pi$ machine illustrated by Fig.(1). It is shown that the $\pi$ machine can compute digits of $\pi$ if the ratio of block weights, $m_2/m_1$, satisfies certain conditions, and that dynamics of the $\pi$…

Mathematical billiards is much like the real game: a point mass, representing the ball, rolls in a straight line on a (perfectly friction-less) table, striking the sides according to the law of reflection. A billiard trajectory is then…

The problem of two interacting particles moving in a d-dimensional billiard is considered here. A suitable coordinate transformation leads to the problem of a particle in an unconventional hyperbilliard. A dynamical map can be readily…

Recently were introduced physical billiards where a moving particle is a hard sphere rather than a point as in standard mathematical billiards. It has been shown that in the same billiard tables the physical billiards may have totally…

We consider polygonal billiards and we show the uniqueness of coding of non-periodic billiard trajectories in polygons whose holes have non-zero minimal diameters, generalising a theorem of Galperin, Kr\"uger and Troubetzkoy.

Many poker systems, whether created with heuristics or machine learning, rely on the probability of winning as a key input. However calculating the precise probability using combinatorics is an intractable problem, so instead we approximate…

We present a game inspired by research on the possible number of billiard ball collisions in the whole Euclidean space. One player tries to place $n$ static "balls" with zero radius (i.e., points) in a way that will minimize the total…

We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the…

H${\acute{e}}$non [8] used an inclined billiard to investigate aspects of chaotic scattering which occur in satellite encounters and in other situations. His model consisted of a piecewise mapping which described the motion of a point…

Hit-and-Run is known to be one of the best random sampling algorithms, its mixing time is polynomial in dimension. Nevertheless, in practice the number of steps required to achieve uniformly distributed samples is rather high. We propose…

This paper is a written version of a one hour lecture given on Lov Grover's database search algorithm. Table Of Contents 1 ... Problem Definition 2 ... The quantum mechanical perspective 3 ... Properties of the inversion I_|psi> 4 ... The…

We study the classical and quantum mechanics of a three-dimensional stadium billiard. It consists of two quarter cylinders that are rotated with respect to each other by 90 degrees, and it is classically chaotic. The billiard exhibits only…