In this short review article, we aim to provide physicists not working within the quantum
computing community a hopefully easy-to-read introduction to the state of the art in the field …

Simulating quantum mechanics is known to be a difficult computational problem, especially
when dealing with large systems. However, this difficulty may be overcome by using some …

Because of its geometric nature, holonomic quantum computation is fault tolerant against
certain types of control errors. Although proposed more than a decade ago, the experimental …

The difficulty of simulating quantum systems, well known to quantum chemists, prompted the
idea of quantum computation. One can avoid the steep scaling associated with the exact …

Quantum adiabatic passages can be greatly accelerated by a suitable control field, called a
counter-diabatic field, which varies during the scan through resonance. Here, we implement …

A fundamental challenge in digital quantum simulation (DQS) is the control of an inherent
error, which appears when discretizing the time evolution of a quantum many-body system …

We develop a variational approach to simulating the dynamics of open quantum many-body
systems using deep autoregressive neural networks. The parameters of a compressed …

It is difficult to simulate quantum systems on classical computers, while quantum computers
have been proved to be able to efficiently perform such kinds of simulations. We report an …

Quantum computers [1–4] are explicitly quantum mechanical systems that use phenomena
such as superposition and entanglement to perform computational tasks more efficiently …

Quantum algorithms could be much faster than classical ones in solving the factoring
problem. Adiabatic quantum computation for this is an alternative approach other than …