Related papers: Speedrunning and path integrals
Speedrunning in general means to play a video game fast, i.e. using all means at one's disposal to achieve a given goal in the least amount of time possible. To do so, a speedrun must be planned in advance, or routed, as referred to by the…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
Any particular classical system and its quantum version are normally viewed as separate formulations that are strictly distinct. Our goal is to overcome the two separate languages and create a smooth and common procedure that provides a…
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…
Simulations that couple different classical molecular models in an adaptive way by changing the number of degrees of freedom on the fly, are available within reasonably consistent theoretical frameworks. The same does not occur when it…
Quantum mechanics courses focus mostly on its computational aspects. This alone does not provide the same depth of understanding as most physicists have of classical mechanics. The understanding of classical mechanics is significantly…
In spite of its popularity, it has not been possible to vindicate the conventional wisdom that classical mechanics is a limiting case of quantum mechanics. The purpose of the present paper is to offer an alternative formulation of classical…
Involving only the measurements of commuting observables - the problem-setting and the corresponding solution - quantum algorithms should be subject to classical logic. This would allow flanking their customary quantum description with a…
We describe a general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking, a standard approach for solving constraint satisfaction problems (CSPs). Backtracking algorithms explore a…
With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical…
Central to the power of quantum computing is the concept of quantum parallelism: quantum systems can explore and process multiple computational paths simultaneously. In this paper, we discuss the elusive nature of quantum parallelism,…
Quantum computing has the potential to revolutionize multiple fields by solving complex problems that can not be solved in reasonable time with current classical computers. Nevertheless, the development of quantum computers is still in its…
We provide a new paradigm for quantum simulation that is based on path integration that allows quantum speedups to be observed for problems that are more naturally expressed using the path integral formalism rather than the conventional…
Quantifying the resources available to a quantum computer appears to be necessary to separate quantum from classical computation. Among them, entanglement, nonstabilizerness and coherence are arguably of great significance. We introduce…
Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning techniques to impressive results in regression, classification, data-generation and reinforcement learning tasks.…
Ray tracing algorithm simulates the physical movements of a huge amount of rays to render a high quality image, in which the tracing procedure for each ray can be implemented in parallel. By leveraging the inherent parallelism of quantum…
Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves substantial speedups over existing simulators for a wide class of…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…
These lectures are intended for graduate students who want to acquire a working knowledge of path integral methods in a wide variety of fields in physics. In general the presentation is elementary and path integrals are developed in the…