相关论文: Dynamical localization simulated on a few qubits q…

We study the effects of dynamical imperfections in quantum computers. By considering an explicit example, we identify different regimes ranging from the low-frequency case, where the imperfections can be considered as static but with…

Quantum computing promises the possibility of studying the real-time dynamics of nonperturbative quantum field theories while avoiding the sign problem that obstructs conventional lattice approaches. Current and near-future quantum devices…

This paper presents the first experimental evidence of the transition from dynamical localization to delocalization under the influence of a quasi-periodic driving on a quantum system. A quantum kicked rotator is realized by placing cold…

Quantum circuits with local unitaries have emerged as a rich playground for the exploration of many-body quantum dynamics of discrete-time systems. While the intrinsic locality makes them particularly suited to run on current quantum…

Quantum computers hold promise to enable efficient simulations of the properties of molecules and materials; however, at present they only permit ab initio calculations of a few atoms, due to a limited number of qubits. In order to harness…

We report an efficient quantum algorithm for estimating the local density of states (LDOS) on a quantum computer. The LDOS describes the redistribution of energy levels of a quantum system under the influence of a perturbation. Sometimes…

We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization and Anderson transition can be…

We show that a quantum walk process can be used to construct and secure quantum memory. More precisely, we show that a localized quantum walk with temporal disorder can be engineered to store the information of a single, unknown qubit on a…

We introduce a model of non-unitary quantum dynamics that exhibits infinitely long-lived discrete spatiotemporal order robust against any unitary or dissipative perturbation. Ergodicity is evaded by combining a sequence of projective…

The accurate computational study of wavepacket nuclear dynamics is considered to be a classically intractable problem, particularly with increasing dimensions. Here we present two algorithms that, in conjunction with other methods developed…

A dynamical quantum model assigns an eigenstate to a specified observable even when no measurement is made, and gives a stochastic evolution rule for that eigenstate. Such a model yields a distribution over classical histories of a quantum…

Loosely speaking, the concept of quantum typicality refers to the fact that a single pure state can imitate the full statistical ensemble. This fact has given rise to a rather simple but remarkably useful numerical approach to simulate the…

Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers…

We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…

Simulating real-time dynamics of gauge theories represents a paradigmatic use case to test the hardware capabilities of a quantum computer, since it can involve non-trivial input states preparation, discretized time evolution, long-distance…

Quantum simulators have made a remarkable progress towards exploring the dynamics of many-body systems, many of which offer a formidable challenge to both theoretical and numerical methods. While state-of-the-art quantum simulators are in…

We consider classical models of the kicked rotor type, with piecewise linear kicking potentials designed so that momentum changes only by multiples of a given constant. Their dynamics display quasi-localization of momentum, or quadratic…

Simulating quantum states on a classical computer is hard, typically requiring prohibitive resources in terms of memory and computational power. Efficient simulation, however, can be achieved for certain classes of quantum states, in…

In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the system, the environment and their interaction:…

Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an…