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

Alleviating Barren Plateaus in Parameterized quantum Machine Learning Circuits: Investigating Advanced Parameter Initialization Strategies

学校读者我要写书评

暂无评论

Alleviating Barren Plateaus in Parameterized Quantum Machine...

Design, Automation and Test in Europe Conference and Exhibition

作者： Muhammad Kashif Muhammad Rashid Saif Al-Kuwari Muhammad Shafique Division of Engineering New York University eBrain Lab Abu Dhabi Abu Dhabi UAE Center for Quantum and Topological Systems NYUAD Research Institute New York University Abu Dhabi UAE Department of Computer Engineering Umm Al Qura University Makkah Saudi Arabia Qatar Center for Quantum Computing College of Science and Engineering Hamad bin Khalifa University Qatar

ISBN: (数字)9783981926385

ISBN: (纸本)9798350348606

Parameterized quantum circuits (PQCs) have emerged as a foundational element in the development and applications of quantum algorithms. However, when initialized with random parameter values, PQCs often exhibit barren plateaus (BP). These plateaus, characterized by vanishing gradients with an increasing number of qubits, hinder optimization in quantum algorithms. In this paper, we analyze the impact of state-of-the-art parameter initialization strategies from classical machine learning in random PQCs from the aspect of BP phenomenon. Our investigation encompasses a spectrum of initialization techniques, including random, Xavier (both normal and uniform variants), He, LeCun, and Orthogonal methods. Empirical assessment reveals a pronounced reduction in variance decay of gradients across all these methodologies compared to the randomly initialized PQCs. Specifically, the Xavier initialization technique outperforms the rest, showing a 62% improvement in variance decay compared to the random initialization. The He, Lecun, and orthogonal methods also display improvements, with respective enhancements of 32 %, 28 %, and 26 %. This compellingly suggests that the adoption of these existing initialization techniques holds the potential to significantly amplify the training efficacy of quantum Neural Networks (QNNs), a subclass of PQCs. Demonstrating this effect, we employ the identified techniques to train QNNs for learning the identity function, effectively mitigating the adverse effects of BPs. The training performance, ranked from the best to the worst, aligns with the variance decay enhancement as outlined above. This paper underscores the role of tailored parameter initialization in mitigating the BP problem and eventually enhancing the training dynamics of QNNs.

关键词： Training quantum algorithm Neural networks Qubit Machine learning quantum circuit Optimization

MADP-IIME: malware attack detection protocol in IoT-enabled industrial multimedia environment using machine learning approach

学校读者我要写书评

暂无评论

MADP-IIME: malware attack detection protocol in IoT-enabled ...

作者： Pundir, Sumit Obaidat, Mohammad S. Wazid, Mohammad Das, Ashok Kumar Singh, Devesh Pratap Rodrigues, Joel J. P. C. Department of Computer Science and Engineering Graphic Era Deemed to be University Dehradun 248 002 India College of Computing and Informatics University of Sharjah UAE with King Abdullah II School of Information Technology The University of Jordan Amman 11942 Jordan University of Science and Technology Beijing Beijing 100083 China Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad 500 032 India Federal University of Piauí (UFPI) PI Teresina 64049-550 Brazil Instituto de Telecomunicações Covilhã 6201-001 Portugal

Internet of Things (IoT) is one of the fastest-growing technologies. With the deployment of massive and faster mobile networks, almost every daily-use item is connected to the Internet. IoT-enabled industrial multimedia environment is used for the collection and analysis of different types of multimedia data (i.e., images, videos, audios, etc.). This multimedia data is generated by various types of smart devices like drones, robots, smart controller, smart surveillance system which are deployed for the industrial monitoring and control. The multimedia data is generated in the enormous amount which can be considered as the big data. This data is further utilized in various types of business needs for example, chances of fire accidents in the industrial plant, overall machine health, etc., which can be predicted through the application of big data analytics. Therefore, IoT-enabled industrial multimedia environment is very helpful to the concerned authorities as they come to know the important information in advance. However, all the smart devices are connected and controlled through the Internet. It further causes severe threats to the communication happens in an IoT-enabled industrial multimedia environment. It is vulnerable to various types of attacks such as replay, man-in-the-middle, impersonation, secret information leakage, sensitive information modification, and malware injection (i.e., mirai). Therefore, it is important to prevent the communication of such an environment against the different types of possible attacks. These days, the attacks performed by botnets (i.e., malware attacks such as mirai and reaper) have drawn attention to the researchers. Under the influence of such attacks, the communication of IoT-enabled industrial multimedia environment is disrupted. Moreover, the attackers may also control the smart devices remotely and can change their functionalities. Hence, we need some robust mechanism to detect the presence of the malware attacks in such

关键词： Internet of things

A Robust Key Exchange and Tamper-Resistant Protocol for HAN and NAN Networks in Smart Grids

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Shamshad, Salman Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China

Smart Grids (SG) rely on Home Area Networks (HAN) and Neighborhood Area Networks (NAN) to ensure efficient power distribution, real-time monitoring, and seamless communication between smart devices. Despite these advantages, the use of public communication channels in HAN and NAN networks introduces critical challenges, such as vulnerability to impersonation, physical tampering, and scalability issues in resource-constrained environments. These issues compromise the stability, reliability, and security of SG environments. Existing protocols often fail to adequately address these challenges, particularly in ensuring resistance to physical tampering of supply lines and impersonation attacks. Additionally, they struggle to minimize the computation, communication, and energy costs associated with securing a resource-constrained SG environment. Therefore, we propose a robust key exchange and tamper-resistant protocol for HAN and NAN networks to address these limitations. The proposed protocol leverages the Physical Unclonable Function (PUF) mechanism to offer physical tampering resistance to smart meters. We validate our protocol formally using the Random or Real (RoR) model, which confirms its security robustness. Additionally, our informal security analysis highlights the protocol's resilience against impersonation, physical tampering attacks, etc. We analyze and compare the performance of the proposed protocol, which further demonstrates our protocol's effectiveness and security compared to competing protocols. Moreover, the proposed protocol achieves resource efficiency with 45.99% and 58.85% substantial reductions in computation overhead and energy overhead, respectively, compared to competing protocols. These results showcase the protocol's enhanced security and practicality for resource-constrained SG environments. © 2014 IEEE.

关键词： Authentication Protocol

Practical limitations on robustness and scalability of quantum Internet

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Sadhu, Abhishek Somayajula, Meghana Ayyala Horodecki, Karol Das, Siddhartha Raman Research Institute Karnataka Bengaluru560080 India Center for Security Theory and Algorithmic Research International Institute of Information Technology Gachibowli Telangana Hyderabad500032 India Department of Computer Science Engineering G Narayanamma Institute of Technology and Science Telangana Hyderabad500104 India Institute of Informatics National Quantum Information Centre Faculty of Mathematics Physics and Informatics University of Gdańsk Wita Stwosza 57 Gdańsk80-308 Poland International Centre for Theory of Quantum Technologies University of Gdańsk Wita Stwosza 63 Gdańsk80-308 Poland

The realization of a desirably functional quantum Internet is hindered by fundamental and practical challenges such as high loss during transmission of quantum systems, decoherence due to interaction with the environment, fragility of quantum states under measurement, etc. We study the implications of these constraints by analyzing the limitations on the scaling and robustness of the quantum Internet. Considering quantum networks, we present practical bottlenecks for secure communication, delegated computing, and resource distribution among end nodes. In particular, we show that the device-independent quantum key distribution (DI-QKD) network of isotropic states with parameter p has a finite diameter depending on p. Motivated by the power of abstraction in graph theory (in association with quantum information theory), that allows us to consider the topology of a network of users spatially separated over long distances around the globe or separated as nodes within the small space over a processor or circuit within a same framework, we consider graph-theoretic quantifiers to assess network robustness and provide critical values of communication lines for viable communication over quantum Internet. We consider some quantum networks of practical interest, ranging from satellite-based networks connecting far-off spatial locations to currently available quantum processor architectures within computers, and analyze their robustness to perform quantum information processing tasks. Some of these tasks form primitives for delegated quantum computing, e.g., entanglement distribution and quantum teleportation, that are desirable for all scale of quantum networks, be it quantum processors or quantum Internet. Copyright © 2023, The Authors. All rights reserved.

关键词： Graph theory

Improving the accuracy of circuit quantization using the electromagnetic properties of superconductors

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Park, Seong Hyeon Choi, Gahyun Kim, Eunjong Park, Gwanyeol Choi, Jisoo Choi, Jiman Chong, Yonuk Lee, Yong-Ho Hahn, Seungyong Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Center for Superconducting Quantum Computing Systems Korea Research Institute of Standards and Science Daejeon34113 Korea Republic of Department of Physics & Astronomy Institute of Applied Physics Seoul National University Seoul08826 Korea Republic of Quantum Devices Labs Korea Advanced Nano Fab Center Suwon16229 Korea Republic of Quantum Design Korea Seoul06272 Korea Republic of SKKU Adavanced Institute of Nanotechnology Sungkyunkwan University Suwon16419 Korea Republic of

Recent advances in quantum information processing with superconducting qubits have fueled a growing demand for scaling and miniaturizing circuit layouts. Despite significant progress, predicting the Hamiltonian of complex circuits remains a challenging task. Here, we propose an improved method for quantizing superconducting circuits that incorporates material- and geometry-dependent kinetic inductance. Our approach models superconducting films as reactive boundary elements, seamlessly integrating into the conventional circuit quantization framework without adding computational complexity. We experimentally validate our method using superconducting devices fabricated with 35 nm-thick disordered niobium films, demonstrating significantly improved accuracy in predicting the Hamiltonian based solely on the device layout and material properties of superconducting films and Josephson junctions. Specifically, conventional methods exhibit an average error of 5.4% in mode frequencies, while our method reduces it to 1.1%. Our method enables systematic studies of superconducting devices with disordered films or compact elements, facilitating precise engineering of superconducting circuits at scale. © 2024, CC BY-NC-ND.

关键词： Superconducting films

Auditing for Core Stability in Participatory Budgeting

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Munagala, Kamesh Shen, Yiheng Wang, Kangning Department of Computer Science Duke University DurhamNC27708-0129 United States Simons Institute for the Theory of Computing UC Berkeley BerkeleyCA94720-2190 United States

We consider the participatory budgeting problem where each of n voters specifies additive utilities over m candidate projects with given sizes, and the goal is to choose a subset of projects (i.e., a committee) with total size at most k. Participatory budgeting mathematically generalizes multiwinner elections, and both have received great attention in computational social choice recently. A well-studied notion of group fairness in this setting is core stability: Each voter is assigned an "entitlement" of nk , so that a subset S of voters can pay for a committee of size at most |S|· nk . A given committee is in the core if no subset of voters can pay for another committee that provides each of them strictly larger utility. This provides proportional representation to all voters in a strong sense. In this paper, we study the following auditing question: Given a committee computed by some preference aggregation method, how close is it to the core? Concretely, how much does the entitlement of each voter need to be scaled down by, so that the core property subsequently holds? As our main contribution, we present computational hardness results for this problem, as well as a logarithmic approximation algorithm via linear program rounding. We show that our analysis is tight against the linear programming bound. Additionally, we consider two related notions of group fairness that have similar audit properties. The first is Lindahl priceability, which audits the closeness of a committee to a market clearing solution. We show that this is related to the linear programming relaxation of auditing the core, leading to efficient exact and approximation algorithms for auditing. The second is a novel weakening of the core that we term the sub-core, and we present computational results for auditing this notion as well. Copyright © 2022, The Authors. All rights reserved.

关键词： Budget control

Polynomial representation of general partial Boolean functions with a single quantum query

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Guoliang, Xu Daowen, Qiu College of Information Technology Luoyang Normal University Luoyang471934 China Institute of Quantum Computing and Computer Theory School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China

Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical deterministic and exact quantum query complexity. Until recent years, it was clarified that all symmetric partial Boolean functions with a single quantum query can be computed exactly by Deutsch-Jozsa algorithm. For the general partial Boolean functions with a single quantum query, the latest characterizations is complex and not very satisfactory. Based on this, this paper proves and discovers three new results: (1) Establishing a new equivalence, each partial Boolean function with a single quantum query can be transformed to a simple partial Boolean function whose polynomial degree is just one;(2) For partial Boolean functions up to four bits, there are only 10 non-trivial partial Boolean functions with a single quantum query;(3) For each quantum 1-query algorithm with undefined measurement, there exists a constructive method for finding out all partial Boolean functions that can be computed exactly by the algorithm. Essentially, the first discovery represent a step forward for a fundamental conclusion that the polynomial degree of partial Boolean functions with a single quantum query is one or two, and the last two results contribute a way for searching more nontrival partial Boolean functions that have quantum advantages. Copyright © 2021, The Authors. All rights reserved.

关键词： quantum computers

Small sets of genuinely nonlocal GHZ states in multipartite systems

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xiong, Zong-Xing Zhang, Yongli Li, Mao-Sheng Li, Lvzhou Institute of Quantum Computing and Software School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China School of Mathematics and Systems Science Guangdong Polytechnic Normal University Guangzhou510665 China School of Mathematics South China University of Technology Guangzhou510641 China

A set of orthogonal multipartite quantum states are called (distinguishability-based) genuinely nonlocal if they are locally indistinguishable across any bipartition of the subsystems. In this work, we consider the problem of constructing small genuinely nonlocal sets consisting of generalized GHZ states in multipartite systems. For system (C2) ⊗ N where N is large, using the language of group theory, we show that a tiny proportion Θ(1/√2N) of states among the N-qubit GHZ basis suffice to exhibit genuine nonlocality. Similar arguments also hold for the canonical generalized GHZ bases in systems (Cd) ⊗ N, wherever d is even and N is large. What is more, moving to the condition that any fixed N is given, we show that d + 1 genuinely nonlocal generalized GHZ states exist in (Cd) ⊗ N, provided the local dimension d is sufficiently large. As an additional merit, within and beyond an asymptotic sense, the latter result also indicates some evident limitations of the "trivial othogonality-preserving local measurements" (TOPLM) technique that has been utilized frequently for detecting genuine nonlocality. © 2023, CC BY.

关键词： Group theory

Surface Ferromagnetism of FeO Nanoparticles Revealed by Operando Magnetoelectrochemical Measurements

学校读者我要写书评

暂无评论

Physical Review Applied 2023年第5期19卷 054022-054022页

作者： Hengjun Liu Fangchao Gu Xiancheng Sang Yuanyuan Han Feihu Zou Zhaohui Li Yufeng Qin Li Cai Yuanyuan Pan Qiang Cao Guo-xing Miao Qiang Li College of Physics Weihai Innovation Research Institute Qingdao University Qingdao 266071 China College of Information Science and Engineering Shandong Agricultural University Taian Shandong 271018 People’s Republic of China Spintronics Institute University of Jinan Jinan 250022 China Department of Electrical and Computer Engineering & Institute for Quantum Computing University of Waterloo Ontario N2L 3G1 Canada

In view of the long-standing controversy over the surface ferromagnetism of FeO, we propose to prepare its nanoparticles based on the lithium-battery reaction mechanism and carry out operando magnetometry measurements. This operando magnetoelectrochemical technology allows accurate magnetic detection of electrochemical synthesis products, effectively avoiding various intractable surface reactions during sample transmission processes. Due to the large surface area of nanosized FeO, the magnetometry measurements show strong ferromagnetism and a high Curie temperature of 754 K, which can be attributed to surface frustration and the surface-bulk exchange interaction. These critical results confirm the surface ferromagnetism of FeO and provide valuable insights toward the design of spintronic devices.

关键词： Electrochemistry Ferromagnetism Spintronics Surface & interfacial phenomena Magnetic nanoparticles Transition metal oxides Sample preparation