Quantum computers promise dramatic advantages in processing speed over currently
available computer systems. Quantum computing offers great promise in a wide variety of …

We devise a quasilinear quantum algorithm for generating an approximation for the ground
state of a quantum field theory (QFT). Our quantum algorithm delivers a superquadratic …

Quantum computing has been a fascinating research field in quantum physics. Recent
progresses motivate us to study in depth the universal quantum computing models …

Most contemporary quantum programming languages describe computation as circuits,
using a host classical counterpart to drive the execution of quantum programs. However, the …

Span programs are an important model of quantum computation due to their tight
correspondence with quantum query complexity. For any decision problem $ f $, the …

Existing abstract models of quantum computation make reference to circuit elements, much
in contrast to their classical counterparts. Circuits, as a model of computation, substantially …

Quantum recursive programming has been recently introduced for describing sophisticated
and complicated quantum algorithms in a compact and elegant way. However …

Simulating a quantum field theory (QFT) on a quantum computer comprises three steps:
generating an initial state, simulating time evolution and measuring observables, with the …

Experience from seven decades of classical computing suggests that a sustainable
computer industry depends on a community of software engineers writing programs to …

In this research, we present a quantum circuit design and implementation for a parallel
universal linear bounded automata. This circuit is able to accelerate the inference of …