12 papers · ranked by Valyu relevance
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…
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.
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…
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…
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…
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…
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…
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…