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

quantum Computing and Engineering (QCE), IEEE International Conference on

作者： Yao-Hsin Chou Yu-Chi Jiang Shu-Yu Kuo Sun-Yuan Kung Department of Computer Science and Information Engineering National Chi Nan University Puli Taiwan Physics Division National Center for Theoretical Sciences Taipei Taiwan Department of Electrical and Computer Engineering Princeton University New Jersey USA Department of Electrical Engineering National Taiwan University Taipei Taiwan

ISBN: (数字)9798331541378

ISBN: (纸本)9798331541385

quantum education has been increasingly emphasized at both the post-secondary and secondary education stages, in line with the advent of the quantum computing paradigm. Traditional quantum computing education, however, necessitates an extensive background in physics, mathematics, and information science, which can be challenging for beginners. This study presents the experience of implementing a college curriculum at National Chi Nan University in Taiwan, designed to enable learners at all levels to grasp the concept of a quantum algorithm using accessible math yet rigorous enough for verification. The study succinctly conveys the concept of the quantum Grover algorithm, provides necessary background knowledge, and elucidates the ideas using three distinct visualization methods. Furthermore, this study offers a novel presentation for aligning the results of geometrical representation with the corresponding quantum circuit layout. The hands-on project demonstration motivates learners to explore solutions using their visualization tool, enhancing their engagement and sense of achievement. Developing these tools deepens learners' understanding and promotes active peer education, thereby improving their participation and retention of quantum knowledge. The visualization tools developed through this process serve as a valuable contribution to quantum education, offering an effective quantum tool and a user-friendly interface for learning, teaching, researching, and providing fresh insights and perspectives. By making quantum computing concepts more understandable through accessible math and visualization, we aim to lower the entry-level barrier to learning quantum computing, encouraging more talents to engage in quantum computing for their research studies.

关键词： Visualization quantum system quantum algorithm Education Software algorithms Solids Mathematics Software quantum circuit Physics

来源：评论

学校读者我要写书评

暂无评论

Research and Application of quantum Computing algorithm for Asset Portfolio Optimization

Research and Application of Quantum Computing Algorithm for ...

引用

Data Analytics, Computing and Artificial Intelligence (ICDACAI), International Conference on

作者： Jiaxin Wang Baochuan Tian Beijing Polytechnic Beijing China

ISBN: (数字)9798331519032

ISBN: (纸本)9798331519049

Portfolio optimization is a critical problem in the field of finance, and quantum computing offers a new approach to address this problem. The author explains the development process of the quantum computing model, including quantum bits, quantum entanglement, quantum gates, quantum circuits, while specifically focusing on quantum state preparation, problem coding, quantum gate operation and quantum measurement in the design of quantum algorithms. Furthermore, the author also introduces the mathematical model of portfolio optimization, including expected return, risk analysis, and mathematical constraints, and illustrates the performance evaluation results of quantum algorithms in portfolio optimization from the perspective of speed and optimization accuracy. With respect to traditional methods, quantum algorithms offer both speed and optimization accuracy advantages, and the optimization accuracy reaches 100%, which illustrates that the quantum algorithm has shown good performance in asset portfolio optimization.

关键词： Computers quantum computing quantum algorithm Accuracy quantum entanglement Computational modeling Stability analysis Optimization Portfolios Financial industry

来源：评论

学校读者我要写书评

暂无评论

A quantum algorithm FOR SIMULATING NON-SPARSE HAMILTONIANS

引用

quantum INFORMATION & COMPUTATION 2020年第7-8期20卷 597-615页

作者： Wang, Chunhao Wossnig, Leonard Univ Waterloo Inst Quantum Comp Waterloo ON Canada Univ Waterloo Sch Comp Sci Waterloo ON Canada Univ Texas Austin Dept Comp Sci Austin TX 78712 USA UCL Dept Comp Sci London England

We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the input model where the entries of the Hamiltonian are stored in a data structure in a quantum random access memory (qRAM) which allows for the efficient preparation of states that encode the rows of the Hamiltonian. We use a linear combination of quantum walks to achieve poly-logarithmic dependence on precision. The time complexity of our algorithm, measured in terms of the circuit depth, is O(t root N vertical bar vertical bar H vertical bar vertical bar polylog(N, vertical bar vertical bar H vertical bar vertical bar, 1/epsilon)), where t is the evolution time, N is the dimension of the system, and epsilon is the error in the final state, which we call precision. Our algorithm can be directly applied as a subroutine for unitary implementation and quantum linear systems solvers, achieving (O) over tilde (root N) dependence for both applications.

关键词： Hamiltonian simulation quantum algorithm linear combination of unitaries quantum walk quantum machine learning qRAM linear systems solver

来源：评论

学校读者我要写书评

暂无评论

Error Analysis of the Variational quantum Eigensolver algorithm

Error Analysis of the Variational Quantum Eigensolver Algori...

引用

IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH)

作者： Brandhofer, Sebastian Devitt, Simon Polian, Ilia Univ Stuttgart Ctr Integrated Quantum Sci & Technol IQST Inst Comp Architecture & Comp Engn Stuttgart Germany Univ Technol Sydney Ctr Quantum Software & Informat Sydney NSW Australia

ISBN: (纸本)9781665409599

Variational quantum algorithms have been one of the most intensively studied applications for near-term quantum computing applications. The noisy intermediate-scale quantum (NISQ) regime, where small enough algorithms can be run successfully on noisy quantum computers expected during the next 5 years, is driving both a large amount of research work and a significant amount of private sector funding. Therefore, it is important to understand whether variational algorithms are effective at successfully converging to the correct answer in presence of noise. We perform a comprehensive study of the variational quantum eigensolver (VQE) and its individual quantum subroutines. Building on asymptotic bounds, we show through explicit simulation that the VQE algorithm effectively collapses already when single errors occur during a quantum processing call. We discuss the significant implications of this result in the context of being able to run any variational type algorithm without resource expensive error correction protocols.

关键词： Computers quantum algorithm Protocols Error analysis algorithms Buildings Computer architecture

来源：评论

学校读者我要写书评

暂无评论

The Parallel quantum algorithm for the Class of Optimization

引用

PARALLEL PROCESSING LETTERS 2020年第4期30卷

作者： Xu, Guanlei Xu, Xiaogang Zhejiang Gongshang Univ Coll Comp & Informat Engn Hangzhou 310018 Peoples R China

For the given n numbers without any other prior information, how to obtain the minimum norm of them only by assigning their signs before them? Moreover, how to know one number is the multiplication of which ones in the given n numbers? In classical solutions, enumeration is the only way via trying one by one, whose complexity is about O(n2(n-1)) and this is a NP problem. In this paper, the parallel quantum algorithm is proposed to solve the two questions shown in above. Through the quantum design of linear expressions of angles in parallel circuits, only O(n(2)) time's quantum operations and about O(n(2)) times' quantum measurements in the average will give the correct answer in the successful probability of 0.97 instead of the traditional O(2(n)) times. The example and theoretical analysis demonstrate the efficiency of the proposed method.

关键词： quantum algorithm parallel norm optimization

来源：评论

学校读者我要写书评

暂无评论

Discrete-time quantum walk algorithm for ranking nodes on a network

引用

quantum INFORMATION PROCESSING 2020年第5期19卷 158-158页

作者： Chawla, Prateek Mangal, Roopesh Chandrashekar, C. M. Inst Math Sci CIT Campus Chennai 600113 Tamil Nadu India Homi Bhabha Natl Inst Training Sch Complex Mumbai 400094 Maharashtra India

We present a quantum algorithm for ranking the nodes of a network in their order of importance. The algorithm is based on a directed discrete-time quantum walk and works on all directed networks. This algorithm can theoretically be applied to the entire internet and thus can function as a quantum PageRank algorithm. Our analysis shows that the hierarchy of quantum ranks matches well with the hierarchy of classical ranks for directed trees and other acyclic networks. For cyclic networks, however, the hierarchy of quantum ranks does not exactly match the hierarchy of the classical ranks. This highlights the role of quantum interference and fluctuations in networks and the importance of using quantum algorithms to rank nodes in quantum networks. Another application this algorithm can envision is to model the dynamics on networks mimicking chemical complexes and rank active centres in the order of reactivities. Since discrete-time quantum walks are implementable on current quantum processing systems, this algorithm will also be of practical relevance in the analysis of quantum architecture.

关键词： quantum walk Discrete-time quantum walk quantum algorithm quantum network

来源：评论

学校读者我要写书评

暂无评论

quantum algorithm for Appointment Scheduling

引用

Journal of quantum Computing 2019年第2期1卷 111-118页

作者： Wenbin Yu Yinsong Xu Wenjie Liu Alex Xiangyang Liu Baoyu Zheng Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology Nanjing University of Information Science&TechnologyNanjing210044China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science&TechnologyNanjing210044China School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China Department of Computer Science and Engineering Michigan State UniversityEast LansingMI 48824-1266USA National Engineering Research Center for Communications and Network Technology Nanjing University of Posts and TelecommunicationsNanjing210003China

Suppose a practical scene that when two or more parties want to schedule anappointment, they need to share their calendars with each other in order to make itpossible. According to the present result the whole communication cost to solve thisproblem should be their calendars’ length by using a classical algorithm. In this work, weinvestigate the appointment schedule issue made by N users and try to accomplish it inquantum information case. Our study shows that the total communication cost will bequadratic times smaller than the conventional case if we apply a quantum algorithm in theappointment-scheduling problem.

关键词： quantum algorithm appointment scheduling quantum speed-up

来源：评论

学校读者我要写书评

暂无评论

An Improved quantum algorithm for Spectral Regression

An Improved Quantum Algorithm for Spectral Regression

引用

Computers and Communications (ACCC), Asia Conference on

作者： Fanxu Meng Xutao Yu Zaichen Zhang State Key Lab of Millimeter Waves Southeast University Nanjing China National Mobile Communications Research Lab Southeast University Nanjing China

The following topics are dealt with: antenna radiation patterns; multifrequency antennas; microwave antennas; 5G mobile communication; UHF antennas; frequency selective surfaces; wireless LAN; microstrip antennas; sec... 详细信息

ISBN: (数字)9781728189673

ISBN: (纸本)9781728189680

关键词： Dimensionality reduction Computers quantum algorithm algorithms Asia Estimation

来源：评论

学校读者我要写书评

暂无评论

Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm

引用

Science China(Physics,Mechanics & Astronomy) 2018年第6期61卷 1-7页

作者： He-Liang Huang Ashutosh K. Goswami Wan-Su Bao Prasanta K. Panigrahi Chinese Academy Sciences Centre for Excellence and Synergetic Innovation Centre in Quantum Information and Quantum Physics University of Science and Technology of China Hefei 230026 China Hefei National Laboratory for Physical Sciences at Microscale Department of modern Physics University of Science and Technology of China Hefei 230026 China Indian Institute of Science Education and Research Kolkata Mohanpur 741 246 India

quantum algorithms can be used to efficiently solve certain classically intractable problems by exploiting quantum ***, the effectiveness of quantum entanglement in quantum computing remains a question of debate. This study presents a new quantum algorithm that shows entanglement could provide advantages over both classical algorithms and quantum algorithms without entanglement. Experiments are implemented to demonstrate the proposed algorithm using superconducting *** show the viability of the algorithm and suggest that entanglement is essential in obtaining quantum speedup for certain problems in quantum computing. The study provides reliable and clear guidance for developing useful quantum algorithms.

关键词： quantum computing quantum entanglement quantum algorithm Deutsch＇s problem

来源：评论

学校读者我要写书评

暂无评论

A quantum algorithm for testing and learning resiliency of a Boolean function

引用

quantum INFORMATION PROCESSING 2019年第2期18卷 51-51页

作者： Li, Hongwei Henan Finance Univ Sch Math & Stat Zhengzhou 450046 Henan Peoples R China

A quantum algorithm to evaluate the resiliency of a Boolean function is explored. Recently, Chakraborty and Maitra (Cryptogr Commun 8(3):401-413, 2016) have provided quantum algorithms to check the non-resiliency of a Boolean function. However, the shortage of their algorithms is that they just output YES or NO. Refining one of the algorithms, a quantum algorithm is proposed here, which can describe the extent of the non-resiliency by E-almost resiliency under the condition NO.

关键词： Almost resilient function Resilient function quantum algorithm Walsh spectrum

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：