检索结果-内蒙古大学图书馆

Computational Analysis: Unveiling the quantum algorithms for Protein Analysis and Predictions

IEEE ACCESS 2023年 11卷 94023-94033页

作者： Bhuvaneswari, S. Deepakraj, R. Urooj, Shabana Sharma, Neelam Pathak, Nitish Easwari Engn Coll Dept Comp Sci & Engn Chennai 600089 India Princess Nourah Bint Abdulrahman Univ Coll Engn Dept Elect Engn Riyadh 11671 Saudi Arabia Guru Gobind Singh Indraprastha Univ GGSIPU Maharaja Agrasen Inst Technol MAIT Dept Artificial Intelligence & Machine Learning New Delhi 110078 India GGSIPU Bhagwan Parshuram Inst Technol BPIT Dept Informat Technol New Delhi 110078 India

The study of protein-protein interactions (PPIs) and predicting the protein structure plays a critical role in understanding cellular processes and designing therapeutic interventions. In this research, we explore the application of quantum algorithms, specifically Grover's algorithm, in improving the accuracy and efficiency of PPI prediction. By harnessing the inherent parallelism and quantum search capabilities of Grover's algorithm, we aim to enhance the identification of interacting protein pairs from large-scale datasets. We demonstrate the effectiveness of using this algorithm through an extensive approach, comparing the performance of Grover's algorithm with classical machine learning algorithms. Our results reveal that the quantum algorithm offers significant improvements in prediction accuracy, enabling the identification of previously undetected PPIs. Moreover, we discuss the advantages and limitations of using Grover's algorithm in PPI prediction and provide insights into its potential for accelerating research in protein interaction networks. This research highlights the potential of quantum algorithms in advancing the field of bioinformatics and protein interaction analysis.

关键词： Bioinformatics Grover's algorithm protein-protein interaction (PPI) protein structure quantum algorithms quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Utilizing quantum algorithms to achieve carbon neutrality in urban areas: A systematic review

引用

ALEXANDRIA ENGINEERING JOURNAL 2024年 108卷 911-936页

作者： Munawar, Ghifari Surendro, Kridanto Inst Teknol Bandung Sch Elect Engn & Informat Bandung 40132 Indonesia Politekn Negeri Bandung Dept Comp Engn & Informat Bandung 40559 Indonesia

In the face of climate change, urban areas, as major sources of greenhouse gas (GHG) emissions, are pivotal in mitigation efforts. Cities worldwide are striving to achieve carbon neutrality, aligning with the Sustainable Development Goals (SDGs). quantum computing (QC), with its ability to leverage qubits and surpass the limitations of classical computing, presents a promising avenue for optimizing processes in energy, transportation, and climate change mitigation. This study conducts a systematic literature review following Kitchenham's framework, analyzing 96 out of 3397 articles from four major academic databases. The review focuses on the implementation of quantum algorithms, including pure quantum algorithms (PQA), hybrid quantum-classical algorithms (HQC), and quantum-inspired classical algorithms (QIC), with 40 distinct methods such as quantum Annealing (QA), quantum-inspired Particle Swarm Optimization (QiPSO), and quantum Approximate Optimization Algorithm (QAOA). The analysis identifies key application domains: algorithmic tasks, types of implications, GHG emission sectors, and quantum methods, highlighting allocation and routing tasks as dominant themes. Notably, the transportation and energy sectors, along with the QA method, feature prominently. Furthermore, a detailed nexus analysis reveals significant interconnections between algorithmic tasks, quantum methods, and their practical implications, particularly in energy efficiency and resource allocation. The findings underscore the growing role of quantum algorithms in reducing urban GHG emissions and advancing toward carbon neutrality, showcasing QC's potential in supporting sustainable cities and effective climate action. (c) 2017 Elsevier Inc. All rights reserved.

关键词： quantum algorithms carbon-neutrality GHG emissions sustainable city review

来源：评论

学校读者我要写书评

暂无评论

The rhythm of quantum algorithms

引用

SOFT COMPUTING 2017年第6期21卷 1515-1521页

作者： Bonzio, Stefano Verrucchi, Paola Univ Cagliari Dept Pedag Psychol & Philosophy Cagliari Italy Univ Firenze ISC CNR Dipartimento Fis & Astron INFN Via G Sansone 1 I-50019 Sesto Fiorentino FI Italy

quantum algorithms can be generally represented as the dynamical evolution of an input quantum register, with the action of each logical gate, as well as of any transmission channel, defined by some quantum propagator. From a global viewpoint, this unitary dynamics is ruled by the flow of a continuous time, and the possible splitting into shorter logical sub-units is nothing but a harmless, though useful, zooming process. On the other hand, understanding how elementary units of the quantum register, namely single qubits, are actually hauled along the algorithm, is a more complex matter, as it involves the dynamical entanglement generation entailed in the action of two-qubit gates. In this work, we first review how the essential elements of quantum algorithms can be described in terms of dynamical processes, and then analyze the corresponding non-unitary dynamics of single qubits, by referring to the formalism adopted in the study of open quantum systems. We show that single qubits evolution cannot be split into intervals shorter than the typical time needed by two-qubit gates for accomplishing their task, which somehow gives a rhythmical structure to the algorithm itself. We further point out that the local evolution entails a memory, in that the way each qubit takes an infinitesimally small step forward in time, is set by its previous history, back to the instant when it entered the last two-qubit gate. This memory originates from quantum correlations, and it is suggested to play an essential role in quantum information processing. As a concluding remark, we just touch on the idea that a similar analysis could be put forward for getting a clue on how we extract meaningful contents out of complex informational input.

关键词： quantum algorithms Open quantum systems Non-markovian dynamics quantum computation and music

来源：评论

学校读者我要写书评

暂无评论

Variety of Effects of Decoherence in quantum algorithms

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2009年第5期E92A卷 1284-1292页

作者： Hasegawa, Jun Univ Tokyo Grad Sch Informat Sci & Technol Dept Comp Sci Tokyo 1130033 Japan

quantum computations have so far proved to be more powerful than classical computations, but quantum computers still have not been put into practical use due to several technical issues. One of the most serious problems for realizing quantum computers is decoherence that occurs inevitably since our apparatus are surrounded with environment and open systems. In this paper, we give some surveys on a variety of effects of decoherence in quantum algorithms such as Grover's database search and quantum walks, and we show how quantum algorithms work under decoherence, how sensitive they are against decoherence, and how to implement a robust quantum circuit.

关键词： decoherence quantum algorithms Grover's database search quantum walks quantum circuits

来源：评论

学校读者我要写书评

暂无评论

Magic state distillation and gate compilation in quantum algorithms for quantum chemistry

引用

INTERNATIONAL JOURNAL OF quantum CHEMISTRY 2015年第19期115卷 1296-1304页

作者： Trout, Colin J. Brown, Kenneth R. Georgia Inst Technol Sch Chem & Biochem Atlanta GA 30332 USA Georgia Inst Technol Sch Phys Atlanta GA 30332 USA Georgia Inst Technol Sch Computat Sci & Engn Atlanta GA 30332 USA

quantum algorithms for quantum chemistry map the dynamics of electrons in a molecule to the dynamics of a coupled spin system. To reach chemical accuracy for interesting molecules, a large number of quantum gates must be applied which implies the need for quantum error correction and fault-tolerant quantum computation. Arbitrary fault-tolerant operations can be constructed from a small, universal set of fault-tolerant operations by gate compilation. quantum chemistry algorithms are compiled by decomposing the dynamics of the coupled spin-system using a Trotter formula, synthesizing the decomposed dynamics using Clifford operations and single-qubit rotations, and finally approximating the single-qubit rotations by a sequence of fault-tolerant single-qubit gates. Certain fault-tolerant gates rely on the preparation of specific single-qubit states referred to as magic states. As a result, gate compilation and magic state distillation are critical for solving quantum chemistry problems on a quantum computer. We review recent progress that has improved the efficiency of gate compilation and magic state distillation by orders of magnitude. (c) 2015 Wiley Periodicals, Inc.

关键词： magic state distillation quantum algorithms quantum computation gate compilation quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem

引用

DESIGNS CODES AND CRYPTOGRAPHY 2024年第10期92卷 2825-2843页

作者： Imran, Muhammad Ivanyos, Gabor Budapest Univ Technol & Econ Dept Algebra & Geometry Egry Jozsef U 1 H-1111 Budapest Hungary HUN REN Inst Comp Sci & Control Kende U 13-17 H-1111 Budapest Hungary

The semidirect discrete logarithm problem (SDLP) is the following analogue of the standard discrete logarithm problem in the semidirect product semigroup G (sic) End(G) for a finite semigroup G. Given g is an element of G, sigma is an element of End(G), and h = Pi(t-1)(i=0) sigma(i) (g) for some integer t, the SDLP(G, sigma), for g and h, asks to determine t. As Shor's algorithm crucially depends on commutativity, it is believed not to be applicable to the SDLP. For generic semigroups, the best known algorithm for the SDLP is based on Kuperberg's subexponential time quantum algorithm. Still, the problem plays a central role in the security of certain proposed cryptosystems in the family of semidirect product key exchange. This includes a recently proposed signature protocol called SPDH-Sign. In this paper, we show that the SDLP is even easier in some important special cases. Specifically, for a finite group G, we describe quantum algorithms for the SDLP in G (sic) Aut(G) for the following two classes of instances: the first one is when G is solvable and the second is when G is amatrix group and a power of sigma with a polynomially small exponent is an inner automorphism of G. We further extend the results to groups composed of factors from these classes. Aconsequence is that SPDH-Sign and similar cryptosystems whose security assumption is based on the presumed hardness of the SDLP in the cases described above are insecure against quantum attacks. The quantum ingredients we rely on are not new: these are Shor's factoring and discrete logarithm algorithms and well-known generalizations.

关键词： Semidirect discrete logarithm problem quantum algorithms quantum cryptanalysis

来源：评论

学校读者我要写书评

暂无评论

Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

引用

JOURNAL OF THE ACM 2007年第1期54卷 4-1-4-19页

作者： Hallgren, Sean MSRI Berkeley CA USA Univ Calif Berkeley Berkeley CA 94720 USA

We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, Pell's equation is x(2) - dy(2) = 1 and the goal is to find its integer solutions. Factoring integers reduces to finding integer solutions of Pell's equation, but a reduction in the other direction is not known and appears more difficult. The second problem we solve is the principal ideal problem in real quadratic number fields. This problem, which is at least as hard as solving Pell's equation, is the one-way function underlying the Buchmann-Williams key exchange system, which is therefore broken by our quantum algorithm. Finally, assuming the generalized Riemann hypothesis, this algorithm can be used to compute the class group of a real quadratic number field.

关键词： algorithms theory quantum algorithms quantum computation

来源：评论

学校读者我要写书评

暂无评论

New quantum algorithms for Computing quantum Entropies and Distances

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2024年第8期70卷 5653-5680页

作者： Wang, Qisheng Guan, Ji Liu, Junyi Zhang, Zhicheng Ying, Mingsheng Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Nagoya Univ Grad Sch Math Nagoya 4648602 Japan Chinese Acad Sci Key Lab Syst Software Beijing 100190 Peoples R China Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing 100190 Peoples R China Univ Maryland Joint Ctr Quantum Informat & Comp Sci College Pk MD 20742 USA Univ Technol Sydney Ctr Quantum Soft ware & Informat Sydney NSW 2007 Australia

We propose a series of quantum algorithms forcomputing a wide range of quantum entropies and distances,including the von Neumann entropy, quantum R & eacute;nyi entropy,trace distance, and fidelity. The proposed algorithms significantlyoutperform the prior best (and even quantum) ones in thelow-rank case, some of which achieve exponential *** particular, forN-dimensional quantum states of rankr, ourproposed quantum algorithms for computing the von Neumannentropy, trace distance and fidelity within additive error epsilon havetime complexity of O(r/epsilon(2)), O(r(5)/epsilon(6))and O(r(6.5)/epsilon(7.5)),respectively. By contrast, prior quantum algorithms for the vonNeumann entropy and trace distance usually have time complex-ity ohm (N), and the prior best one for fidelity has time complexity O(r(12.5)/epsilon(13.5)). The key idea of our quantum algorithms isto extend block-encoding from unitary operators in previouswork to quantum states (i.e., density operators). It is realized bydeveloping several convenient techniques to manipulate quantumstates and extract information from them. The advantage of ourtechniques over the existing methods is that no restrictions ondensity operators are required;in sharp contrast, the previousmethods usually require a lower bound on the minimal non-zeroeigenvalue of density operators

关键词： quantum state quantum algorithm Entropy quantum computing Complexity theory Computational modeling Time complexity quantum algorithms quantum entropy trace distance quantum fidelity

来源：评论

学校读者我要写书评

暂无评论

Metasurface for programmable quantum algorithms with classical and quantum light

引用

NANOPHOTONICS 2024年第6期13卷 927-936页

作者： Tanuwijaya, Randy Stefan Liang, Hong Xi, Jiawei Wong, Wai Chun Yung, Tsz Kit Tam, Wing Yim Li, Jensen Hong Kong Univ Sci & Technol Dept Phys Kowloon Clear Water Bay Hong Kong Peoples R China

Metasurfaces have recently opened up applications in the quantum regime, including quantum tomography and the generation of quantum entangled states. With their capability to store a vast amount of information by utilizing the various geometric degrees of freedom of nanostructures, metasurfaces are expected to be useful for processing quantum information. Here, we propose and experimentally demonstrate a programmable metasurface capable of performing quantum algorithms using both classical and quantum light with single photons. Our approach encodes multiple programmable quantum algorithms and operations, such as Grover's search algorithm and the quantum Fourier transform, onto the same metalens array on a metasurface. A spatial light modulator selectively excites different sets of metalenses to carry out the quantum algorithms, while the interference patterns captured by a single-photon camera are used to extract information about the output state at the selected output directions. Our programmable quantum metasurface approach holds promising potential as a cost-effective means of miniaturizing components for quantum computing and information processing.

关键词： programmable metasurface quantum information quantum optics quantum algorithms

来源：评论

学校读者我要写书评

暂无评论

Introducing nega-Forrelation: quantum algorithms in analyzing nega-Hadamard and nega-crosscorrelation spectra

引用

DESIGNS CODES AND CRYPTOGRAPHY 2023年第3期92卷 863-883页

作者： Dutta, Suman Maitra, Subhamoy Indian Stat Inst Kolkata India

Aaronson defined Forrelation (2010) as a measure of correlation between a Boolean function f and the Walsh-Hadamard transform of another function g. In a recent work, we have studied different cryptographically important spectra of Boolean functions through the lens of Forrelation. In this paper, we explore a similar kind of correlation in terms of nega-Hadamard transform. We call it nega-Forrelation and obtain a more efficient sampling strategy for nega-Hadamard transform compared to the existing results. Moreover, we present an efficient sampling strategy for nega-crosscorrelation (and consequently nega-autocorrelation) spectra too, by tweaking the nega-Forrelation technique. Finally, we connect the hidden shift finding algorithm for bent functions (Rotteler, 2010) with the Forrelation algorithm and extend it for the negabent functions.

关键词： Boolean functions Cryptology Forrelation Hidden-shift problem nega-Forrelation nega-Hadamard transform quantum algorithms Walsh-Hadamard transform

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：