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

SLA-SCA: Secure and Lightweight Authentication and Key Agreement Mechanism for Smart City Applications

学校读者我要写书评

暂无评论

SLA-SCA: Secure and Lightweight Authentication and Key Agree...

2023 IEEE International Conference on Communications, computing, Cybersecurity and Informatics, CCCI 2023

作者： Pant, Bhairvi Obaidat, Mohammad S. Singh, Shreya Pant, Mudita Wazid, Mohammad Das, Ashok Kumar Hsiao, Kuei-Fang Graphic Era Deemed to Be University Department of Computer Science and Engineering Dehradun248002 India King Abdullah Ii School of Information Technology The University of Jordan Amman11942 Jordan University of Science and Technology Beijing Beijing100083 China School of Computing Srm University TN Kattankulathur603203 India Ctr. for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad 500032 India University of Texas-Permian Basin Computer Science Department OdessaTX 79762 United States

ISBN: (纸本)9798350302561

The notion of a smart city is a modern concept characterized by the widespread integration of the Internet of Things (IoT) across various facets of urban life, including healthcare, traffic management, agriculture, and more. This establishes real-time communication and data exchange between all users, servers and devices through the Internet. As we begin to discuss communication between parties, one must also recognize the imperative need for this exchange to be secure and private, as such exchanges are extremely vulnerable to attacks such as man-in-the-middle and replay attacks and even situations like compromising of anonymity during exchanges. This paper focuses on finding an innovative solution to the same challenge. It proposes a mechanism to establish secure communication between the smart IoT devices and the connected cloud servers through a secure mutual authentication and key establishment process with a short name 'SLA-SCA'. The security analysis of the proposed SLA-SCA is done, which proves its resilience against the various potential attacks of such a communication. The proposed SLA-SCA outperformed the other existing schemes regarding important security and functionality features. © 2023 IEEE.

关键词： Internet of things

Supervisory Control of quantum Discrete Event Systems

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Qiu, Daowen Institute of Quantum Computing and Computer Theory School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China

Discrete event systems (DES) have been deeply developed and applied in practice, but state complexity in DES still is an important problem to be better solved with innovative methods. With the development of quantum computing and quantum control, a natural problem is to simulate DES by means of quantum computing models and to establish quantum DES (QDES). The motivation is twofold: on the one hand, QDES have potential applications when DES are simulated and processed by quantum computers, where quantum systems are employed to simulate the evolution of states driven by discrete events, and on the other hand, QDES may have essential advantages over DES concerning state complexity for imitating some practical problems. So, the goal of this paper is to establish a basic framework of QDES by using quantum finite automata (QFA) as the modelling formalisms, and the supervisory control theorems of QDES are established and proved. Then we present a polynomial-time algorithm to decide whether or not the controllability condition holds. In particular, we construct a number of new examples of QFA to illustrate the supervisory control of QDES and to verify the essential advantages of QDES over classical DES in state complexity. Copyright © 2021, The Authors. All rights reserved.

关键词： Discrete event simulation

Open-system spin transport and operator weight dissipation in spin chains

学校读者我要写书评

暂无评论

Physical Review B 2023年第11期107卷 115118-115118页

作者： Yongchan Yoo Christopher David White Brian Swingle Department of Physics Condensed Matter Theory Center and Joint Quantum Institute University of Maryland College Park Maryland 20742 USA Joint Center for Quantum Information and Computer Science University of Maryland College Park Maryland 20742 USA Condensed Matter Theory Center University of Maryland College Park Maryland 20742 USA Department of Physics Brandeis University Waltham Massachusetts 02453 USA

We use nonequilibrium steady states to study the effect of dissipation-assisted operator evolution (DAOE) on the scaling behavior of transport in one-dimensional spin chains. We consider three models in the XXZ family: the XXZ model with staggered anisotropy, which is chaotic; XXZ model with no external field and tunable interaction, which is Bethe-ansatz integrable and (in the zero interaction limit) free-fermion integrable; and the disordered XY model, which is free-fermion integrable and Anderson localized. We find evidence that DAOE's effect on transport is controlled by its effect on the system's conserved quantities. To the extent that DAOE preserves those symmetries, it preserves the scaling of the system's transport properties; to the extent it breaks those conserved quantities, it pushes the system towards diffusive scaling of transport.

关键词： quantum transport 1-dimensional spin chains quantum many-body systems Tensor network methods

On Statistical Rates and Provably Efficient Criteria of Latent Diffusion Transformers (DiTs)

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hu, Jerry Yao-Chieh Wu, Weimin Song, Zhao Liu, Han Center for Foundation Models Generative AI Department of Computer Science Department of Statistics and Data Science Northwestern University EvanstonIL60208 United States Simons Institute for the Theory of Computing UC Berkeley BerkeleyCA94720 United States

We investigate the statistical and computational limits of latent Diffusion Transformers (DiTs) under the low-dimensional linear latent space assumption. Statistically, we study the universal approximation and sample complexity of the DiTs score function, as well as the distribution recovery property of the initial data. Specifically, under mild data assumptions, we derive an approximation error bound for the score network of latent DiTs, which is sub-linear in the latent space dimension. Additionally, we derive the corresponding sample complexity bound and show that the data distribution generated from the estimated score function converges toward a proximate area of the original one. Computationally, we characterize the hardness of both forward inference and backward computation of latent DiTs, assuming the Strong Exponential Time Hypothesis (SETH). For forward inference, we identify efficient criteria for all possible latent DiTs inference algorithms and showcase our theory by pushing the efficiency toward almost-linear time inference. For backward computation, we leverage the low-rank structure within the gradient computation of DiTs training for possible algorithmic speedup. Specifically, we show that such speedup achieves almost-linear time latent DiTs training by casting the DiTs gradient as a series of chained low-rank approximations with bounded error. Under the low-dimensional assumption, we show that the statistical rates and the computational efficiency are all dominated by the dimension of the subspace, suggesting that latent DiTs have the potential to bypass the challenges associated with the high dimensionality of initial data. © 2024, CC BY-NC-SA.

关键词： Distribution transformers

Learning quantum Finite Automata with Queries

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Qiu, Daowen Institute of Quantum Computing and Computer Theory School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China

Learning finite automata (termed as model learning) has become an important field in machine learning and has been useful realistic applications. quantum finite automata (QFA) are simple models of quantum computers with finite memory. Due to their simplicity, QFA have well physical realizability, but one-way QFA still have essential advantages over classical finite automata with regard to state complexity (two-way QFA are more powerful than classical finite automata in computation ability as well). As a different problem in quantum learning theory and quantum machine learning, in this paper, our purpose is to initiate the study of learning QFA with queries (naturally it may be termed as quantum model learning), and the main results are regarding learning two basic one-way QFA (1QFA): (1) We propose a learning algorithm for measure-once 1QFA (MO-1QFA) with query complexity of polynomial time;(2) We propose a learning algorithm for measure-many 1QFA (MM-1QFA) with query complexity of polynomial-time, as well. Copyright © 2021, The Authors. All rights reserved.

关键词： Finite automata

An MSVL Based Model Checking Method for Multi-threaded C Programs 10th

学校读者我要写书评

暂无评论

An MSVL Based Model Checking Method for Multi-threaded C Pro...

International Workshop on Structured Object-Oriented Formal Language and Method, SOFL+MSVL 2020

作者： Shu, Xinfeng Wang, Zhenyu Gao, Weiran Wang, Xiaobing Zhao, Liang School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710061 China Institute of Computing Theory and Technology Xidian University Xi’an710071 China

ISBN: (纸本)9783030774738

To solve the problem that software testing is unable to meet the verification needs of multi-threaded C programs, a novel verification approach with Modeling, Simulation and Validation Language (MSVL) is proposed. To this end, the rules for describing the parallel execution semantics of multi-threaded C program with MSVL are defined,, and a specific tool is developed for automatically translating a multi-threaded C program into its equivalent MSVL program. In addition, an example is given to illustrate how the approach works. The approach fully utilizes the powerful expressiveness of MSVL to verify the multi-threaded C programs in a direct way, and helps to improve the quality of the software system. © 2021, Springer Nature Switzerland AG.

关键词： Model checking

Scheme for braiding Majorana zero modes in vortices using an STT-matrix

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Huang, Guangyao Zhang, Xinfang Yi, Xiaofeng Fu, Jibang Wang, Weichen Deng, Mingtang Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China Hefei National Laboratory Hefei230088 China

Recently conducted experiments on two-dimensional topological superconductors have revealed various indications of Majorana zero modes (MZMs). However, progress in the manipulation of MZM braiding has been limited, impeding the realization of topological quantum computing. In this study, we propose a potential braiding scheme based on a spintronics device matrix. This scheme involves utilizing a matrix composed of spin-transfer torque devices (STT-matrix) alongside a two-dimensional topological superconductor material. By programming the ON/OFF states of the spintronics devices within the STT-matrix, it becomes possible to manipulate vortices hosting MZMs in the two-dimensional topological superconductor. To further investigate this concept, we construct a time-dependent Ginzburg-Landau model and perform numerical simulations to analyze vortex-driving dynamics, MZM braiding processes, and MZM fusion phenomena. Our findings demonstrate that this system exhibits high versatility and flexibility in manipulating vortices. With advancements in spintronics device technology, our proposed scheme offers a feasible and practical method for operating MZMs within vortices present in topological superconductors. © 2024, CC BY.

关键词： Topology

State complexity of one-way quantum finite automata together with classical states

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Xiao, Ligang Qiu, Daowen Institute of Quantum Computing and Computer Theory School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China

One-way quantum finite automata together with classical states (1QFAC) proposed in [Journal of computer and System sciences 81 (2) (2015) 359–375] is a new one-way quantum finite automata (1QFA) model that integrates quantum finite automata (QFA) and deterministic finite automata (DFA). This model uses classical states to control the evolution and measurement of quantum states. As a quantum-classical hybrid model, 1QFAC recognize all regular languages. It was shown that the state complexity of 1QFAC for some languages is essentially superior to that of DFA and other 1QFA. However, the relationships and balances between quantum states and classical states are still not clear in 1QFAC, for example, how to reduce a quantum state by adding classical states, and vice versa. In this paper, our goal is to clarify state complexity problems for 1QFAC. We obtain the following results: (1) We optimize the bound given by Qiu et al. that characterizes the relationship between quantum basis state number and classical state number of 1QFAC as well as the state number of its corresponding minimal DFA for recognizing any given regular language. (2) We give an upper bound showing that how many classical states are needed if the quantum basis states of 1QFAC are reduced without changing its recognition ability. (3) We give a lower bound of the classical state number of 1QFAC for recognizing any given regular language, and the lower bound is exact if the given language is finite. (4) We show that 1QFAC are exponentially more succinct than DFA and probabilistic finite automata (PFA) for recognizing some regular languages that can not be recognized by measure-once 1QFA (MO-1QFA), measure-many 1QFA (MM-1QFA) or multi-letter 1QFA. (5) We reveal essential relationships between 1QFAC, MO-1QFA and multi-letter 1QFA, and induce a result regarding a quantitative relationship between the state number of multi-letter 1QFA and DFA. Copyright © 2021, The Authors. All rights reserved.

关键词： Finite automata

Robust quantum Walk Search Without Knowing the Number of Marked Vertices

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Xu, Yongzhen Zhang, Delong Li, Lvzhou Institute of Quantum Computing and Computer Theory School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China

There has been a very large body of research on searching a marked vertex on a graph based on quantum walks, and Grover's algorithm can be regarded as a quantum walk-based search algorithm on a special graph. However, the existing quantum walk-based search algorithms suffer severely from the soufflé problem which mainly means that the success probability of finding a marked vertex could shrink dramatically even to zero when the number of search steps is greater than the right one, thus heavily reducing the robustness and practicability of the algorithm. Surprisingly, while the soufflé problem of Grover's algorithm has attracted enough attention, how to address this problem for general quantum walk-based search algorithms is missing in the literature. Here we initiate the study of overcoming the soufflé problem for quantum walk-based search algorithms by presenting a new quantum walk-based search framework that achieves robustness without sacrificing the quantum speedup. In this framework, for any adjustable parameter Ε, the quantum algorithm can find a marked vertex on an N-vertex complete bipartite graph with probability at least 1 − Ε, whenever the number of search steps h satisfies (Equation presented). Note that the algorithm need not know the exact number of marked vertices. Consequently, we obtain quantum search algorithms with stronger robustness and practicability. © 2021, CC BY.

关键词： Graphic methods