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, with minimal mathematics involved. In particular, we focus on what is termed the Noisy Intermediate Scale Quantum era of quantum computing. We describe how this is increasingly seen to be a distinct phase in the development of quantum computers, heralding an era where we have quantum computers that are capable of doing certain quantum computations in a limited fashion, and subject to certain constraints and noise. We further discuss the prominent algorithms that are believed to hold the most potential for this era, and also describe the competing physical platforms on which to build a quantum computer that have seen the most success so far. We then talk about the applications that are most feasible in the near-term, and finish off with a short discussion on the state of the field. We hope that as non-experts read this article, it will give context to the recent developments in quantum computers that have garnered much popular press, and help the community understand how to place such developments in the timeline of quantum computing.

It is known that the superposition of two bound states in the continuum (BICs) leads to the phenomenon of an oscillating bound state, where excitations mediated by the continuum modes oscillate persistently. We perform exact calculations for the oscillating BICs in a one-dimensional photonic lattice coupled to a "giant atom" at multiple points. Our work is significantly distinct from previous proposals of oscillating BICs in continuous waveguide systems due to the presence of a finite energy band contributing band-edge effects. In particular, we show that the bound states outside the energy band are detrimental to the oscillating BIC phenomenon, and can be suppressed by increasing either the number of coupling points or the separation between each coupling point. Crucially, non-Markovianity is necessary for the existence of oscillating BICs, and the oscillation amplitude increases with the characteristic delay time of the giant atom interactions. We also propose an initialization scheme in the BIC subspace. Our work be experimentally implemented on current photonic waveguide array platforms and opens up prospects in utilizing reservoir engineering for the storage of quantum information in photonic lattices.

Simulating quantum dynamics is expected to be performed more easily on a quantum computer than on a classical computer. However, the currently available quantum devices lack the capability to implement fault-tolerant quantum algorithms for quantum simulation. Hybrid classical quantum algorithms such as the variational quantum algorithms have been proposed to effectively use current term quantum devices. One promising approach to quantum simulation in the noisy intermediate-scale quantum (NISQ) era is the diagonalisation based approach, with some of the promising examples being the subspace variational quantum simulator (SVQS), variational fast forwarding (VFF), fixed-state variational fast forwarding (fs-VFF), and the variational Hamiltonian diagonalisation (VHD) algorithms. However, these algorithms require a feedback loop between the classical and quantum computers, which can be a crucial bottleneck in practical application. Here, we present the classical quantum fast forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation. CQFF shares some similarities with SVQS, VFF, fs-VFF and VHD but removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries. The CQFF algorithm does not suffer from the barren plateau problem and the accuracy can be systematically increased. Furthermore, if the Hamiltonian to be simulated is expressed as a linear combination of tensored-Pauli matrices, the CQFF algorithm reduces to the task of sampling some many-body quantum state in a set of Pauli-rotated bases, which is easy to do in the NISQ era. We run the CQFF algorithm on existing quantum processors and demonstrate the promise of the CQFF algorithm for current-term quantum hardware. We compare CQFF with Trotterization for a XY spin chain model Hamiltonian and find that the CQFF algorithm can simulate the dynamics more than 10 5 times longer than Trotterization on current-term quantum hardware. This provides a 10 4 times improvement over the previous record.