Related papers: Superiority of semiclassical over quantum mechanic…
(Abridged.) Quantum computers promise to solve some problems exponentially faster than traditional computers, but we still do not fully understand why this is the case. While the most studied model of quantum computation uses qubits, which…
We present a detailed study of scattering by an amplitude-modulated potential barrier using three distinct physical frameworks: quantum, classical, and semiclassical. Classical physics gives bounds on the energy and momentum of the…
Measurements serve as the intermediate communication layer between the quantum world and our classical perception. So, the question which measurements efficiently extract information from quantum systems is of central interest. Using…
Quantum technology has the potential to revolutionize how we acquire and process experimental data to learn about the physical world. An experimental setup that transduces data from a physical system to a stable quantum memory, and…
Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and…
Machine Learning algorithms are extensively used in an increasing number of systems, applications, technologies, and products, both in industry and in society as a whole. They enable computing devices to learn from previous experience and…
A classical (or quantum) superintegrable system on an n-dimensional Riemannian manifold is an integrable Hamiltonian system with potential that admits 2n-1 functionally independent constants of the motion that are polynomial in the momenta,…
Insofar as quantum computation is faster than classical, it appears to be irreversible. In all quantum algorithms found so far the speed-up depends on the extra-dynamical irreversible projection representing quantum measurement. Quantum…
Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…
Given a quantum Hamiltonian, we explain how the dynamical properties of the underlying classical system affect the behaviour of quantum eigenstates in the semi-classical limit. We study this problem via the notion of semiclassical measures.…
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…
We investigate a numerical method for studying resonances in quantum mechanics. We prove rigorously that this method yields accurate approximations to resonance energies and widths for shape resonances in the semiclassical limit.
A simple argument shows that eigenstates of a classically ergodic system are individually ergodic on coarse-grained scales. This has implications for the quantization ambiguity in ergodic systems: the difference between alternative…
Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…
In this contribution, we discuss three situations in which complete integrability of a three dimensional classical system and its quantum version can be achieved under some conditions. The former is a system with axial symmetry. In the…
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for…
A central challenge in quantum computing is to identify more computational problems for which utilization of quantum resources can offer significant speedup. Here, we propose a hybrid quantum-classical scheme to tackle the quantum optimal…
A large toolbox of numerical schemes for dispersive equations has been established, based on different discretization techniques such as discretizing the variation-of-constants formula (e.g., exponential integrators) or splitting the full…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…