Related papers: Quantum Mechanical Search and Harmonic Perturbatio…
We consider the optimal control of quantum systems interacting non-linearly with an electromagnetic field. We propose new monotonically convergent algorithms to solve the optimal equations. The monotonic behavior of the algorithm is ensured…
In a recent proposal using the group field theory approach, a spatially homogeneous (generally anisotropic) universe is described as a quantum gravity condensate of "atoms of space," which allows the derivation of an effective cosmological…
In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can…
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across physics and chemistry. For this task, algorithms that run on…
A quantum mechanical theory is proposed which abandons an external parameter ``time'' in favor of a self-adjoint operator on a Hilbert space whose elements represent measurement events rather than system states. The standard quantum…
We discuss the time-continuous path integration in the coherent states basis in a way that is free from inconsistencies. Employing this notion we reproduce known and exact results working directly in the continuum. Such a formalism can set…
The quantum kinetic equation used in the study of weak turbulence is reconsidered in the context of a theory with a generic quartic interaction. The expectation value of the time derivative of the mode number operators is computed in a…
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…
More than 15 years ago, a new approach to quantum mechanics was suggested, in which Hermiticity of the Hamiltonian was to be replaced by invariance under a discrete symmetry, the product of parity and time-reversal symmetry, $\mathcal{PT}$.…
Stochastic perturbation of two-level atoms strongly driven by a coherent light field is analyzed by the quantum trajectory method. A new method is developed for calculating the resonance fluorescence spectra from numerical simulations. It…
This paper describes an algorithm for selecting a consistent set within the consistent histories approach to quantum mechanics and investigates its properties. The algorithm select from among the consistent sets formed by projections…
The problem of characterizing complexity of quantum dynamics - in particular of locally interacting chains of quantum particles - will be reviewed and discussed from several different perspectives: (i) stability of motion against external…
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm…
Quantum computers have the potential to transform the ways in which we tackle some important problems. The efforts by companies like Google, IBM and Microsoft to construct quantum computers have been making headlines for years. Equally…
The paper examines the prominent algorithm D-MORPH to search for the optimal control of a quantum system in order to implement desired unitary evolution of the quantum system at the final time, and reveals new mathematical expressions for…
Using the basic ingredient of supersymmetry, we develop a simple alternative approach to perturbation theory in one-dimensional non-relativistic quantum mechanics. The formulae for the energy shifts and wave functions do not involve tedious…
Perturbation theory (PT) might be one of the most powerful and fruitful tools for both physicists and chemists, which has led to a wide variety of applications. Over the past decades, advances in quantum computing provide opportunities for…
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". Quantum…
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average…
This article presents the first complete application of a quantum time-marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The…