Related papers: Quantum localization bounds Trotter errors in digi…
We present fresh evidence for the presence of discrete quantum time crystals in two spatial dimensions. Discrete time crystals are intricate quantum systems that break discrete time translation symmetry in driven quantum many-body systems…
In a recent milestone experiment, Google's processor Sycamore heralded the era of "quantum supremacy" by sampling from the output of (pseudo-)random circuits. We show that such random circuits provide tailor-made building blocks for…
Many-body localization is a striking mechanism that prevents interacting quantum systems from thermalizing. The absence of thermalization behaviour manifests itself, for example, in a remanence of local particle number configurations, a…
Dynamical measurement schemes are an important tool for the investigation of quantum many-body systems, especially in the age of quantum simulation. Here, we address the question whether generic measurements can be implemented efficiently…
Simulating the dynamic evolutions of physical and molecular systems in a quantum computer is of fundamental interest in many applications. Its implementation requires efficient quantum simulation algorithms. The Lie-Trotter-Suzuki…
The simulation of molecules is a widely anticipated application of quantum computers. However, recent studies \cite{WBCH13a,HWBT14a} have cast a shadow on this hope by revealing that the complexity in gate count of such simulations…
Digital-analog quantum computing (DAQC) is a universal computational paradigm that combines the evolution under an entangling Hamiltonian with the application of single-qubit gates. Since any unitary operation can be decomposed into a…
The study of many-body quantum dynamics in strongly-correlated systems is extremely challenging. To date few numerical methods exist which are capable of simulating the non-equilibrium dynamics of two-dimensional quantum systems, in part…
Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in…
Quantum computers open the possibility of performing real-time calculations for quantum field theory scattering processes. We propose to use an index averaging the absolute value of the difference between the accurately calculated Trotter…
Known as no fast-forwarding theorem in quantum computing, the simulation time for the Hamiltonian evolution needs to be $O(\|H\| t)$ in the worst case, which essentially states that one can not go across the multiple scales as the…
We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in…
We demonstrate that it is possible to construct operators that stabilize the constraint-satisfying subspaces of computational problems in their Ising representations. We provide an explicit recipe to construct unitaries and associated…
The potential of employing higher orders of the Trotter-Suzuki decomposition of the evolution operator for more effective simulations of quantum systems on a noisy quantum computer is explored. By examining the transverse-field Ising model…
Quantum state tomography is a core task in quantum system identification. Real experimental conditions often deviate from nominal designs, introducing errors in both the measurement devices and the Hamiltonian governing the system's…
The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting…
Quantum dynamics in a strongly disordered quantum many-body system show localization properties. The initial state memory is maintained owing to slow relaxation when the system is in the localized regime. This work demonstrates how…
The quantum speed limit sets the minimum time required to transfer a quantum system completely into a given target state. At shorter times the higher operation speed has to be paid with a loss of fidelity. Here we quantify the trade-off…
Quantum computers are invaluable tools to explore the properties of complex quantum systems. We show that dynamical localization of the quantum sawtooth map, a highly sensitive quantum coherent phenomenon, can be simulated on actual,…
We study the problem of learning the Hamiltonian of a many-body quantum system from experimental data. We show that the rate of learning depends on the amount of control available during the experiment. We consider three control models: one…