اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPlaying Pool with $|psi rangle$: from Bouncing Billiards to Quantum Search
253
0
0.0
(
0
)
تأليف
Adam R. Brown
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In Playing Pool with $pi$, Galperin invented an extraordinary method to learn the digits of $pi$ by counting the collisions of billiard balls. Here I demonstrate an exact isomorphism between Galperins bouncing billiards and Grovers algorithm for quantum search. This provides an illuminating way to visualize Grovers algorithm.
قيم البحث
اقرأ أيضاً
Despite the successes of recent works in quantum reinforcement learning, there are still severe limitations on its applications due to the challenge of encoding large observation spaces into quantum systems. To address this challenge, we propose usin
g a neural network as a data encoder, with the Atari games as our testbed. Specifically, the neural network converts the pixel input from the games to quantum data for a Quantum Variational Circuit (QVC); this hybrid model is then used as a function approximator in the Double Deep Q Networks algorithm. We explore a number of variations of this algorithm and find that our proposed hybrid models do not achieve meaningful results on two Atari games - Breakout and Pong. We suspect this is due to the significantly reduced sizes of the hybrid quantum-classical systems.
Quantum search is a quantum mechanical technique for searching N possibilities in only sqrt(N) steps. This paper gives a fresh perspective on the algorithm in terms of a resonance phenomenon which is implemented through classical coupled oscillators.
Consider N oscillators, one of which is of a different resonant frequency. We could identify which one this is by measuring the oscillation frequency of each oscillator, a procedure that would take about N cycles. We show how, by coupling the oscillators together in a very simple way, it is possible to identify the different one in only sqrt(N) cycles. An extension of this technique to the quantum case leads to the quantum search algorithm.
We investigate a particular type of classical nonsingular bouncing cosmology, which results from general relativity if we allow for degenerate metrics. The simplest model has a matter content with a constant equation-of-state parameter and we get the
modified Hubble diagrams for both the luminosity distance and the angular diameter distance. Based on these results, we present a Gedankenexperiment to determine the length scale of the spacetime defect which has replaced the big bang singularity. A possibly more realistic model has an equation-of-state parameter which is different before and after the bounce. This last model also provides an upper bound on the defect length scale.
We present a semiclassical approximation to the scattering wavefunction $Psi(mathbf{r},k)$ for an open quantum billiard which is based on the reconstruction of the Feynman path integral. We demonstrate its remarkable numerical accuracy for the open r
ectangular billiard and show that the convergence of the semiclassical wavefunction to the full quantum state is controlled by the path length or equivalently the dwell time. Possible applications include leaky billiards and systems with decoherence present.
The quantum search algorithm is a technique for searching N possibilities in only sqrt(N) steps. Although the algorithm itself is widely known, not so well known is the series of steps that first led to it, these are quite different from any of the g
enerally known forms of the algorithm. This paper describes these steps, which start by discretizing Schrodingers equation. This paper also provides a self-contained introduction to the quantum search algorithm from a new perspective.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
