Iterative Qubits Management for Quantum Index Searching in a Hybrid System

by   Wenrui Mu, et al.
Fordham University
George Mason University

Recent advances in quantum computing systems attract tremendous attention. Commercial companies, such as IBM, Amazon, and IonQ, have started to provide access to noisy intermediate-scale quantum computers. Researchers and entrepreneurs attempt to deploy their applications that aim to achieve a quantum speedup. Grover's algorithm and quantum phase estimation are the foundations of many applications with the potential for such a speedup. While these algorithms, in theory, obtain marvelous performance, deploying them on existing quantum devices is a challenging task. For example, quantum phase estimation requires extra qubits and a large number of controlled operations, which are impractical due to low-qubit and noisy hardware. To fully utilize the limited onboard qubits, we propose IQuCS, which aims at index searching and counting in a quantum-classical hybrid system. IQuCS is based on Grover's algorithm. From the problem size perspective, it analyzes results and tries to filter out unlikely data points iteratively. A reduced data set is fed to the quantum computer in the next iteration. With a reduction in the problem size, IQuCS requires fewer qubits iteratively, which provides the potential for a shared computing environment. We implement IQuCS with Qiskit and conduct intensive experiments. The results demonstrate that it reduces qubits consumption by up to 66.2


page 1

page 5

page 6


QAOA for Max-Cut requires hundreds of qubits for quantum speed-up

Computational quantum technologies are entering a new phase in which noi...

Coreset Clustering on Small Quantum Computers

Many quantum algorithms for machine learning require access to classical...

QSpeech: Low-Qubit Quantum Speech Application Toolkit

Quantum devices with low qubits are common in the Noisy Intermediate-Sca...

A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles

Recent works have shown that quantum computers can polynomially speed up...

A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing

Despite rapid recent progress towards the development of quantum compute...

Efficient MILP Decomposition in Quantum Computing for ReLU Network Robustness

Emerging quantum computing technologies, such as Noisy Intermediate-Scal...

Distributed Quantum Computing: a Survey

Nowadays, quantum computing has reached the engineering phase, with full...

Please sign up or login with your details

Forgot password? Click here to reset