Related papers: Quantum computer inverting time arrow for macrosco…
Uncovering the origin of the arrow of time remains a fundamental scientific challenge. Within the framework of statistical physics, this problem was inextricably associated with the second law of thermodynamics, which declares that entropy…
For decades, researchers have sought to understand how the irreversibility of the surrounding world emerges from the seemingly time symmetric, fundamental laws of physics. Quantum mechanics conjectured a clue that final irreversibility is…
The Boltzmann-Loschmidt dispute of 1876 questioned the possibility of a statistical irreversible description by time reversible classical equations of motion of atoms. Here we show analytically and numerically that the quantum chaos…
The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…
An attempt is made to de-mystify the apparent "paradox" between microscopic time revsersibility and macroscopic time irreversibility. It is our common experience that a hot cup of coffee cools down to room temperature and it never…
Quantum mechanics---the theory describing the fundamental workings of nature---is famously counterintuitive: it predicts that a particle can be in two places at the same time, and that two remote particles can be inextricably and…
The relation between entropy and information has great significance for computation. Based on the strict reversibility of the laws of microphysics, Landauer (1961), Bennett (1973), Priese (1976), Fredkin and Toffoli (1982), Feynman (1985)…
Quantum computers facing chaos. Quantum parallelism allows to perform computation in a radically new manner. A quantum computer based on these new principles may resolve certain problems exponentially faster than a classical computer. We…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
The Halting problem of a quantum computer is considered. It is shown that if halting of a quantum computer takes place the associated dynamics is described by an irreversible operator.
Quantum algorithms can potentially solve a handful of problems more efficiently than their classical counterparts. In that context, it has been discussed that Markov chains problems could be solved significantly faster using quantum…
We consider the problem of reversing quantum dynamics, with the goal of preserving an initial state's quantum entanglement or classical correlation with a reference system. We exhibit an approximate reversal operation, adapted to the…
Irreversibility remains one of the least understood concepts in physics. One of the main reasons is the fact that the fundamental laws of classical and quantum physics are time symmetric, whereas macroscopic processes evolve in a preferred…
Highly excited many-particle states in quantum systems (nuclei, atoms, quantum dots, spin systems, quantum computers) can be ``chaotic'' superpositions of mean-field basis states (Slater determinants, products of spin or qubit states). This…
Quantum computers have attracted much attention in recent years. This is because the development of the actual quantum machine is accelerating. Research on how to use quantum computers is active in the fields such as quantum chemistry and…
I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem…
This article is an attempt to generalize the classical theory of reversible computing, principally developed by Bennet [IBM J. Res. Develop., 17(1973)] and by Fredkin and Toffoli [Internat. J. Theoret. Phys., 21(1982)], to the quantum case.…
We show on the example of the Arnold cat map that classical chaotic systems can be simulated with exponential efficiency on a quantum computer. Although classical computer errors grow exponentially with time, the quantum algorithm with…
The quest for improved sampling methods to solve statistical mechanics problems of physical and chemical interest proceeds with renewed efforts since the invention of the Metropolis algorithm, in 1953. In particular, the understanding of…
The macroscopic behavior of many physical systems can be approximately described by classical quantities. However, quantum theory demands the existence of omnipresent quantum fluctuations on top of this classical background -- which, albeit…