Related papers: Quantum-Assisted Graph Domination Games
In recent years, Quantum Computing (QC) has progressed to the point where small working prototypes are available for use. Termed Noisy Intermediate-Scale Quantum (NISQ) computers, these prototypes are too small for large benchmarks or even…
Numerous scientific developments in this NISQ-era (Noisy Intermediate Scale Quantum) have raised the importance for quantum algorithms relative to their conventional counterparts due to its asymptotic advantage. For resource estimates in…
Nowadays in Quantum Computing, the implementation of quantum algorithm has created a stir since Noisy Intermediate-Scale Quantum (NISQ) devices are out in the market. Researchers are mostly interested in solving NP-complete problems with…
Complex quantum networks are not only hard to establish, but also difficult to simulate due to the exponentially growing state space and noise-induced imperfections. In this work, we propose an alternative approach that leverage quantum…
Different platforms for quantum computation are currently being developed with a steadily increasing number of physical qubits. To make today's devices practical for quantum software engineers, novel programming tools with maximal…
The promise of quantum computing to address complex problems requiring high computational resources has long been hindered by the intrinsic and demanding requirements of quantum hardware development. Nonetheless, the current state of…
Quantum walk has emerged as an essential tool for searching marked vertices on various graphs. Recent advances in the discrete-time quantum walk search algorithm have enabled it to effectively handle multiple marked vertices, expanding its…
In the context of NISQ computers - Noise Intermediate Scale Quantum, it is a consensus that the distribution of circuits among processing agents is a viable approach to get greater scalability with small machines. This approach can increase…
Achieving quantum speedups in practical tasks remains challenging for current noisy intermediate-scale quantum (NISQ) devices. These devices always encounter significant obstacles such as inevitable physical errors and the limited…
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
With the birth of Noisy Intermediate Scale Quantum (NISQ) devices and the verification of "quantum supremacy" in random number sampling and boson sampling, more and more fields hope to use quantum computers to solve specific problems, such…
We draw the current landscape of quantum algorithms, by classifying about 130 quantum algorithms, according to the fundamental mathematical problems they solve, their real-world applications, the main subroutines they employ, and several…
Approximate controllability for a quantum system on a graph using as control parameters boundary conditions will be proven. This establishes a first theoretical proof of the feasibility of the quantum control at the boundary paradigm. A…
Quantum Supremacy is a demonstration of a computation by a quantum computer that can not be performed by the best classical computer in a reasonable time. A well-studied approach to demonstrating this on near-term quantum computers is to…
Noisy Intermediate-Scale Quantum (NISQ) machines are not fault-tolerant, operate few qubits (currently, less than hundred), but are capable of executing interesting computations. Above the quantum supremacy threshold (approx. 60 qubits),…
In the noisy intermediate-scale quantum (NISQ) era, quantum error mitigation (QEM) is essential for producing reliable outputs from quantum circuits. We present a statistical signal processing approach to QEM that estimates the most likely…
Noisy intermediate scale quantum computers are useful for various tasks such as state preparation and variational quantum algorithms. However, the non-Euclidean quantum geometry of parameterized quantum circuits is detrimental for these…
Real-time clustering of big performance data generated by the telecommunication networks requires domain-specific high performance compute infrastructure to detect anomalies. In this paper, we evaluate noisy intermediate-scale quantum…
Quantum computing (QC) provides a promising avenue toward enabling quantum chemistry calculations, which are classically impossible due to a computational complexity that increases exponentially with system size. As fully fault-tolerant…
The synthesis approaches for quantum circuits typically aim at minimizing the number of lines or gates. Given the tight restrictions on those logical resources in physical implementations, we propose to view the problem fundamentally…