اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExploring the Quantum Speed Limit with Computer Games
50
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Humans routinely solve problems of immense computational complexity by intuitively forming simple, low-dimensional heuristic strategies. Citizen science exploits this ability by presenting scientific research problems to non-experts. Gamification is an effective tool for attracting citizen scientists to provide solutions to research problems. While citizen science games Foldit, EteRNA and EyeWire have been used successfully to study protein and RNA folding and neuron mapping, so far gamification has not been applied to problems in quantum physics. Does the fact that everyday experiences are based on classical physics hinder the use of non-expert citizen scientists in the realm of quantum mechanics? Here we report on Quantum Moves, an online platform gamifying optimization problems in quantum physics. We show that human players are able to find solutions to difficult problems associated with the task of quantum computing. Players succeed where purely numerical optimization fails, and analyses of their solutions provide insights into the problem of optimization of a more profound and general nature. Based on player strategies, we have thus developed a new, few-parameter heuristic optimization method which efficiently outperforms the most prominent established numerical methods. The numerical complexity associated with time-optimal solutions increases for shorter process durations. To better understand this, we have made a low-dimensional rendering of the optimization landscape. These studies show why traditional optimization methods fail near the quantum speed limit, and they bring promise that combined analyses of optimization landscapes and heuristic solution strategies may benefit wider classes of optimization problems in quantum physics and beyond.
قيم البحث
اقرأ أيضاً
It is shown how to formulate the ubiquitous quantum chemistry problem of calculating the thermal rate constant on a quantum computer. The resulting exact algorithm scales exponentially faster with the dimensionality of the system than all known ``classical algorithms for this problem.
In recent letter [Phys. Rev. Lett {bf 121}, 070601 (2018), arXiv:1802.06554], the speed limit for classical stochastic Markov processes is considered, and a trade-off inequality between the speed of the state transformation and the entropy production
is given. In this comment, a more accurate inequality will be presented.
In this thesis we introduce quantum refereed games, which are quantum interactive proof systems with two competing provers. We focus on a restriction of this model that we call short quantum games and we prove an upper bound and a lower bound on the
expressive power of these games. For the lower bound, we prove that every language having an ordinary quantum interactive proof system also has a short quantum game. An important part of this proof is the establishment of a quantum measurement that reliably distinguishes between quantum states chosen from disjoint convex sets. For the upper bound, we show that certain types of quantum refereed games, including short quantum games, are decidable in deterministic exponential time by supplying a separation oracle for use with the ellipsoid method for convex feasibility.
Quantum mechanics sets fundamental limits on how fast quantum states can be transformed in time. Two well-known quantum speed limits are the Mandelstam-Tamm (MT) and the Margolus-Levitin (ML) bounds, which relate the maximum speed of evolution to the
systems energy uncertainty and mean energy, respectively. Here, we test concurrently both limits in a multi-level system by following the motion of a single atom in an optical trap using fast matter wave interferometry. Our data reveal two different regimes: one where the MT limit constrains the evolution at all times, and a second where a crossover to the ML limit is manifested at longer times. We take a geometric approach to quantify the deviation from the speed limit, measuring how much the matter waves quantum evolution deviates from the geodesic path in the Hilbert space of the multi-level system. Our results, establishing quantum speed limits beyond the simple two-level system, are important to understand the ultimate performance of quantum computing devices and related advanced quantum technologies.
Chern-Simons topological quantum computer is a device that can be effectively described by the Chern-Simons topological quantum field theory and used for quantum computations. Quantum qudit gates of this quantum computer are represented by sequences
of quantum $mathcal{R}$-matrices. Its dimension and explicit form depend on the parameters of the Chern-Simons theory -- level $k$, gauge group $SU(N)$, and representation, which is chosen to be symmetric representation $[r]$. In this paper, we examine the universality of such a quantum computer. We prove that for sufficiently large $k$ it is universal, and the minimum allowed value of $k$ depends on the remaining parameters $r$ and $N$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
