24 papers · ranked by Valyu relevance
Ashley Montanaro
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large systems of linear equations. Here we briefly survey some known quantum…
Amine Zeguendry, Zahi Jarir, Mohamed Quafafou, Andreas Wichert
Despite its undeniable success, classical machine learning remains a resource-intensive process. Practical computational efforts for training state-of-the-art models can now only be handled by high speed computer hardware. As this trend is expected to continue, it should come as no surprise that an increasing number of…
Elliot Catt, Marcus Hütter
In this technical report we give an elementary introduction to Quantum Computing for nonphysicists. In this introduction we describe in detail some of the foundational Quantum Algorithms including: the Deutsch-Jozsa Algorithm, Shor's Algorithm, Grocer Search, and Quantum Counting Algorithm and briefly the Harrow-Lloyd…
Federico Holik, Giuseppe Sergioli, Hector Freytes, Angel Plastino
In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.
Patrick J. Coles, Stephan Eidenbenz, Scott Pakin, Adetokunbo Adedoyin + 28 more
'Adetokunbo Adedoyin' 'John Ambrosiano' 'Petr M. Anisimov' 'William Casper' 'Gopinath Chennupati' 'Carleton Coffrin' 'Hristo Djidjev' 'David Gunter' 'Satish Karra' 'Nathan Lemons' 'Shizeng Lin' 'Andrey Y. Lokhov' 'Alexander Malyzhenkov' 'David Mascareñas' 'Susan M. Mniszewski' 'Balu Nadiga' 'Dan O’Malley' 'Diane Oyen'…
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…
Petar Nikolov
Quantum information theory and the quantum computing as the biggest part of this scientific area, is one of the fast growing emerging technologies nowadays. Quantum computers use the quantum mechanical effects like superposition, entanglement and coherence to process information. The main difference with the classical…
Shihao Zhang, Lvzhou Li
Quantum algorithms are demonstrated to outperform classical algorithms for certain problems and thus are promising candidates for efficient information processing. Herein we aim to provide a brief and popular introduction to quantum algorithms for both the academic community and the general public with interest. We…
Ping Zhang, Durdu Guney, David Petrosyan
Shinagawa and Iwata are considered quantum security for the sum of Even-Mansour (SoEM) construction and provided quantum key recovery attacks by Simon’s algorithm and Grover’s algorithm. Furthermore, quantum key recovery attacks are also presented for natural generalizations of SoEM. For some variants of SoEM, they…
BongJu Kim
We introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations of quantum mechanics had been established in around 1930, by von Neumann. The formulation uses functional…
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…
Rehab Elgendy, Ahmed Younes, H. M. Abu-Donia, R. M. Farouk
Analyzing the relations between Boolean functions has many applications in many fields, such as database systems, cryptography, and collision problems. This paper proposes four quantum algorithms that use amplitude amplification techniques to perform set operations, including Intersection, Difference, and Union, on two…
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…
Lihui Lv, Bao Yan, Hong Wang, Zhi Ma + 5 more
'Qianheng Duan' 'Brian R. La Cour' 'Giuliano Benenti'] The variational quantum algorithm (VQA) is a hybrid classical-quantum algorithm. It can actually run in an intermediate-scale quantum device where the number of available qubits is too limited to perform quantum error correction, so it is one of the most promising…
Kapil Kumar Soni, Akhtar Rasool, Siddhartha Bhattacharyya
This article presents efficient quantum solutions for exact multiple pattern matching to process the biological sequences. The classical solution takes Ο(mN) time for matching m patterns over N sized text database. The quantum search mechanism is a core for pattern matching, as this reduces time complexity and achieves…
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…
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…
Jing-Kai Fang, Yue-Feng Lin, Jun-Han Huang, Yibo Chen + 9 more
Computational biology holds immense promise as a domain that can leverage quantum advantages due to its involvement in a wide range of challenging computational tasks. Researchers have recently explored the applications of quantum computing in genome assembly implementation. However, the issue of repetitive sequences…
Weitang Li, Zhi Yin, Xiaoran Li, Dongqiang Ma + 8 more
Quantum computing, with its superior computational capabilities compared to classical approaches, holds the potential to revolutionize numerous scientific domains, including pharmaceuticals. However, the application of quantum computing for drug discovery has primarily been limited to proof-of-concept studies, which…
Zhihao Lan, WanZhen Liang
The variational quantum eigensolver (VQE) algorithm can simulate the chemical systems such as molecules in the noisy intermediate-scale quantum devices and shows promising applications in quantum chemistry simulations. The accuracy and computational cost of the VQE simulations are determined by the underlying Ansätze.…
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…
Authors not listed
Accurate prediction of reaction barriers and transition states is central to understanding electrolyte degradation pathways in battery systems, yet existing approaches face significant computational trade-offs. Classical quantum-chemistry methods like density functional theory (DFT) scale favorably but often miss…
Dillion M. Fox, Kim M. Branson, Ross C. Walker
Reverse translation of polypeptide sequences to expressible mRNA constructs is a NP-hard combinatorial optimization problem. Each amino acid in the protein sequence can be represented by as many as six codons, and the process of selecting the combination that maximizes probability of expression is termed codon…
Yann Garniron, Thomas Applencourt, Kevin Gasperich, Anouar Benali + 15 more
Quantum Package is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multi-reference second-order perturbation theory (PT2). The determinant-driven…