A Grover Search-Based Algorithm for the List Coloring Problem

Graph coloring is a computationally difficult problem, and currently the best known classical algorithm for k -coloring of graphs on n vertices has runtimes Ω(2n) for k≥5 . The list coloring problem asks the following more general question: given a list of available colors for each vertex in a graph, does it admit a proper coloring? We propose a hybrid classical-quantum algorithm based […]

Finding Solutions to the Integer Case Constraint Satisfiability Problem Using Grover’s Algorithm

Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover’s search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high probability for several cases and are illustrated for the cases involving two variables for both 3- and 4-bit numbers. Methods are defined for […]

Quantum Bloom Filter and Its Applications

A quantum Bloom filter is a spatially more efficient data structure which is used to represent a set of n elements by using O(lognk) qubits. In this article, we define and design a quantum Bloom filter and its corresponding algorithms. Due to the reversibility of quantum operators, it can not only add a new element to a quantum Bloom […]

Quantum Attacks on HCTR and Its Variants

Recently, in Asiacrypt 2019, Bonnetain et al. have shown attacks by quantum adversaries on FX construction and Even-Mansour Cipher without using superposition queries to the encryption oracle. In this article, we use a similar approach to mount new attacks on Hash-Counter (HCTR) and Hash-Counter-Hash (HCH) constructions. In addition, we mount attacks on HCTR, tweakable-HCTR, and […]

Subdivided Phase Oracle for NISQ Search Algorithms

Because noisy intermediate-scale quantum (NISQ) machines accumulate errors quickly, we need new approaches to designing NISQ-aware algorithms and assessing their performance. Algorithms with characteristics that appear less desirable under ideal circumstances, such as lower success probability, may in fact outperform their ideal counterparts on existing hardware. We propose an adaptation of Grover’s algorithm, subdividing the […]