Since Grover’s algorithm was first introduced, it has become a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The original application was the uns...Since Grover’s algorithm was first introduced, it has become a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The original application was the unstructured search problems with the time complexity of O(). In Grover’s algorithm, the key is Oracle and Amplitude Amplification. In this paper, our purpose is to show through examples that, in general, the time complexity of the Oracle Phase is O(N), not O(1). As a result, the time complexity of Grover’s algorithm is O(N), not O(). As a secondary purpose, we also attempt to restore the time complexity of Grover’s algorithm to its original form, O(), by introducing an O(1) parallel algorithm for unstructured search without repeated items, which will work for most cases. In the worst-case scenarios where the number of repeated items is O(N), the time complexity of the Oracle Phase is still O(N) even after additional preprocessing.展开更多
Recent rapid advancements in communication technology have brought forth the era of Web 3.0,representing a substantial transformation in the Internet landscape.This shift has led to the emergence of various decentrali...Recent rapid advancements in communication technology have brought forth the era of Web 3.0,representing a substantial transformation in the Internet landscape.This shift has led to the emergence of various decentralized metaverse applications that leverage blockchain as their underlying technology to enable users to exchange value directly from point to point.However,blockchains are blind to the real world,and smart contracts cannot directly access data from the external world.To address this limitation,the technology of oracles has been introduced to provide real-world data for smart contracts and other blockchain applications.In this paper,we focus on mitigating the risks associated with oracles providing corrupt or incorrect data.We propose a novel Web 3.0 architecture for the Metaverse based on the multiidentifier network(MIN),and its decentralized blockchain oracle model called Meta Oracle.The experimental results show that the proposed scheme can achieve minor time investment in return for significantly more reliable data and increased throughput.展开更多
本文分析了民航行业中Oracle数据库ADG(Active Data Guard)的同步策略的工作原理、当前应用状况以及可能影响其稳定性的各种因素,并给出了针对性的优化建议。对ADG同步方案基本原理进行总结,对该方案在民航的应用现状进行分析。探讨了...本文分析了民航行业中Oracle数据库ADG(Active Data Guard)的同步策略的工作原理、当前应用状况以及可能影响其稳定性的各种因素,并给出了针对性的优化建议。对ADG同步方案基本原理进行总结,对该方案在民航的应用现状进行分析。探讨了网络因素、硬件相关因素等对ADG同步进行稳定性的影响。并提出了一系列措施,包括网络配置的优化、硬件的维护和保障,以及参数的合理配置,为了确保民航Oracle数据库ADG同步方案的稳健性。展开更多
文摘Since Grover’s algorithm was first introduced, it has become a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The original application was the unstructured search problems with the time complexity of O(). In Grover’s algorithm, the key is Oracle and Amplitude Amplification. In this paper, our purpose is to show through examples that, in general, the time complexity of the Oracle Phase is O(N), not O(1). As a result, the time complexity of Grover’s algorithm is O(N), not O(). As a secondary purpose, we also attempt to restore the time complexity of Grover’s algorithm to its original form, O(), by introducing an O(1) parallel algorithm for unstructured search without repeated items, which will work for most cases. In the worst-case scenarios where the number of repeated items is O(N), the time complexity of the Oracle Phase is still O(N) even after additional preprocessing.
基金supported by Shenzhen Fundamental Research Programs under Grant Nos.JCYJ20220531093206015,GXWD20201231165807007-20200807164903001,JCYJ20210324122013036,and JCYJ20190808155607340Guang Dong Prov.R&D Key Programs under Grant Nos.2019B010137001 and 2018B010124001+4 种基金Basic Research Enhancement Program of China under Grant No.2021-JCJQ-JJ-0483National Keystone R&D Program of China under Grant No.2017YFB0803204Natural Science Foundation of China under Grant No.61671001ZTE Industry-University-Institute Fund Project under Grant No.2019ZTE03-01HuaWei Funding under Grant No.TC20201222002。
文摘Recent rapid advancements in communication technology have brought forth the era of Web 3.0,representing a substantial transformation in the Internet landscape.This shift has led to the emergence of various decentralized metaverse applications that leverage blockchain as their underlying technology to enable users to exchange value directly from point to point.However,blockchains are blind to the real world,and smart contracts cannot directly access data from the external world.To address this limitation,the technology of oracles has been introduced to provide real-world data for smart contracts and other blockchain applications.In this paper,we focus on mitigating the risks associated with oracles providing corrupt or incorrect data.We propose a novel Web 3.0 architecture for the Metaverse based on the multiidentifier network(MIN),and its decentralized blockchain oracle model called Meta Oracle.The experimental results show that the proposed scheme can achieve minor time investment in return for significantly more reliable data and increased throughput.
文摘本文分析了民航行业中Oracle数据库ADG(Active Data Guard)的同步策略的工作原理、当前应用状况以及可能影响其稳定性的各种因素,并给出了针对性的优化建议。对ADG同步方案基本原理进行总结,对该方案在民航的应用现状进行分析。探讨了网络因素、硬件相关因素等对ADG同步进行稳定性的影响。并提出了一系列措施,包括网络配置的优化、硬件的维护和保障,以及参数的合理配置,为了确保民航Oracle数据库ADG同步方案的稳健性。
