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

2024 International Symposium on Intelligent Signal processing and Communication Systems, ISPACS 2024

作者： Lee, Su-Ling Tseng, Chien-Cheng Depart. of Computer Science and Information Engineering Chang Jung Christian University Tainan Taiwan Depart. of Computer and Communication Engineering National Kaohsiung University of Sci. and Tech Kaohsiung Taiwan

ISBN: (纸本)9798350389210

Designing a quantum circuit that prepares user-specific states is a fundamental task in quantum computation. This involves loading user-provided data into the initial superposition state of a quantum register, enabling further processing by quantum algorithms. To address this state preparation problem, a quantum circuit utilizing rotation Y gates and controlled rotation Y gates has been previously proposed. However, the method for determining the rotation angles of these Y gates has not been detailed. This paper introduces a closed-form method for computing these angle parameters based on user-provided data. Numerical examples demonstrate the ease of use of the proposed method, which is implemented using IBM's quantum information software kit (Qiskit). Additionally, real-world feature data from iris flowers is used to show that the feature data can be accurately loaded into the quantum register, facilitating tasks such as machine learning, dimensionality reduction, or pattern recognition through quantum computation. © 2024 IEEE.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

Research on the Application of Improved quantum Evolution Algorithm in Computer Network Routing Selection 2

Research on the Application of Improved Quantum Evolution Al...

引用

2nd IEEE Global Conference on Communications and information Technologies, GCCIT 2024

作者： Li, Lin Sichuan College of Culture and Arts Sichuan Mianyang China

ISBN: (数字)9798350388916

ISBN: (纸本)9798350388916

In order to meet the challenges of applied research in computer network routing, in view of the shortcomings of the existing D-P algorithms, this study proposes an innovative application research method based on improved quantum evolution algorithms. The new solution leverages the principles of QEA theory to accurately identify and locate key influencing factors, and accordingly to classify indicators wisely to reduce potential interference. At the same time, by using the unique mechanism of improving the quantum evolution algorithm, the design strategy of the application in the selection is cleverly constructed. The empirical results show that the proposed scheme shows a significant improvement compared with the traditional D-P algorithm in the key performance indicators such as the accuracy of the application research and the processing efficiency of key factors in routing selection, showing its obvious strong advantages. In computer networks, the applied research in routing plays a vital role, which can accurately predict and optimize the growth trend and output results of the applied research in computer network routing. However, in the face of complex simulation tasks, traditional D-P algorithms show some inherent shortcomings, especially when dealing with multi-level challenges, their performance is often unsatisfactory. To overcome this problem, this study introduces a new idea of applied research in the routing selection of improved quantum evolution algorithm optimization, and accurately controls the influencing parameters through the QEA theory, and uses this as the road map for index allocation, and then uses the improved quantum evolution algorithm to innovate and construct a system scheme. The test results clearly point out that in the context of the evaluation criteria, the new scheme has been significantly optimized in terms of accuracy and processing speed for a variety of challenges, showing stronger performance superiority. Therefore, in the applic

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

Selection and Improvement of Product Formulae for Best Performance of quantum Simulation

引用

quantum information & COMPUTATION 2025年第1期25卷 1-35页

作者： Morales, Mauro E. S. Costa, Pedro C. S. Pantaleoni, Giacomo Burgarth, Daniel K. Sanders, Yuval R. Berry, Dominic W. Univ Technol Sydney Ctr Quantum Computat & Commun Technol Sydney NSW 2007 Australia Univ Technol Sydney Ctr Quantum Software & Informat Sydney NSW 2007 Australia Univ Maryland Joint Ctr Quantum Informat & Comp Sci QuICS College Pk MD 20742 USA Macquarie Univ Sch Math & Phys Sci Sydney NSW 2109 Australia Quantum New South Wales Sydney NSW 2000 Australia Friedrich Alexander Univ Erlangen Nurnberg Dept Phys Staudtstr 7 Erlangen Germany

quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. On the other hand, product formulae with fewer exponentials can be found by numerical solution of simultaneous non-linear equations. It is also possible to reduce the cost of long-time simulations by processing, where a kernel is repeated and a processor need only be applied at the beginning and end of the simulation. In this work, we found thousands of new product formulae, and numerically tested these formulae, together with many formulae from prior literature. We provide methods to fairly compare product formulae of different lengths and different orders. For the case of 8th order, we have found new product formulae with exceptional performance, about two orders of magnitude better accuracy than prior work, both in the processed and non-processed cases. The processed product formula provides the best performance due to being shorter than the non-processed product formula. It outperforms all other tested product formulae over a range of many orders of magnitude in system parameters T (time) and epsilon (allowable error). That includes reasonable combinations of parameters to be used in quantum algorithms, where the size of the simulation is large enough to be classically intractable, but not so large it takes an impractically long time on a quantum computer.

关键词： quantum algorithm quantum simulation product formula symplectic integrator Trotter formula

来源：评论

学校读者我要写书评

暂无评论

Quadratic quantum Variational Monte Carlo 38

Quadratic Quantum Variational Monte Carlo

引用

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Su, Baiyu Liu, Qiang University of Texas Austin United States

This paper introduces the Quadratic quantum Variational Monte Carlo (Q2VMC) algorithm, an innovative algorithm in quantum chemistry that significantly enhances the efficiency and accuracy of solving the Schrödinger equation. Inspired by the discretization of imaginary-time Schrödinger evolution, Q2VMC employs a novel quadratic update mechanism that integrates seamlessly with neural network-based ansatzes. Our extensive experiments showcase Q2VMC's superior performance, achieving faster convergence and lower ground state energies in wavefunction optimization across various molecular systems, without additional computational cost. This study not only advances the field of computational quantum chemistry but also highlights the important role of discretized evolution in variational quantum algorithms, offering a scalable and robust framework for future quantum research. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Empirical Investigation of quantum Computing on Solving Complex Problems

Empirical Investigation of Quantum Computing on Solving Comp...

引用

24th International Conference on Agile Software Development (XP)

作者： Hussain, Shahid Neupane, Yuba Wang, Wen-Li Ibrahim, Naseem Khan, Saif Ur Rehman Kareem, Asif Penn State Behrend Dept Comp Sci & Software Engn Sch Engn Erie PA 16563 USA Shifa Tameer E Millat Univ STMU Dept Comp Islamabad 45550 Pakistan Advocate Hlth Downers Grove IL USA

ISBN: (纸本)9783031485497;9783031485503

Context: The rules of quantum Mechanics have been exploited through quantum Computing (QC) to solve specific problems and process information in expeditious ways as compared to Conventional Computing (CC) such as factoring integers. Problem: With the alluring computation capability of QC, it is still important to assess the implications and limitations of QC in solving a variety of computationally demanding problems. Method: In this regard, an empirical study was conducted to assess the efficacy of QC in terms of solving certain complex problems by keeping a tradeoff between the execution time and problem size. An analysis was performed based on the widely used Shor's algorithms and the efficacy of QC as compared to CC was reported. Results: The outcomes show that QC has the potential to exponentially speed up the identification of a solution to certain polynomial problems that are intractable for CC. However, further research is needed to fully understand the potential and limitations of QC for Non-Polynomial (NP) complete problems.

关键词： quantum Computing Conventional Computing Shor's Algorithm Complexity

来源：评论

学校读者我要写书评

暂无评论

On the Parameters of Algebraic Geometric Codes Designed to Construct a Post-quantum Algorithm for Ensuring information Security of On-Board Systems

On the Parameters of Algebraic Geometric Codes Designed to C...

引用

2024 Systems of Signals Generating and processing in the Field of on Board Communications, SOSG 2024

作者： Pankov, K.N. Glukhov, M.M. Moscow Technical University of Communications and Informatics Moscow Russia

ISBN: (纸本)9798350383614

This article clarifies the parameters of a quantum-resistant algorithm based on AG codes. This algorithm was proposed in previous works by the authors to counter the quantum threat when designing various on-board systems. The article describes the procedure for quickly decoding the corresponding codes, estimates the key length and the probability of applying one of the existing attacks to such algorithms. This work can be useful for increasing the security of arbitrary Internet of Things systems.. ©2024 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

On applying the lackadaisical quantum walk algorithm to search for multiple solutions on grids

引用

information SCIENCES 2023年第1期622卷 873-888页

作者： de Carvalho, Jonathan H. A. de Souza, Luciano S. de Paula Neto, Fernando M. Ferreira, Tiago A. E. Univ Fed Pernambuco Ctr Informat Ave Prof Moraes Rego1235 Cidade Univ BR-50670901 Recife PE Brazil Univ Fed Rural Pernambuco Dept Estat & Informat Rua Dom Manuel Medeiross-nDois Irmaos BR-52171900 Recife PE Brazil

quantum computing promises to improve the information processing power to levels unreachable by classical computation. quantum walks are heading the development of quantum algorithms for searching information on graphs more efficiently than their clas-sical counterparts. A quantum-walk-based algorithm standing out in the literature is the lackadaisical quantum walk. The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight l. This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully. Firstly, we show that only one of the two stopping condi-tions found in the literature is suitable for simulations. In the most discrepant case shown here, a stopping condition is prematurely satisfied at the step T = 288 with a success prob-ability Pr = 0.593276, while the suitable condition captures the actual amplification that occurred until T = 409 with Pr = 0.878178. We also demonstrate that the final success probability depends on both the space density of solutions and the relative distance between solutions. For instance, we show here that decreases in the density of solutions can even take a success probability of 0.849178 to 0.961896. In contrast, increases in the relative distances can even take a success probability of 0.871665 to 0.940301. Furthermore, this work generalizes the lackadaisical quantum walk to search for multiple solutions on grids of arbitrary dimensions. In addition, we propose an optimal adjustment of the self-loop weight l for such d-dimensional grids. It turns out other fits of l found in the literature are particular cases. Our experiments demonstrate that successful searches for multiple solutions with higher than two dimensions are possible by achieving success probabilities such as 0.999979, with the value of l proposed here, where it would be 0.637346, with the value of l proposed in previous works.

关键词： quantum computing quantum walk Lackadaisical quantum walk Search algorithm Spatial search

来源：评论

学校读者我要写书评

暂无评论

Entanglement Management through Swapping over quantum Internets

引用

Performance Evaluation Review 2023年第2期51卷 69-71页

作者： Zeng, Yiming Zhang, Jiarui Liu, Zhenhua Yang, Yuanyuan Stony Brook University United States

quantum Internet has the potential to support a wide range of applications in quantum communication and quantum computing by generating, distributing, and processing quantum information. Generating a long-distance quantum entanglement is one of the most essential functions of a quantum Internet to facilitate these applications. However, entanglement is a probabilistic process, and its success rate drops significantly as distance increases. Entanglement swapping is an efficient technique used to address this challenge. How to efficiently manage the entanglement through swapping is a fundamental yet challenging problem. In this paper, we will consider two swapping methods: (1) BSM: a classic entanglement-swapping method based on Bell State measurements that fuse two successful quantum links, (2) nfusion: a more general and efficient swapping method based on Greenberger-Horne-Zeilinger measurements, capable of fusing n successful quantum links. Our goal is to maximize the entanglement rate for multiple quantum-user pairs over the quantum Internet with an arbitrary topology. We propose efficient entanglement management algorithms that utilized the unique properties of BSM and n-fusion. Evaluation results highlight that our approach outperforms existing routing protocols. © 2023 Copyright is held by the owner/author(s).

关键词： quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

A Conceptual Model of quantum Cryptography Techniques used to Provide Online Banking Transactions Security 2

A Conceptual Model of Quantum Cryptography Techniques used t...

引用

2nd IEEE International Conference on Trends in quantum Computing and Emerging Business Technologies, TQCEBT 2024

作者： Madje, Uma Pratap Pande, Mandaar B. Faculty of Computer Studies Pune India Symbiosis Centre for Information Technology Pune India

ISBN: (纸本)9798350384277

In today's online environment, a lot of data is created through online transactions and processing, and protecting this data can be difficult. When talking about security and privacy, it takes into account how resistant information and other transaction data is to threats and flaws. Online banking raises three key concerns: user identity, data confidentiality, and the medium or channel over which the information is conveyed. For this reason, the main focus of this study is on the security methods used in online banking that fall within the categories of classical and quantum cryptography in order to combat multiple attacks and problems that may arise when using the service. The study offers a conceptual model for client authentication using the one-time pad (OTP) idea in conjunction with quantum-safe channel technology to boost security and prevent reply attacks. To assess the performance and determine whether the proposed framework operationally feasible, quantum cryptography is being introduced. The performance and speed of financial transaction processing can be increased by combining quantum computing with traditional algorithms for fraud detection. In order to create a safe key exchange with the help of quantum cryptography, the proposed approach takes this into consideration and implements QKD and QRNG. © 2024 IEEE.

关键词： quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Image segmentation using convolutional neural networks in multi-sensor information fusion

引用

SOFT COMPUTING 2023年第23期27卷 18353-18372页

作者： Zhang, Wenying Dong, Min Jiang, Li Zhengzhou Univ Sch Elect & Informat Engn Zhengzhou 450001 Henan Peoples R China

In recent years, the rapid advancement of artificial intelligence (AI) has revolutionized various industries, with image processing playing an important role in the revolution. AI-powered image analysis has opened up new possibilities in healthcare diagnostics, autonomous navigation, and security surveillance, fuelling demand for sophisticated image-processing solutions. This paper describes an innovative approach to AI image processing that combines multi-sensor data fusion with convolutional neural networks (CNNs) within a fuzzy neural network framework. This integration uses data from various sensors, including cameras, lidar, and radar, to improve the robustness and precision of image analysis and interpretation. The T-S model serves as the foundation for the information fusion strategy. A comprehensive investigation of deep learning algorithms reveals inherent strengths such as robustness and parallelism. However, it also identifies limitations, particularly in image segmentation tasks, characterized by challenges like premature convergence and prolonged computation times. The paper proposes a quantization technique for deep learning algorithms to address these issues and introduces chaotic optimization to expedite convergence rates. It also presents a novel three-dimensional Otsu threshold segmentation method based on CNNs, which overcomes noise susceptibility in traditional two-dimensional approaches. Integrating Gray morphology and this three-dimensional Otsu threshold segmentation method results in the development of a three-dimensional Gray Otsu model. This model is the basis for designing a fitness function for the CNN algorithm, optimizing its efficacy. Experimental validation demonstrates the proposed algorithm's effectiveness, achieving an impressive 91% accuracy rate while displaying robust noise resistance and versatility. Comparative assessments against other leading AI architectures, including multilayer perceptron, radial basis function network, r

关键词： Image segmentation Convolution neural network Fuzzy neural network Chaotic quantum deep learning algorithm Multi-sensor information fusion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：