During the last ten years, superconducting circuits have passed from being interesting
physical devices to becoming contenders for near-future useful and scalable quantum …

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 …

Quantum-classical hybrid algorithms are emerging as promising candidates for near-term
practical applications of quantum information processors in a wide variety of fields ranging …

Universal fault-tolerant quantum computers will require error-free execution of long
sequences of quantum gate operations, which is expected to involve millions of physical …

Using quantum devices supported by classical computational resources is a promising
approach to quantum-enabled computation. One powerful example of such a hybrid …

Limited quantum memory is one of the most important constraints for near-term quantum
devices. Understanding whether a small quantum computer can simulate a larger quantum …

We propose a qubit efficient scheme to study ground-state properties of quantum many-body
systems on near-term noisy intermediate-scale quantum computers. One can obtain a tensor …

Variational quantum algorithms are promising applications of noisy intermediate-scale
quantum (NISQ) computers. These algorithms consist of a number of separate prepare-and …

The many-body problem is ubiquitous in the theoretical description of physical phenomena,
ranging from the behaviour of elementary particles to the physics of electrons in solids. Most …

We propose and analyze a deterministic protocol to generate two-dimensional photonic
cluster states using a single quantum emitter via time-delayed quantum feedback. As a …