基于量子位{00,11}的量子最小/最大算法

2017 IEEE Long Island Systems, Applications and Technology Conference (LISAT) Pub Date : 2017-05-05 DOI:10.1109/LISAT.2017.8001972

A. Odeh, Eman Abdelfattah

{"title":"基于量子位{00,11}的量子最小/最大算法","authors":"A. Odeh, Eman Abdelfattah","doi":"10.1109/LISAT.2017.8001972","DOIUrl":null,"url":null,"abstract":"Quantum algorithms have gained a lot of consideration especially for the need to find out the extreme values like minimum or maximum. This paper introduces novel quantum algorithms to figure out the minimum and the maximum numbers among a set of positive integer numbers by employing some of the quantum features such as superposition, entanglement, and probability. The proposed algorithms utilize qubits properties to accelerate the searching process.","PeriodicalId":370931,"journal":{"name":"2017 IEEE Long Island Systems, Applications and Technology Conference (LISAT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum min / max algorithms based on qubits {00, 11}\",\"authors\":\"A. Odeh, Eman Abdelfattah\",\"doi\":\"10.1109/LISAT.2017.8001972\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quantum algorithms have gained a lot of consideration especially for the need to find out the extreme values like minimum or maximum. This paper introduces novel quantum algorithms to figure out the minimum and the maximum numbers among a set of positive integer numbers by employing some of the quantum features such as superposition, entanglement, and probability. The proposed algorithms utilize qubits properties to accelerate the searching process.\",\"PeriodicalId\":370931,\"journal\":{\"name\":\"2017 IEEE Long Island Systems, Applications and Technology Conference (LISAT)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Long Island Systems, Applications and Technology Conference (LISAT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LISAT.2017.8001972\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Long Island Systems, Applications and Technology Conference (LISAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LISAT.2017.8001972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

量子算法得到了很多关注，特别是需要找到极值，如最小值或最大值。本文介绍了一种新的量子算法，利用量子的叠加性、纠缠性和概率性等量子特征来求出一组正整数中的最小值和最大值。所提出的算法利用量子比特的特性来加速搜索过程。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Quantum min / max algorithms based on qubits {00, 11}

Quantum algorithms have gained a lot of consideration especially for the need to find out the extreme values like minimum or maximum. This paper introduces novel quantum algorithms to figure out the minimum and the maximum numbers among a set of positive integer numbers by employing some of the quantum features such as superposition, entanglement, and probability. The proposed algorithms utilize qubits properties to accelerate the searching process.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 IEEE Long Island Systems, Applications and Technology Conference (LISAT)

自引率

0.00%

发文量