相关论文: Quantum Ballistic Evolution in Quantum Mechanics: …

Quantum walks are a promising framework that can be used to both understand and implement quantum information processing tasks. The quantum stochastic walk is a recently developed framework that combines the concept of a quantum walk with…

Computational methods are the most effective tools we have besides scientific experiments to explore the properties of complex biological systems. Progress is slowing because digital silicon computers have reached their limits in terms of…

In the geometry of quantum-mechanical processes, the time-varying curvature coefficient of a quantum evolution is specified by the magnitude squared of the covariant derivative of the tangent vector to the state vector. In particular, the…

A self-consistent quadratic theory is presented to account for nonlinear contributions in quantum dynamics. Evolution equations are shown to depend on higher-order gradients of the Hamiltonian, which are incorporated via their equations of…

We show that quantum computation can be performed in a system at thermal equilibrium if a spontaneous symmetry breaking occurs. The computing process is associated to the time evolution of the statistical average of the qubit coherence…

The investigation of thermalization in isolated quantum many-body systems has a long history, dating back to the time of developing statistical mechanics. Most quantum many-body systems in nature are considered to thermalize, while some…

We introduce a new class of quantum models with time-dependent Hamiltonians of a special scaling form. By using a couple of time-dependent unitary transformations, the time evolution of these models is expressed in terms of related systems…

We give a counter example to show that determinism as such is in contradiction to quantum mechanics. More precisely, we consider a simple quantum system and its environment, including the measurement device, and make the assumption that the…

Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…

We investigate the mutation-selection dynamics for an evolutionary computation model based on Turing Machines that we introduced in a previous article. The use of Turing Machines allows for very simple mechanisms of code growth and code…

We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…

We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contradictory (and therefore trivial) theories, considering…

Without wasting time and effort on philosophical justifications and implications, we write down the conditions for the Hamiltonian of a quantum system for rendering it mathematically equivalent to a deterministic system. These are the…

At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…

Quantum tunneling is considered from the point of view of local realism. It is concluded that a quantum object tunneling through a potential barrier cannot be interpreted as a point-like particle because such an interpretation generates a…

We review recent progress in the nonequilibrium dynamics of thermally isolated many-body quantum systems, evolving with an ensemble of Hamiltonians as opposed to deterministic evolution with a single time-dependent Hamiltonian. Such…

We pursue the view that quantum theory may be an emergent structure related to large space-time scales. In particular, we consider classical Hamiltonian systems in which the intrinsic proper time evolution parameter is related through a…

The Stone theorem requires that in a physical Hilbert space ${\cal H}$ the time-evolution of a stable quantum system is unitary if and only if the corresponding Hamiltonian $H$ is self-adjoint. Sometimes, a simpler picture of the evolution…

Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…

An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…