19 papers · ranked by Valyu relevance
C. Figgatt, D. Maslov, K. A. Landsman, N. M. Linke + 2 more
'C. Monroe'] The Grover quantum search algorithm is a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions…
Ye-Chao Liu, Jiangwei Shang, Xiangdong Zhang
Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the depletion of quantum coherence turns out to be a common phenomenon in these…
Abdirahman Alasow, Peter Jin, Marek Perkowski, Brian R. La Cour + 1 more
'Giuliano Benenti'] In this paper, we proposed a novel quantum algorithm for the maximum satisfiability problem. Satisfiability (SAT) is to find the set of assignment values of input variables for the given Boolean function that evaluates this function as TRUE or prove that such satisfying values do not exist. For a…
Apoorva Patel
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other quantum features. Several of these set-ups are described, pointing out that some…
Tim Byrnes, Gary Forster, Louis Tessler
Grover's algorithm is a quantum search algorithm that proceeds by repeated applications of the Grover operator and the Oracle until the state evolves to one of the target states. In the standard version of the algorithm, the Grover operator inverts the sign on only one state. Here we provide an exact solution to the…
Patrícia Verdugo Pascoal, Deborah Bambil, Luisa Mayumi Arake de Tacca, Rayane Nunes Lima + 3 more
The accelerated exploration and engineering of nucleotide sequences are directed towards quantum mechanics and their intrinsic entanglements, implementing the qubits states, including the development of algorithms. The production rate of biological sequencing data has increased to approximately 1 Gb/h, but the ability…
Kevin B. Clark
Grover's quantum (search) algorithm exploits principles of quantum information theory and computation to surpass the strong Church-Turing limit governing classical computers. The algorithm initializes a search field into superposed N (eigen)states to later execute nonclassical “subroutines” involving unitary phase…
Daniel Koch, Laura Wessing, Paul M. Alsing
As the field of Quantum Computing continues to grow, so too has the general public's interest in testing some of the publicly available quantum computers. However, many might find learning all of the supplementary information that goes into quantum algorithms to be a daunting task, and become discouraged. This tutorial…
Daniel Koch, Laura Wessing, Paul M. Alsing
As the field of Quantum Computing continues to grow, so too has the general public's interest in testing some of the publicly available quantum computers. However, many might find learning all of the supplementary information that goes into quantum algorithms to be a daunting task, and become discouraged. This tutorial…
Muhammad Abdullah Ijaz, Muhammad Faryad
The quantum singular value transformation (QSVT) algorithm is a general framework to implement most of the known algorithms and provides a way forward for designing new algorithms. In the present work, the impact of noise on the QSVT algorithm is examined for bit flip, phase flip, bit-phase flip, and depolarizing noise…
Antonio A. Lagana, Max A. Lohe, Lorenz von Smekal, Gerardo Adesso
We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from…
Avatar Tulsi
Given two sets A and B and two oracles OA and OB that can identify the elements of these sets respectively, the goal is to find an element common to both sets using minimum number of oracle queries. Each application of either OA or OB is taken as a single oracle query. This is basically a search problem and a…
Bao Yan, Shijie Wei, Haocong Jiang, Hong Wang + 3 more
'Zhi Ma' 'Gui-Lu Long'] The quantum amplitude amplification algorithms based on Grover’s rotation operator need to perform phase flips for both the initial state and the target state. When the initial state is oblivious, the phase flips will be intractable, and we need to adopt oblivious amplitude amplification…
Christos Papalitsas, Ioannis Mouratidis, Michail Patsakis, Evangelos Stogiannos + 2 more
The exponential growth of publicly available genomic data has created unprecedented opportunities for sequence-based discovery. Locating specific k-mers is fundamental to diverse applications, including metagenomic classification, pathogen and cancer detection, and variant calling yet efficient identification of…
Avatar Tulsi
Many important computer science problems can be reduced to clause satisfaction problem. We are given n Boolean variables xk and m clauses cj where each clause is a function of values of some of xks. We want to find an assignment i of xks for which all m clauses are satisfied. Let fj (i) be a binary function which is 1…
Robert Benkoczi, Daya Gaur, Naya Nagy, Marius Nagy + 3 more
'Shahadat Hossain' 'Andrei Khrennikov' 'Karl Svozil'] This paper studies the effect of quantum computers on Bitcoin mining. The shift in computational paradigm towards quantum computation allows the entire search space of the golden nonce to be queried at once by exploiting quantum superpositions and entanglement.…
Authors not listed
The Hidden Subgroup Problem (HSP) unifies several landmark quantum algorithms, yet systematic exploration of its variants and modern applications has slowed. This paper revives HSP-based algorithm design by examining new group structures with direct relevance to post-quantum cryptography, lattice problems, and…
Koichi Miyamoto, Naoki Yamamoto, Yasubumi Sakakibara
We propose two quantum algorithms for a problem in bioinformatics, position weight matrix (PWM) matching, which aims to find segments (sequence motifs) in a biological sequence such as DNA and protein that have high scores defined by the PWM and are thus of informational importance related to biological function. The…
Authors not listed
We present a unified theoretical framework that classifies and analyzes quantum enhancement strategies for classical algorithms, establishing design paradigms that systematically combine quantum subroutines with classical procedures. The theory identifies four fundamental enhancement mechanisms: quantum search…