A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

The concept of quantum computing has inspired a whole new generation of scientists,
including physicists, engineers, and computer scientists, to fundamentally change the …

Implementing a gate-based quantum algorithm on an noisy intermediate scale quantum
(NISQ) device has several challenges that arise from the fact that such devices are noisy …

Due to several physical limitations in the realization of quantum hardware, today's quantum
computers are qualified as noisy intermediate-scale quantum (NISQ) hardware. NISQ …

''Qubit routing” refers to the task of modifying quantum circuits so that they satisfy the
connectivity constraints of a target quantum computer. This involves inserting SWAP gates …

We study the problem of finding the best approximate circuit that is the closest (in some
pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like …

The weighted MAX k k-CUT problem consists of finding ak-partition of a given weighted
undirected graph G (V, E), such that the sum of the weights of the crossing edges is …

As state-of-the-art quantum computers are capable of running increasingly complex
algorithms, the need for automated methods to design and test potential applications rises …

Quantum computing is an emerging technology that has the potential to revolutionize fields
such as cryptography, machine learning, optimization, and quantum simulation. However, a …

Quantum Computing (QC) claims to improve the efficiency of solving complex problems,
compared to classical computing. When QC is applied to Machine Learning (ML) …