Related papers: Quantum chaos and random matrix theoryfor fidelity…
We present a Fermi golden rule giving rates of decay of states obtained by perturbing embedded eigenvalues of a quantum graph. To illustrate the procedure in a notationally simpler setting we also present a Fermi Golden Rule for boundary…
It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation,…
Quantum technologies have shown immeasurable potential to effectively solve several information processing tasks such as prime number factorization, unstructured database search or complex macromolecule simulation. As a result of such…
The quantum density matrix generalises the classical concept of probability distribution to quantum theory. It gives the complete description of a quantum state as well as the observable quantities that can be extracted from it. Its…
We study, analytically and numerically, the stability of quantum motion for a classically chaotic system. We show the existence of different regimes of fidelity decay which deviate from Fermi Golden rule and Lyapunov decay.
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…
Quantum computers promise considerable speedups over classical approaches, which has raised interest from many disciplines. Since any currently available implementations suffer from noise and imperfections, achieving concrete speedups for…
We derive a simple and general relation between the fidelity of quantum motion, characterizing the stability of quantum dynamics with respect to arbitrary static perturbation of the unitary evolution propagator, and the integrated time…
We present a theory of quantum work statistics in generic chaotic, disordered Fermi liquid systems within a driven random matrix formalism. By extending P. W. Anderson's orthogonality determinant formula to compute quantum work…
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 states needed in a quantum computation are extremely affected by decoherence. Several methods have been proposed to control error spreading. They use two main tools: fault-tolerant constructions and concatenated quantum error correcting…
A legend tells that once Loschmidt asked Boltzmann on what happens to his statistical theory if one inverts the velocities of all particles, so that, due to the reversibility of Newton's equations, they return from the equilibrium to a…
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…
Producing quantum states at random has become increasingly important in modern quantum science, with applications both theoretical and practical. In particular, ensembles of such randomly-distributed, but pure, quantum states underly our…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
We consider realistic measurement systems, where measurements are accompanied by decoherence processes. The aim of this work is the construction of methods and algorithms for precise quantum measurements with fidelity close to the…
A perturbative treatment of reduced density operators of quantum subsystems is implemented in the same spirit as Fermi Golden Rule for scattering. Analytic expressions for linear entropy (a measure of purity loss, and in some cases of…
Decoherence in quantum systems which are classically chaotic is studied. The Arnold cat map and the quantum kicked rotor are chosen as examples of linear and nonlinear chaotic systems. The Feynman-Vernon influence functional formalism is…
In recent investigations, it has been found that conservation laws generally lead to precision limits on quantum computing. Lower bounds of the error probability have been obtained for various logic operations from the commutation relation…
Variational quantum algorithms are tailored to perform within the constraints of current quantum devices, yet they are limited by performance-degrading errors. In this study, we consider a noise model that reflects realistic gate errors…