English
Related papers

Related papers: Quantum-assisted Rendezvous on Graphs: Explicit Al…

200 papers

Quantum field theory (QFT) simulations are a potentially important application for noisy intermediate scale quantum (NISQ) computers. The ability of a quantum computer to emulate a QFT, therefore, constitutes a natural application-centric…

We explore the use of machine-learning techniques to detect quantum speedup in random walks on graphs. Specifically, we investigate the performance of three different neural-network architectures (variations on fully connected and…

Quantum Physics · Physics 2023-09-06 Hanna Linn , Yu Zheng , Anton Frisk Kockum

Quantum algorithms are getting extremely popular due to their potential to significantly outperform classical algorithms. Yet, applying quantum algorithms to optimization problems meets challenges related to the efficiency of quantum…

Many researchers have been heavily investigated on quantum phase estimation (QPE) algorithms to find the unknown phase, since QPE is the core building block of the most quantum algorithms such as the Shor's factoring algorithm, quantum…

Quantum Physics · Physics 2019-03-19 Hamed Mohammadbagherpoor , Young-Hyun Oh , Anand Singh , Xianqing Yu , Andy J. Rindos

NISQ devices have several physical limitations and unavoidable noisy quantum operations, and only small circuits can be executed on a quantum machine to get reliable results. This leads to the quantum hardware under-utilization issue. Here,…

Hardware Architecture · Computer Science 2023-02-22 Siyuan Niu , Aida Todri-Sanial

Commercially available Noisy Intermediate-Scale Quantum (NISQ) devices now make small hybrid quantum-classical experiments practical, but many tools hide configuration or demand ad-hoc scripting. We introduce the Quantum Experiment…

Quantum Physics · Physics 2025-11-07 Vincent Gierisch , Wolfgang Mauerer

On neutral atom platforms, preparing specific quantum states is usually achieved by pulse shaping, i.e., by optimizing the time-dependence of the Hamiltonian related to the system. This process can be extremely costly, as it requires…

Quantum Physics · Physics 2022-08-03 Wesley da Silva Coelho , Mauro D'Arcangelo , Louis-Paul Henry

As Noisy Intermediate-Scale Quantum (NISQ) devices grow in number of qubits, determining good or even adequate parameter configurations for a given application, or for device calibration, becomes a cumbersome task. An evolutionary algorithm…

Quantum Physics · Physics 2021-07-15 Luke Mortimer , Marta P. Estarellas , Timothy P. Spiller , Irene D'Amico

Superconducting qubits are leading candidates in the race to build a quantum computer capable of realizing computations beyond the reach of modern supercomputers. The superconducting qubit modality has been used to demonstrate prototype…

Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in…

Quantum Physics · Physics 2018-08-08 John Preskill

Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…

Quantum Physics · Physics 2019-12-18 Alexey A. Melnikov , Leonid E. Fedichkin , Alexander Alodjants

Currently available quantum computing hardware platforms have limited 2-qubit connectivity among their addressable qubits. In order to run a generic quantum algorithm on such a platform, one has to transform the initial logical quantum…

Quantum Physics · Physics 2020-04-28 Beatrice Nash , Vlad Gheorghiu , Michele Mosca

To bridge the gap between limited hardware access and the huge demand for experiments for Noisy Intermediate-Scale Quantum (NISQ) computing system study, a simulator which can capture the modeling of both the quantum processor and its…

Quantum Physics · Physics 2019-05-08 Gushu Li , Yufei Ding , Yuan Xie

Quantum computing has proven to be capable of accelerating many algorithms by performing tasks that classical computers cannot. Currently, Noisy Intermediate Scale Quantum (NISQ) machines struggle from scalability and noise issues to render…

Emerging Technologies · Computer Science 2023-09-20 Chao Lu , Navnil Choudhury , Utsav Banerjee , Abdullah Ash Saki , Kanad Basu

Quantum networks are of high interest nowadays. In short, they describe the distribution of quantum sources represented by edges to different parties represented by nodes in the networks. Bundles of tools have been developed recently to…

Quantum Physics · Physics 2023-10-24 Zhen-Peng Xu

In the era of noisy intermediate-scale quantum (NISQ), executing quantum algorithms on actual quantum devices faces unique challenges. One such challenge is that quantum devices in this era have restricted connectivity: quantum gates are…

Quantum Physics · Physics 2020-11-16 Yao Tang

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…

One of the outstanding challenges in contemporary science and technology is building a quantum computer that is useful in applications. By starting from an estimate of the algorithm success rate, we can explicitly connect gate fidelity to…

Quantum Physics · Physics 2026-03-20 R. Barends , F. K. Wilhelm

Quantum Computers, one fully realized, can represent an exponential boost in computing power. However, the computational power of the current quantum computers, referred to as Noisy Internediate Scale Quantum, or NISQ, is severely limited…

Quantum Physics · Physics 2023-02-27 George Gesek

We propose a new method for evaluating NISQ devices. This paper has three distinct parts. First, we present a new quantum algorithm that solves a two hundred year old problem of finding quadratic nonresidues (QNR) in polynomial time. We…

Quantum Physics · Physics 2022-03-03 Thomas G. Draper