Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Fractional revival “matrix mechanics” in quantum billiards

Bernd Rohwedder

Published Jul 21, 2008• 1 citation
Publisher

Abstract

Certain classes of integrable quantum billiards provide a versatile arena for time-domain atom optics experiments. In order to learn how to fully exploit the fractional revival behavior that governs these kinds of systems, we here develop a convenient theoretical framework for their description. As an illustrative example, we present a billiard-internal realization of Grover's quantum search algorithm. The considered devices are scalable and could be used for the construction of quantum computers using trapped neutral atoms.

DOI
10.1103/physreva.78.012340

Related papers

Quantum billiard atom optics

Bernd Rohwedder

The phenomenon of fractional self-imaging can be used to implement atom-optical components in the interior of a rectangular quantum billiard. Their temporal concatenation may lead to complex "atom chips" operating in the time-domain. As an elementary example, we discuss a billiard internal Mach-Zehnder interferometer that can be transformed into an all-optical switch or controllable beam splitter for atoms. The inherent coherence and reversibility of its dynamics also provides a simple means to realize a Welcher Weg/Quantum erasure experiment. The whole concept is shown to be robust with respect to realistic wall-softness effects and feasible within the present state of the art.

Europhysics Letters (EPL)•Nov 1, 2002•5 citations

Generalized fractional revival on graphs

Whitney Drazen

A continuous-time quantum walk is a process on a network of quantum particles that is governed by the transition matrix $U(t) = e^{-itA}$, where is $A$ is the adjacency matrix of the graph representing the network. Certain instantaneous phenomena occuring in quantum walks can be utilized in quantum computing algorithms. The two-vertex phenomenon fractional revival occurs between vertices $u$ and $v$ at time $t$ if the columns of $U(t)$ corresponding to $u$ and $v$ are only supported on the rows indexed by those same two vertices. This means that given any initial state supported only on vertices $u$ and $v$, the state of the system at time $t$ will again be supported only on those same two vertices. Fractional revival can be used to generate entanglement between two quantum particles. We will discuss $K$-fractional revival, the generalization of fractional revival to $K$, a larger subset of the vertices in our graph. We will also explore the related concept approximate $K$-fractional revival, which denotes the existence of a sequence of times for which $U(t)$ comes arbitrarily close to achieving $K$-fractional revival. Next, we will examine some spectral characterizations of these phenomena, which will allow us to determine if a given graph exhibits either $K$-fractional revival or approximate $K$-fractional revival. Lastly, we will detail families of examples of approximate $K$-fractional revival on path graphs.--Author's abstract

•Jan 1, 2021•0 citations

Controlling the stability of motion in atom-optics billiards

N. Friedman, Ariel Kaplan, Dina Carasso +1 more

Summary form only given. The motion of a particle inside a closed area surrounded by reflecting walls can be integrable or chaotic, depending on the shape of the boundary. These billiards serve as a good and simple model to study chaotic dynamics both classically and quantum mechanically. Recently, we realized an "atom-optics billiard", where ultra-cold atoms are trapped inside a dark optical trap, whose shape can be varied to create different atom dynamics. In this work we describe how scattering and wall softness influence the dynamics of the atoms, and destroy or create stability.

Quantum Electronics and Laser Science Conference•Nov 13, 2002•1 citation

Quantum Algorithms for Searching Manifolds

Hooman Sherkat-Massoom

Quantum computing is a system of computation that exploits the quantum-mechanical nature of reality at nano-scales in order to perform certain operations in a way that can scale better than is possible with classical computing. While the hardware sideof quantum computing is still in its infancy, many quantum algorithms - sets of instructions to run on a quantum computer in order to complete particular tasks - have been designed and analyzed. One of the most famous of these is Grover’s algorithm, an algorithm for searching a database. Two types of generalizations of Grover’s algorithm have been studied: spatial search algorithms (algorithms for searching discrete spaces) and “analog” search algorithms (algorithms performed by the evolution of physical systems). We develop and analyze algorithms that are generalizations of both those generalizations – an analog search algorithm for searching continuous, rather than discrete, spaces.

•Jan 1, 2018•0 citations

Quantum wave packet analysis in the rectangular billiard

Lin Sheng-Lu

The use of wave packet to analyze the dynamics of quantum mechanical systems is an increasingly important method to the study of the classical-quantum correspondence.Using the quantum Gaussian wave packet analysis method,we calculate the autocorrelation function of the rectangular billiard,the peak positions of the autocorrelation function match well with the periods of the classical periodic orbits,which show that the period of the classical orbits can be produced by the time-dependent quantum wave packet method.We also discuss wave packet revivals and fractional revivals in the rectangular billiard,the results show that there are exact revival for all wave packet at each revival time.We find additional cases of exact revivals with short revival times for zero-momentum wave packets initially located at special symmetry point inside the billiard.

Journal of Atomic and Molecular Physics•Jan 1, 2007•0 citations

Realization of Loschmidt Echo in Atom Optics Billiard

Tzahi Grünzweig, Yoav Sagi, Y. Wang +3 more

Loschmidt echo of atoms trapped in atom optics billiards with chaotic and mixed dynamics is realized by performing a microwave Ramsey sequence to their internal state.

Conference on Lasers and Electro-Optics•May 1, 2007•0 citations
Certain classes of integrable quantum billiards provide a versatile arena for time-domain atom optics experiments. In order to learn how to fully exploit the fractional revival behavior that governs these kinds of systems, we here develop a convenient theoretical framework for their description. As an illustrative example, we present a billiard-internal realization of Grover's quantum search algorithm. The considered devices are scalable and could be used for the construction of quantum computers using trapped neutral atoms.
The phenomenon of fractional self-imaging can be used to implement atom-optical components in the interior of a rectangular quantum billiard. Their temporal concatenation may lead to complex "atom chips" operating in the time-domain. As an elementary example, we discuss a billiard internal Mach-Zehnder interferometer that can be transformed into an all-optical switch or controllable beam splitter for atoms. The inherent coherence and reversibility of its dynamics also provides a simple means to realize a Welcher Weg/Quantum erasure experiment. The whole concept is shown to be robust with respect to realistic wall-softness effects and feasible within the present state of the art.
A continuous-time quantum walk is a process on a network of quantum particles that is governed by the transition matrix U(t)=e−itAU(t) = e^{-itA}U(t)=e−itA, where is AAA is the adjacency matrix of the graph representing the network. Certain instantaneous phenomena occuring in quantum walks can be utilized in quantum computing algorithms. The two-vertex phenomenon fractional revival occurs between vertices uuu and vvv at time ttt if the columns of U(t)U(t)U(t) corresponding to uuu and vvv are only supported on the rows indexed by those same two vertices. This means that given any initial state supported only on vertices uuu and vvv, the state of the system at time ttt will again be supported only on those same two vertices. Fractional revival can be used to generate entanglement between two quantum particles. We will discuss KKK-fractional revival, the generalization of fractional revival to KKK, a larger subset of the vertices in our graph. We will also explore the related concept approximate KKK-fractional revival, which denotes the existence of a sequence of times for which U(t)U(t)U(t) comes arbitrarily close to achieving KKK-fractional revival. Next, we will examine some spectral characterizations of these phenomena, which will allow us to determine if a given graph exhibits either KKK-fractional revival or approximate KKK-fractional revival. Lastly, we will detail families of examples of approximate KKK-fractional revival on path graphs.--Author's abstract
Summary form only given. The motion of a particle inside a closed area surrounded by reflecting walls can be integrable or chaotic, depending on the shape of the boundary. These billiards serve as a good and simple model to study chaotic dynamics both classically and quantum mechanically. Recently, we realized an "atom-optics billiard", where ultra-cold atoms are trapped inside a dark optical trap, whose shape can be varied to create different atom dynamics. In this work we describe how scattering and wall softness influence the dynamics of the atoms, and destroy or create stability.
Quantum computing is a system of computation that exploits the quantum-mechanical nature of reality at nano-scales in order to perform certain operations in a way that can scale better than is possible with classical computing. While the hardware sideof quantum computing is still in its infancy, many quantum algorithms - sets of instructions to run on a quantum computer in order to complete particular tasks - have been designed and analyzed. One of the most famous of these is Grover’s algorithm, an algorithm for searching a database. Two types of generalizations of Grover’s algorithm have been studied: spatial search algorithms (algorithms for searching discrete spaces) and “analog” search algorithms (algorithms performed by the evolution of physical systems). We develop and analyze algorithms that are generalizations of both those generalizations – an analog search algorithm for searching continuous, rather than discrete, spaces.
The use of wave packet to analyze the dynamics of quantum mechanical systems is an increasingly important method to the study of the classical-quantum correspondence.Using the quantum Gaussian wave packet analysis method,we calculate the autocorrelation function of the rectangular billiard,the peak positions of the autocorrelation function match well with the periods of the classical periodic orbits,which show that the period of the classical orbits can be produced by the time-dependent quantum wave packet method.We also discuss wave packet revivals and fractional revivals in the rectangular billiard,the results show that there are exact revival for all wave packet at each revival time.We find additional cases of exact revivals with short revival times for zero-momentum wave packets initially located at special symmetry point inside the billiard.