Related papers: Quantum computer inverting time arrow for macrosco…
One of the important questions in statistical mechanics is how irreversibility (time's arrow) occurs when Newton equations of motion are time reversal invariant. One objection to irreversibility is based on Poincar\'e's recursion theorem: a…
Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…
Ever since the advent of quantum mechanics, it has been clear that the atoms composing matter do not obey Newton's laws. Instead, their behavior is described by the Schroedinger equation. Surprisingly though, until recently, no clear…
Quantum computing promises to help humanity solve problems that would otherwise be intractable on classical computers. Unlike today's machines, quantum computers use a novel computing process that leverages the foundational quantum…
In the last quarter of the nineteenth century, Ludwig Boltzmann explained how irreversible macroscopic laws, in particular the second law of thermodynamics, originate in the time-reversible laws of microscopic physics. Boltzmann's analysis,…
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…
The analysis of dissipation and dephasing in driven mesoscopic devices requires a distinction between two notions of quantum irreversibility. One ("Loschmidt echo") is related to "time reversal", while the other is related to "driving…
The physics of many closed, conservative systems can be described by both classical and quantum theories. The dynamics according to classical theory is symplectic and admits linear instabilities which would initially seem at odds with a…
Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is…
In recent years, deep learning has had a profound impact on machine learning and artificial intelligence. At the same time, algorithms for quantum computers have been shown to efficiently solve some problems that are intractable on…
Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. Owing to…
We have performed an experiment to demonstrate the approximate time reversal of a "chaotic" time evolution of atomic deBroglie waves. We use ultra cold atoms from a Bose-Einstein condensate in a quantum $\delta$-kicked rotor experiment, and…
It is a remarkable fact that all processes occurring in the observable Universe are irreversible, whereas the equations through which the fundamental laws of physics are formulated are invariant under time reversal. The emergence of…
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly…
Most versions of classical physics imply that if the 4-volume of the entire space-time is infinite or at least extremely large, then random fluctuations in the matter will by coincidence create copies of us in remote places, so called…
In this paper I propose a new way for counting the microstates of a system out of equilibrium. As, according to quantum mechanics, things happen as if a given particle can be found in more than one state at once, I extend this concept to…
Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
Any real interaction process produces many incompatible system versions, or realisations, giving rise to omnipresent dynamic randomness and universally defined complexity (arXiv:physics/9806002). Since quantum behaviour dynamically emerges…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…