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

grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing

QUANTUM INFORMATION PROCESSING 2020年第3期19卷 1-17页

作者： Gong, Changqing Du, Juan Dong, Zhaoyang Guo, Zhenzhou Gani, Abdullah Zhao, Liang Qi, Han Shenyang Aerosp Univ Sch Comp Sci & Technol Shenyang 110136 Peoples R China Univ Malaya Fac Comp Sci & Informat Technol Kuala Lumpur 50603 Malaysia

Existing classical ciphertext retrieval schemes are mainly developed according to the homomorphic encryption that is a cryptographic technique based on computational complexity theory of mathematical puzzles. In quantum computing, on the one hand, most of traditional asymmetric encryption can be quickly cracked as the computational capacity of quantum computer is much higher than that of traditional digital computer. Hence, the quantum homomorphic encryption scheme is widely used in data encryption for the issue of privacy protection in quantum computing. But on the other the retrieval efficiency of homomorphic encrypted data is insufficient especially in quantum cloud computing. Therefore, this paper proposes a novel quantum homomorphic encryption ciphertext retrieval (QHECR) scheme basing on the grover algorithm to solve the problem of homomorphic encrypted ciphertext data retrieval in quantum cloud computing. Our scheme is to improve such retrieval efficiency mentioned above where the interaction process is not required even if the T-gate exists in the circuit. In the experiment, two qubits without the T-gate are conducted on both simulations and real quantum devices by using IBM quantum information science kit (Qiskit). The results show that the proposed QHECR scheme is capable of achieving the retrieval encrypted data when the T-gate does not exist in the evaluation circuit in ciphertext environment. Moreover, a verification experiment about the T-gate key update algorithm is implemented to verify the feasibility and reliability of the proposed scheme in the Qiskit as well, which indicates that the QHECR is still available when the T-gate exists in the circuit. Since the decryption is inefficient when there are exponential T-gates in the circuit, our proposed scheme is suitable for low T-gate complexity.

关键词： Quantum homomorphic encryption grover algorithm Ciphertext retrieval IBM Qiskit

来源：评论

学校读者我要写书评

暂无评论

Additive composition formulation of the iterative grover algorithm

引用

CANADIAN JOURNAL OF PHYSICS 2019年第7期97卷 777-785页

作者： Toyama, F. M. van Dijk, W. Kyoto Sangyo Univ Dept Informat Sci & Engn Kyoto 6038555 Japan Redeemer Univ Coll Dept Phys Ancaster ON L9K 1J4 Canada McMaster Univ Dept Phys & Astron Hamilton ON L8S 4M1 Canada

In the grover-type quantum search process a search operator is iteratively applied, say, k tunes, on the initial uniform superposition database state. We present an additive decomposition scheme such that the iteration process is expressed, in the computational space, as a linear combination of k operators, each of which consists of a single grover-search followed by an overall phase-rotation. The value of k and the rotation phase are the same as those determined in the framework of the search with certainty. We discuss how the additive form can be effectively utilized and we propose an alternative gate that realizes the same outcome as the iterative search.

关键词： quantum computing quantum search grover algorithm phase matching

来源：评论

学校读者我要写书评

暂无评论

Quantum secret sharing protocol with four state grover algorithm and its proof-of-principle experimental demonstration

引用

OPTICS COMMUNICATIONS 2011年第14期284卷 3639-3642页

作者： Hao, Liang Wang, Chuan Long, Gui Lu Tsinghua Univ Key Lab Atom & Mol NanoSci Beijing 100084 Peoples R China Tsinghua Univ Dept Phys Beijing 100084 Peoples R China Beijing Univ Posts & Telecommun Sch Sci Beijing 100876 Peoples R China Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

In this article, we propose a three-party quantum secret sharing protocol with four-state grover algorithm. The protocol has several advantages. It uses only four initial states which simplifies its experimental implementation. It has a higher encoding capacity, each two-qubit state provides two bits of information. We have experimentally demonstrated the protocol in a nuclear magnetic resonance quantum information processor successfully. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Quantum secret sharing grover algorithm NMR demonstration

来源：评论

学校读者我要写书评

暂无评论

Phase condition for the grover algorithm

引用

THEORETICAL AND MATHEMATICAL PHYSICS 2005年第3期144卷 1279-1287页

作者： Li, DF Li, XX Huang, HT Tsinghua Univ Natl Lab Artificial Intellect Dept Math Sci Beijing 100084 Peoples R China Wayne State Univ Dept Comp Sci Detroit MI 48202 USA Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

For the grover algorithm, we derive the exact formula of the norm of the amplitude in the marked state in a sine-function form and use this formula, to derive the necessary and sufficient phase condition sin Delta <= vertical bar beta vertical bar for this algorithm with arbitrary phase rotations. We show that the condition of identical rotation angles theta = phi, which is a special case of our condition, is a sufficient but not necessary, phase condition.

关键词： grover algorithm quantum search algorithm phase condition

来源：评论

学校读者我要写书评

暂无评论

A New Ad Hoc Routing Protocol in Fading Channel Based on the grover algorithm 2

A New Ad Hoc Routing Protocol in Fading Channel Based on the...

引用

2nd International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2011)

作者： Meng, Limin Wu, Yifan Shen, Xinyu Lin, Mengman Zhejiang Univ Technol Coll Informat Engn Zhejiang Prov Key Lab Fiber Opt Commun Technol Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9781936338214

Ad Hoc network is recently a hot spot in network research. As the core technology of Ad Hoc networks, the design of routing algorithm seems especially important. Traditional routing protocols have such shortcomings as poor resistance against fading, failing in providing QoS guarantee, the deficiency in network delay. To deal with these problems, a new Ad Hoc routing model based on the grover algorithm is set up in this paper. First, a node vector function is constructed to represent the QoS (Quality of Service), fading of paths in networks and channel noises. Then combining with the grover algorithm and DSR protocol, a new routing protocol is put forward. The results of simulation show that when the transmission power is limited, comparing with DSR protocol, this new routing protocol based on grover algorithm can greatly improve the ability of the internet to resist fading, to improve QoS guarantee, to cut the internet delays, to reduce the routing hops, and to reduce the error code frequency of data transmission, which we believe will make up the deficiency of the exiting algorithm.

关键词： grover algorithm QoS guarantee Quantum searching algorithm Channel fading

来源：评论

学校读者我要写书评

暂无评论

Quantum Private Size Comparison Protocol Based on grover algorithm 21

Quantum Private Size Comparison Protocol Based on Grover Alg...

引用

6th International Conference on Big Data and Computing, ICBDC 2021

作者： Wu, Yuzheng Song, Xiuli Xu, Aidong Chongqing University of Posts and Telecommunications Chongqing400065 China Electric Power Research Institute CSG Guangzhou China Guangdong Provincial Key Laboratory of Power System Network Security Guangzhou China

来源：评论

学校读者我要写书评

暂无评论

Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet grover algorithm

引用

QUANTUM INFORMATION PROCESSING 2021年第10期20卷 330-330页

作者： Zhou, Bao-Min Yuan, Zheng Univ Sci & Technol China Coll Cybersecur Hefei 230026 Peoples R China Beijing Elect Sci Technol Inst Beijing 100070 Peoples R China Beijing Univ Posts & Telecommun Coll Cybersecur Beijing 100876 Peoples R China

The development of quantum computers has urged the cryptographic community to prepare cryptographic primitives for the eventual arrival of the post-quantum world. At Asiacrypt 2017, Leander and May combined grover's and Simon's quantum algorithms to break the FX-based block ciphers. Technically this result is based on the combination of the quantum algorithms of grover's and Simon's for the first time in the cryptographic setting. In this study, we using Bernstein-Vazirani's and grover's algorithms to generate a new quantum key-recovery attacks on different rounds of Feistel constructions. An advantage of our attack is the keys can be divided into multiple blocks to enter the S-box and realize the process of recovery;this method greatly reduces the complexity of key recovery. Hence, it has strong practicability for key recovery (e.g., DES, Camellia, etc.). In order to show that, a detailed process has been provided in this paper.

关键词： Key-recovery attacks Feistel constructions Bernstein-Vazirani algorithm grover algorithm

来源：评论

学校读者我要写书评

暂无评论

A variational quantum perceptron with grover's algorithm for efficient classification

引用

PHYSICA SCRIPTA 2024年第5期99卷 055120-055120页

作者： Innan, Nouhaila Bennai, Mohamed Hassan II Univ Casablanca Fac Sci Ben Msick Quantum Phys & Magnetism Team LPMC Casablanca Morocco

This study introduces the Quantum Variational Perceptron with grover's algorithm (QVP-G), an innovative Quantum machine Learning (QML) model significantly enhancing binary classification tasks' capabilities. The study goes beyond theoretical constructs, employing empirical evaluations of QVP-G on the well-established Iris and more complex breast cancer datasets. This dual-dataset approach highlights the model's adaptability and effectiveness in varied contexts. Our experimental findings reveal the exceptional accuracy of QVP-G, achieving a remarkable 99% success rate. This superior performance is owed mainly to integrating grover's algorithm, a cornerstone in Quantum Computing (QC), which substantially increases the probability of accurately determining the correct classification hyperplane. Beyond academic interest, our research positions QVP-G as a powerful tool with substantial practical applications. Its utility ranges from enhancing fraud detection and improving spam filtering to expediting drug discovery and contributing to advances in physics research. This study marks a significant advancement in QML, reinforcing the bridge between QC and machine learning.

关键词： quantum machine learning quantum perceptron grover algorithm variational quantum algorithm

来源：评论

学校读者我要写书评

暂无评论

Phase matching in grover's algorithm

引用

PHYSICS LETTERS A 2007年第1-2期366卷 42-46页

作者： Li, Panchi Li, Shiyong Harbin Inst Technol Dept Control Sci & Engn Harbin 150001 Peoples R China Daqing Petroleum Inst Dept Comp Sci & Engn Daqing 163318 Peoples R China

When the grover's algorithm is applied to search an unordered database, the probability of getting correct results usually decreases with the increase of marked items. The reason for this phenomenon is analyzed in this Letter, the grover iteration is studied, and a new phase matching is proposed. With application of the new phase matching, when the fraction of marked items is greater than 1/3, the probability of getting correct results is greater than 25/27 with only one grover iteration. The validity of the new phase matching is verified by a search example. (c) 2007 Elsevier B.V. All rights reserved.

关键词： quantum computing quantum searching grover algorithm phase matching

来源：评论

学校读者我要写书评

暂无评论

Error avoiding quantum codes and dynamical stabilization of grover's algorithm

引用

NEW JOURNAL OF PHYSICS 2000年第 1 期2卷 191-1916页

作者： Mussinger, M Delgado, A Alber, G Univ Ulm Abt Quantenphys D-89069 Ulm Germany

Dynamical stabilization properties of error avoiding quantum codes are investigated beyond the perturbative regime. As an example grover's search algorithm and its behaviour under a particular class of coherent errors are studied. Numerical examples which demonstrate that error avoiding quantum codes may be capable of stabilizing quantum algorithms well beyond the regime for which they were designed originally are presented.

关键词： .capable Quantum Systems quantum algorithms stabilizing grover algorithm grover search quantum codes coherent errors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：