相关论文: Irreversibility in the Halting Problem of Quantum …

The quantum mechanical formalism for position and momentum of a particle in a one dimensional cyclic lattice is constructively developed. Some mathematical features characteristic of the finite dimensional Hilbert space are compared with…

After a brief historical perspective, we introduce the key notions of work and heat for quantum systems, to then apply them to quantum engines operating on quantum Otto and Carnot cycles. The irreversible and dissipative character of the…

Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and experiments. The description of quantum computers is under active…

Consequences of quantum recurrences on the stability of a broad class of dynamical systems is presented.

Quantum computing is a fascinating interdisciplinary research field that promises to revolutionize computing by efficiently solving previously intractable problems. Recent years have seen tremendous progress on both the experimental…

The discovery of an algorithm for factoring which runs in polynomial time on a quantum computer has given rise to a concerted effort to understand the principles, advantages, and limitations of quantum computing. At the same time, many…

According to Deutsch, a universal quantum Turing machine (UQTM) is able to perform, in repeating a fixed unitary transformation on the total system, an arbitrary unitary transformation on an arbitrary data state, by including a program as…

The origin of the uncertainty inherent in quantum measurements has been discussed since quantum theory's inception, but to date the source of the indeterminacy of measurements performed at an angle with respect to a quantum state's…

A typical oracle problem is finding which software program is installed on a computer, by running the computer and testing its input-output behaviour. The program is randomly chosen from a set of programs known to the problem solver. As…

The effect of the inevitable coupling to external degrees of freedom of a quantum computer are examined. It is found that for quantum calculations (in which the maintenance of coherence over a large number of states is important), not only…

Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…

Gate-model quantum computers can allow quantum computations in near-term implementations. The stabilization of an optimal quantum state of a quantum computer is a challenge, since it requires stable quantum evolutions via a precise…

Quantum mechanics has many counter-intuitive consequences which contradict our intuition which is based on classical physics. Here we discuss a special aspect of quantum mechanics, namely the possibility of entanglement between two or more…

There has been no lack of coverage in the past few years in scientific journals of the topic of quantum computation. Rightly so, as this is a novel idea with--so far--at least one very important practical application (prime factorisation)…

We discuss quantum information processing machines. We start with single purpose machines that either redistribute quantum information or identify quantum states. We then move on to machines that can perform a number of functions, with the…

We study the physics of quantum phase transitions from the perspective of non-equilibrium thermodynamics. For first order quantum phase transitions, we find that the average work done per quench in crossing the critical point is…

A quantum measurement is logically reversible if the premeasurement density operator of the measured system can be calculated from the postmeasurement density operator and from the outcome of the measurement. This paper analyzes why many…

This article traces the development of fluctuation theory and its deep connection to irreversibility, from equilibrium to near-equilibrium, and finally to far-from-equilibrium systems. Classical fluctuation theorems, which capture the…

We discuss a number of comments on quant-ph/9801061, and propose to introduce the concept of 'Causal Indistinguishability'. The incompatibility between Quantum Mechanics and Nonlocal Causality appears to be unavoidable: upholding of Quantum…

The feasibility of computationally superior quantum computers is one of the most exciting and clear-cut scientific questions of our time. The question touches on fundamental issues regarding probability, physics, and computability, as well…