Related papers: Playing Pool with $|\psi \rangle$: from Bouncing B…
Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any system that allows superposition of states. A physical realization of this algorithm is described using coupled…
In the emerging domain of quantum algorithms, the Grover's quantum search is certainly one of the most significant. It is relatively simple, performs a useful task and more importantly, does it in an optimal way. However, due to the success…
The coherent tunneling phenomenon is investigated in rectangular billiards divided into two domains by a classically unclimbable potential barrier. We show that by placing a pointlike scatterer inside the billiard, we can control the…
Grover's algorithm is normally presented as a method of searching a database, however it would be more accurately described as a method of identifying elements of an interval of the integers which satisfy some logical clause - an example…
In a set of experiments, Couder et. al. demonstrate that an oscillating fluid bed may propagate a bouncing droplet through the guidance of the surface waves. We present a dynamical systems model, in the form of an iterative map, for a…
We study the coupling of bouncing-ball modes to chaotic modes in two-dimensional billiards with two parallel boundary segments. Analytically, we predict the corresponding decay rates using the fictitious integrable system approach.…
Grover's database search algorithm is the optimal algorithm for finding a desired object from an unsorted collection of items. Although it was discovered in the context of quantum computation, it is simple and versatile enough to be…
We present an extensive numerical study of spectral statistics and eigenfunctions of quantized triangular billiards. We compute two million consecutive eigenvalues for six representative cases of triangular billiards, three with generic…
We design a computational experiment in which a quantum particle tunnels into a billiard of variable shape and scatters out of it through a double-slit opening on the billiard's base. The interference patterns produced by the scattered…
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect…
We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the…
Here, we present the quantum version of a very famous statistical decision problem, whose classical version is counter-intuitive to many. The Monty Hall game can be phrased as a two person game between Alice and Bob. In their pioneering…
This tutorial paper introduces quantum approaches to Monte Carlo computation with applications in computational finance. We outline the basics of quantum computing using Grover's algorithm for unstructured search to build intuition. We then…
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most…
We study the convergence towards the equilibrium for a dissipative and stochastic time-dependent oval billiard. The dynamics of the system is described by using a generic four dimensional nonlinear map for the variables: the angular…
We show how the properties of the cosmological billiards provide useful information (spacetime dimension and $p$-form spectrum) on the oxidation endpoint of the oxidation sequence of gravitational theories. We compare this approach to the…
We classify the periodic digit strings which arise from periodic billiard orbits on the four convex $n$-gons $\Delta$ which tile $\mathbb{R}^2$ under reflection, answering problem a posed by Baxter and Umble. $\Delta$ is either an…
We introduce a geometric dynamical system where iteration is defined as a cycling composition of different maps acting on a space composed of three or more lines in $\mathbb{R}^2$. This system is motivated by the dynamics of iterated…
Quantum Computing offers an entirely new way of doing computation governed by the rules of quantum mechanics like Superposition and Entanglement. These rules allow us to do computation over all the possible states simultaneously. Hence,…
The Seba billiard, a rectangular torus with a point scatterer, is a popular model to study the transition between integrability and chaos in quantum systems. Whereas such billiards are classically essentially integrable, they may display…