Computational complexities in modern power systems are reportedly increasing daily, and it is anticipated that traditional computers might be inadequate to provide the computation prerequisite in future complex power ...
详细信息
Computational complexities in modern power systems are reportedly increasing daily, and it is anticipated that traditional computers might be inadequate to provide the computation prerequisite in future complex power grids. In that given context, quantum computing (QC) can be considered a next-generation alternative solution to deal with upcoming computational challenges in smart grids. The QC is a relatively new yet promising technology that leverages the unique phenomena of quantum mechanics in processinginformation and computations. This emerging paradigm shows a significant potential to overcome the barrier of computational limitations with better and faster solutions in optimization, simulations, and machine learning problems. In recent years, substantial progress in developing advanced quantum hardware, software, and algorithms have made QC more feasible to apply in various research areas, including smart grids. It is evident that considerable research has already been carried out, and such efforts are remarkably continuing. As QC is a highly evolving field of study, a brief review of the existing literature will be vital to realize the state-of-art on QC for smart grid applications. Therefore, this article summarizes the research outcomes of the most recent papers, highlights their suggestions for utilizing QC techniques for various smart grid applications, and further identifies the potential smart grid applications. Several real-world QC case studies in various research fields besides power and energy systems are demonstrated. Moreover, a brief overview of available quantum hardware specifications, software tools, and algorithms is described with a comparative analysis.
quantum walks are an analog of classical random walks in quantum systems. quantum walks have smaller hitting times compared to classical random walks on certain types of graphs, leading to a quantum advantage of quant...
详细信息
quantum walks are an analog of classical random walks in quantum systems. quantum walks have smaller hitting times compared to classical random walks on certain types of graphs, leading to a quantum advantage of quantum-walks-based algorithms. An important feature of quantum walks is that they are accompanied by the excitation transfer from one site to another, and a moment of hitting the destination site is characterized by the maximum probability amplitude of observing the excitation on this site. It is therefore prospective to consider such problems as candidates for quantum advantage demonstration, since gate errors can smear out a peak in the transfer probability as a function of time, nevertheless leaving it distinguishable. We investigate the influence of quantum noise on hitting time and fidelity of a typical quantum walk problem-a perfect state transfer (PST) over a qubit chain. We simulate dynamics of a single excitation over the chain of qubits in the presence of typical noises of a quantum processor (homogeneous and inhomogeneous Pauli noise, crosstalk noise, thermal relaxation, and dephasing noise). We find that Pauli noise mostly smears out a peak in the fidelity of excitation transfer, while crosstalks between qubits mostly affect the hitting time. Knowledge about these noise patterns allows us to propose an error mitigation procedure, which we use to refine the results of running the PST on a simulator of a noisy quantum processor.
The post-quantum security of electronic voting protocols such as lattice-based ones are based on the assumption of certain difficult computational problems, which cannot be solved by classical computers and have also ...
详细信息
The post-quantum security of electronic voting protocols such as lattice-based ones are based on the assumption of certain difficult computational problems, which cannot be solved by classical computers and have also not been solved by effective quantumalgorithms until now. However, these voting protocols are still at risk of compromise with the development of quantum computing, and we call them passive defense voting protocols. By making use of the encrypted three-pass protocol configured by taking physical limits of quantum computing into account and the message authentication code with information theory security, we propose a new post-quantum voting (NPQV) protocol. The proposed protocol exhibits the following advantages: (1) The post-quantum security of NPQV protocol depends on the physical limits that are inherent to quantum computers, so NPQV remains secure with the development of quantum computing and thus we call it active defense voting protocol. NPQV is the first voting protocol with active defense capability. (2) NPQV protocol is suitable for voting with numerous candidates and voters and accommodates the situation in which multiple voters vote simultaneously. (3) NPQV satisfies all the seven security requirements for an electronic voting protocol, i.e. privacy, verifiability, completeness, robustness, eligibility, unreusability and fairness. Moreover, it remains secure under internal and external attacks.
Integer factorization remains a significant challenge for classical computers and is fundamental to the security of RSA encryption. Adiabatic quantumalgorithms present a promising solution, yet their practical implem...
详细信息
Integer factorization remains a significant challenge for classical computers and is fundamental to the security of RSA encryption. Adiabatic quantumalgorithms present a promising solution, yet their practical implementation is limited by the short coherence times of current noisy intermediate-scale quantum devices and quantum simulators. In this work, we apply the chopped random-basis (CRAB) optimization technique to enhance adiabatic quantum factorization algorithms. We demonstrate the effectiveness of CRAB by applying it to factor the integers ranging from 21 to 2479, achieving significantly improved fidelity of the target state when the evolution time exceeds the quantum speed limit. Notably, this performance improvement shows resilience in the presence of dephasing noise, highlighting CRAB's practical utility in noisy quantum systems. Our findings suggest that CRAB optimization can serve as a powerful tool for advancing adiabatic quantumalgorithms, with broader implications for quantuminformationprocessing tasks.
The proceedings contain 26 papers. The special focus in this conference is on String processing and information Retrieval. The topics include: Indexing Finite-State Automata Using Forward-Stable Partitions;burst Edit ...
ISBN:
(纸本)9783031721991
The proceedings contain 26 papers. The special focus in this conference is on String processing and information Retrieval. The topics include: Indexing Finite-State Automata Using Forward-Stable Partitions;burst Edit Distance;generalization of Repetitiveness Measures for Two-Dimensional Strings;on Computing the Smallest Suffixient Set;revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings;logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts;bounded-Ratio Gapped String Indexing;simultaneously Building and Reconciling a Synteny Tree;quantumalgorithms for Longest Common Substring with a Gap;online Computation of String Net Frequency;on the Number of Non-equivalent Parameterized Squares in a String;another Virtue of Wavelet Forests;all-Pairs Suffix-Prefix on Dynamic Set of Strings;adaptive Dynamic Bitvectors;compressed Graph Representations for Evaluating Regular Path Queries;greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings;faster Computation of Chinese Frequent Strings and Their Net Frequencies;faster algorithms for Ranking/Unranking Bordered and Unbordered Words;computing String Covers in Sublinear Time;LZ78 Substring Compression with CDAWGs;2d Side-Sharing Tandems with Mismatches;faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations;Space-Efficient SLP Encoding for O(log N)-Time Random Access;simple Linear-Time Repetition Factorization.
Constraints in power consumption and computational power limit the skill of operational numerical weather prediction by classical computing methods. quantum computing could potentially address both of these challenges...
详细信息
Constraints in power consumption and computational power limit the skill of operational numerical weather prediction by classical computing methods. quantum computing could potentially address both of these challenges. Herein, we present one method to perform fluid dynamics calculations that takes advantage of quantum computing. This hybrid quantum-classical method, which combines several algorithms, scales logarithmically with the dimension of the vector space and quadratically with the number of nonzero terms in the linear combination of unitary operators that specifies the linear operator describing the system of interest. As a demonstration, we apply our method to solve the advection-diffusion equation for a small system using IBM quantum computers. We find that reliable solutions of the equation can be obtained on even the noisy quantum computers available today. This and other methods that exploit quantum computers could replace some of our traditional methods in numerical weather prediction as quantum hardware continues to improve.
This study employs a quantum genetic algorithm (QGA) to optimize the thickness configuration of triple-layer window glass, aiming to reduce indoor ultraviolet (UV) transmission while maximizing visible light transmiss...
详细信息
quantum computing is poised to solve computational paradigms that classical computing could never feasibly reach. Tasks such as prime factorization to quantum Chemistry are examples of classically difficult problems t...
详细信息
ISBN:
(纸本)9781665497473
quantum computing is poised to solve computational paradigms that classical computing could never feasibly reach. Tasks such as prime factorization to quantum Chemistry are examples of classically difficult problems that have analogous algorithms that are sped up on quantum computers. To attain this computational advantage, we must first traverse the noisy intermediate scale quantum (NISQ) era, in which quantum processors suffer from compounding noise factors that can lead to unreliable algorithm induction producing noisy results. We describe QASMBench, a suite of QASM-level (quantum assembly language) benchmarks that challenge all realisable angles of quantum processor noise. We evaluate a large portion of these algorithms by performing density matrix tomography on 14 IBMQ quantum devices.
The foundation of this research is the quantum implementation of two hashing algorithms, namely Secure Hash Algorithm (SHA1) and Message Digest (MD5). quantum cryptography is a challenging topic in network security fo...
详细信息
The foundation of this research is the quantum implementation of two hashing algorithms, namely Secure Hash Algorithm (SHA1) and Message Digest (MD5). quantum cryptography is a challenging topic in network security for future networks. quantum cryptography is an outgrowth of two broad topics-cryptology and cryptanalysis. In this paper, SHA1 and MD5 algorithms are designed and implemented for quantum computers. The main aim is to study and investigate the time requirement to build a hash and the bit rate at which a hash value is sent through. In this paper, a comprehensive analysis of these two algorithms is performed. Experiments have been done to compare and contrast the performances of the classical and proposed algorithms. In the experiment, it was found that the total time of execution of quantum SHA1 and quantum MD5 is much higher than the classical SHA1 and MD5. During quantum MD5 execution, it is observed that the time doubles when the number of chunks is increased from 1 to 2. Another experimental observation is that the execution time of the implemented algorithms depends upon the processor's speed.
quantuminformationprocessing has the potential of implementing faster algorithms for numerous problems, communicating with more secure channels, and performing higher pre- cision sensing compared to classical method...
quantuminformationprocessing has the potential of implementing faster algorithms for numerous problems, communicating with more secure channels, and performing higher pre- cision sensing compared to classical methods. Recent experimental technology advancement has brought us a promising future of harnessing such quantum advantage. Yet, quantum engineering entails wise control and strategy under the current noisy intermediate-scale quan- tum era. Developing robust and efficient approaches to manipulating quantum systems based on constrained and limited resources is imperative. This dissertation focuses on two major topics theoretically. In the first part, this work present how to conceive robust quantum control on matter-based qubits with a geometric approach. We have proposed the method of designing noise robust control pulses suitable for practical devices by combining spatial curves, filter functions, and machine learning. In the second part, this work stresses the topic of photonic multipartite entangled graph states. An improved protocol of generating arbitrary graph states is introduced. We show that one can efficiently find the deterministic photon emission circuit with minimal overhead on the number of quantum emitters.
暂无评论