The intensive pursuit for quantum advantage in terms of computational complexity has
further led to a modernized crucial question of when and how will quantum computers …

Successful implementations of quantum technologies require protocols and algorithms that
use as few quantum resources as possible. However, many important quantum operations …

A number of exciting recent results have been seen in the field of quantum error correction.
These include initial demonstrations of error correction on current quantum hardware and …

In this perspective article, we revisit and critically evaluate prevailing viewpoints on the
capabilities and limitations of near-term quantum computing and its potential transition …

Magic state distillation plays an important role in universal fault-tolerant quantum computing,
and its overhead is one of the major obstacles to realizing fault-tolerant quantum computers …

Among the cost metrics characterizing a quantum circuit, the $ T $-count stands out as one
of the most crucial as its minimization is particularly important in various areas of quantum …

Exploring low-cost applications is paramount to creating value in early fault-tolerant
quantum computers. Here we optimize both gate and qubit counts of recent algorithms for …

In this paper, we use open-source tools to perform quantum resource estimation to assess
the requirements for industry-relevant quantum computation. Our analysis uses the problem …

The purpose of unitary synthesis is to find a gate sequence that optimally approximates a
target unitary transformation. A new synthesis approach, called probabilistic synthesis, has …

Many quantum algorithms rely on a quality initial state for optimal performance. Preparing an
initial state for specific applications can considerably reduce the cost of probabilistic …