Related papers: Realizing the quantum baker's map on an NMR quantu…
We rationalize the somewhat surprising efficacy of the Hadamard transform in simplifying the eigenstates of the quantum baker's map, a paradigmatic model of quantum chaos. This allows us to construct closely related, but new, transforms…
Approximation based on perturbation theory is the foundation for most of the quantitative predictions of quantum mechanics, whether in quantum many-body physics, chemistry, quantum field theory or other domains. Quantum computing provides…
I study the scaling behavior in the physical parameters of dynamical entropies, classical and quantum, in a specifically devised model of collision-induced decoherence in a chaotic system. The treatment is fully canonical and no…
Computational advantages gained by quantum algorithms rely largely on the coherence of quantum devices and are generally compromised by decoherence. As an exception, we present a quantum algorithm for graph isomorphism testing whose…
The concepts of topology and geometry are of critical importance in exploring exotic phases of quantum matter. Though they have been investigated on various experimental platforms, to date a direct probe of topological and geometric…
We study quantum Loschmidt echo, or fidelity, in the triangle map whose classical counterpart has linear instability and weak chaos. Numerically, three regimes of fidelity decay have been found with respect to the perturbation strength…
Quantum computers offer an intriguing path for a paradigmatic change of computing in the natural sciences and beyond, with the potential for achieving a so-called quantum advantage, namely a significant (in some cases exponential) speed-up…
Quantum algorithms for computing classical nonlinear maps are widely known for toy problems but might not suit potential applications to realistic physics simulations. Here, we propose how to compute a general differentiable invertible…
The new solution to the problem of time of arrival in quantum theory is presented herein. It allows for computer simulation of particle counters and it implies Born's interpretation. It also suggests new experiments that can answer the…
It is known that a quantum system with finite degrees of freedom can simulate a composite of a system and an environment if the state of the hypothetical environment is randomized by external manipulation. We show theoretically that any…
The design of new devices and experiments in science and engineering has historically relied on the intuitions of human experts. This credo, however, has changed. In many disciplines, computer-inspired design processes, also known as…
In this essay we discuss the issue of quantum information and recent nuclear magnetic resonance (NMR) experiments. We explain why these experiments should be regarded as quantum information processing (QIP) despite the fact that, in present…
We report an ensemble nuclear magnetic resonance (NMR) implementation of a quantum lattice gas algorithm for the diffusion equation. The algorithm employs an array of quantum information processors sharing classical information, a novel…
We investigate a quantum algorithm which simulates efficiently the quantum kicked rotator model, a system which displays rich physical properties, and enables to study problems of quantum chaos, atomic physics and localization of electrons…
We address the question of how a quantum computer can be used to simulate experiments on quantum systems in thermal equilibrium. We present two approaches for the preparation of the equilibrium state on a quantum computer. For both…
Quantum sensing leverages quantum resources to surpass the standard quantum limit, yet many existing protocols rely on the preparation of complex entangled states and Hamiltonian engineering, posing challenges for universality and…
Digital quantum computers provide a computational framework for solving the Schr\"{o}dinger equation for a variety of many-particle systems. Quantum computing algorithms for the quantum simulation of these systems have recently witnessed…
Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. A strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing…
We show that the rate of increase of von Neumann entropy computed from the reduced density matrix of an open quantum system is an excellent indicator of the dynamical behavior of its classical hamiltonian counterpart. In decohering quantum…
Quantum computation is one of the most promising new paradigms for the simulation of physical systems composed of electrons and atomic nuclei, with applications in chemistry, solid-state physics, materials science, and molecular biology.…