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

Modeling the performance of early fault-tolerant quantum algorithms

学校读者我要写书评

暂无评论

Physical Review Research 2024年第2期6卷 023118-023118页

作者： Qiyao Liang Yiqing Zhou Archismita Dalal Peter Johnson Zapata AI Boston Massachusetts 02110 USA Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Laboratory of Atomic and Solid State Physics Cornell University Ithaca New York 14853 USA Zapata Computing Canada Inc. Toronto Ontario M5V 2Y1 Canada

Progress in fault-tolerant quantum computation (FTQC) has driven the pursuit of practical applications with early fault-tolerant quantum computers (EFTQC). These devices, limited in their qubit counts and fault-tolerance capabilities, require algorithms that can accommodate some degrees of error, which are known as EFTQC algorithms. To predict the onset of early quantum advantage, a comprehensive methodology is needed to develop and analyze EFTQC algorithms, drawing insights from both the methodologies of noisy intermediate-scale quantum and traditional FTQC. To address this need, we propose such a methodology for modeling algorithm performance on EFTQC devices under varying degrees of error. As a case study, we apply our methodology to analyze the performance of randomized Fourier estimation (RFE) [Kshirsagar, Katabarwa, and Johnson, arXiv:2209.11322], an EFTQC algorithm for phase estimation. We investigate the runtime performance and the fault-tolerant overhead of RFE in comparison to the traditional quantum phase estimation algorithm. Our analysis reveals that RFE achieves significant savings in physical qubit counts while having a much higher runtime upper bound. We anticipate even greater physical qubit savings when considering more realistic assumptions about the performance of EFTQC devices. By providing insights into the performance trade-offs and resource requirements of EFTQC algorithms, our work contributes to the development of practical and efficient quantum computing solutions on the path to quantum advantage.

关键词： Quantum algorithms & computation Quantum computation Quantum error correction Quantum information processing

Non-native Quantum Generative Optimization with Adversarial Autoencoders

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wilson, Blake A. Wurtz, Jonathan Mkhitaryan, Vahagn Bezick, Michael Wang, Sheng-Tao Kais, Sabre Shalaev, Vladimir M. Boltasseva, Alexandra Elmore Family School of Electrical and Computer Engineering Purdue Quantum Science and Engineering Institute Purdue University West LafayetteIN47907 United States Quantum Science Center Oak Ridge National Laboratory Oak RidgeTN37831 United States QuEra Computing Inc. 1284 Soldiers Field Road BostonMA02135 United States School of Computer Science Purdue University West LafayetteIN47907 United States Department of Chemistry Purdue University West LafayetteIN47907 United States

Large-scale optimization problems are prevalent in several fields, including engineering, finance, and logistics. However, most optimization problems cannot be efficiently encoded onto a physical system because the existing quantum samplers have too few qubits. Another typical limiting factor is that the optimization constraints are not compatible with the native cost Hamiltonian. This work presents a new approach to address these challenges. We introduce the adversarial quantum autoencoder model (AQAM) that can be used to map large-scale optimization problems onto existing quantum samplers while simultaneously optimizing the problem through latent quantum-enhanced Boltzmann sampling. We demonstrate the AQAM on a neutral atom sampler, and showcase the model by optimizing 64px×64px unit cells that represent a broad-angle filter metasurface applicable to improving the coherence of neutral atom devices. Using 12-atom simulations, we demonstrate that the AQAM achieves a lower Renyi divergence and a larger spectral gap when compared to classical Markov Chain Monte Carlo samplers. Our work paves the way to more efficient mapping of conventional optimization problems into existing quantum samplers. Copyright © 2024, The Authors. All rights reserved.

关键词： Optimization

A Survey on Indoor Visible Light Positioning Systems: Fundamentals, Applications, and Challenges

学校读者我要写书评

暂无评论

IEEE Communications Surveys and Tutorials 2024年

作者： Zhu, Zhiyu Yang, Yang Chen, Mingzhe Guo, Caili Cheng, Julian Cui, Shuguang Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering and Institute for Data Science and Computing Coral GablesFL33146 United States Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China The University of British Columbia Faculty of Applied Science School of Engineering KelownaBCV1V 1V7 Canada 518172 Hong Kong

The growing demand for location-based services in areas like virtual reality, robot control, and navigation has intensified the focus on indoor localization. Visible light positioning (VLP), leveraging visible light communications (VLC), becomes a promising indoor positioning technology due to its high accuracy and low cost. This paper provides a comprehensive survey of VLP systems. In particular, since VLC lays the foundation for VLP, we first present a detailed overview of the principles of VLC. Then, we provide an in-depth overview of VLP algorithms. The performance of each positioning algorithm is also compared in terms of various metrics such as accuracy, coverage, and orientation limitation. Beyond the physical layer studies, the network design for a VLP system is also investigated, including multi-access technologies, resource allocation, and light-emitting diode (LED) placements. Next, the applications of the VLP systems are overviewed. Finally, this paper outlines open issues, challenges, and opportunities for the research field. In a nutshell, this paper constitutes the first holistic survey on VLP from state-of-the-art studies to practical uses. © 1998-2012 IEEE.

关键词： Resource allocation

ASSESSING REUSABILITY OF DEEP LEARNING-BASED MONOTHERAPY DRUG RESPONSE PREDICTION MODELS TRAINED WITH OMICS DATA

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Overbeek, Jamie C. Partin, Alexander Brettin, Thomas S. Chia, Nicholas Narykov, Oleksandr Vasanthakumari, Priyanka Wilke, Andreas Zhu, Yitan Clyde, Austin Jones, Sara Gnanaolivu, Rohan Liu, Yuanhang Jiang, Jun Wang, Chen Knutson, Carter McNaughton, Andrew Kumar, Neeraj Fernando, Gayara Demini Ghosh, Souparno Sanchez-Villalobos, Cesar Zhang, Ruibo Pal, Ranadip Ryan Weil, M. Stevens, Rick L. Data Science and Learning Division Argonne National Laboratory LemontIL United States Computing Environment and Life Sciences Argonne National Laboratory LemontIL United States Department of Computer Science The University of Chicago ChicagoIL United States Frederick National Laboratory for Cancer Research FrederickMD United States Department of Quantitative Health Sciences Mayo Clinic RochesterMN United States Pacific Northwest National Laboratory RichlandWA United States Department of Statistics University of Nebraska–Lincoln LincolnNE United States Department of Electrical & Computer Engineering Texas Tech University LubbockTX United States

Cancer drug response prediction (DRP) models present a promising approach towards precision oncology, tailoring treatments to individual patient profiles. While deep learning (DL) methods have shown great potential in this area, models that can be successfully translated into clinical practice and shed light on the molecular mechanisms underlying treatment response will likely emerge from collaborative research efforts. This highlights the need for reusable and adaptable models that can be improved and tested by the wider scientific community. In this study, we present a scoring system for assessing the reusability of prediction DRP models, and apply it to 17 peer-reviewed DL-based DRP models. As part of the IMPROVE (Innovative Methodologies and New Data for Predictive Oncology Model Evaluation) project, which aims to develop methods for systematic evaluation and comparison DL models across scientific domains, we analyzed these 17 DRP models focusing on three key categories: software environment, code modularity, and data availability and preprocessing. While not the primary focus, we also attempted to reproduce key performance metrics to verify model behavior and adaptability. Our assessment of 17 DRP models reveals both strengths and shortcomings in model reusability. Issues like underspecified software environments, lack of workflow documentation, and omission of data preprocessing scripts create challenges for users attempting to reproduce or build upon these models. To promote rigorous practices and open-source sharing, we offer recommendations for developing and sharing prediction models. Following these recommendations can address many of the issues identified in this study, improving model reusability without adding significant burdens on researchers. This work offers the first comprehensive assessment of reusability and reproducibility across diverse DRP models, providing insights into current model sharing practices and promoting standards within the DRP a

关键词： Prediction models

Diff9D: Diffusion-Based Domain-Generalized Category-Level 9-DoF Object Pose Estimation

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liu, Jian Sun, Wei Yang, Hui Deng, Pengchao Liu, Chongpei Sebe, Nicu Rahmani, Hossein Mian, Ajmal National Engineering Research Center for Robot Visual Perception and Control Technology College of Electrical and Information Engineering School of Robotics State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body Hunan University Changsha410082 China Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University Xi’an710049 China Department of Information Engineering and Computer Science University of Trento Trento38123 Italy School of Computing and Communications Lancaster University LA1 4YW United Kingdom Department of Computer Science The University of Western Australia WA6009 Australia

Nine-degrees-of-freedom (9-DoF) object pose and size estimation is crucial for enabling augmented reality and robotic manipulation. Category-level methods have received extensive research attention due to their potential for generalization to intra-class unknown objects. However, these methods require manual collection and labeling of large-scale real-world training data. To address this problem, we introduce a diffusion-based paradigm for domain-generalized category-level 9-DoF object pose estimation. Our motivation is to leverage the latent generalization ability of the diffusion model to address the domain generalization challenge in object pose estimation. This entails training the model exclusively on rendered synthetic data to achieve generalization to real-world scenes. We propose an effective diffusion model to redefine 9-DoF object pose estimation from a generative perspective. Our model does not require any 3D shape priors during training or inference. By employing the Denoising Diffusion Implicit Model, we demonstrate that the reverse diffusion process can be executed in as few as 3 steps, achieving near real-time performance. Finally, we design a robotic grasping system comprising both hardware and software components. Through comprehensive experiments on two benchmark datasets and the real-world robotic system, we show that our method achieves state-of-the-art domain generalization performance. Our code will be made public at https://***/CNJianLiu/Diff9D. Copyright © 2025, The Authors. All rights reserved.

关键词： Augmented reality

Distributed identification of power system network branch events

学校读者我要写书评

暂无评论

Distributed identification of power system network branch ev...

2020 IEEE Power and Energy Society General Meeting, PESGM 2020

作者： Madurasinghe, Dulip Arunagirinathan, Paranietharan Venayagamoorthy, Ganesh K. Clemson University Real-Time Power and Intelligent Systems Laboratory Holcombe Department of Electrical and Computer Engineering ClemsonSC29634 United States School of Engineering University of Kwazulu-Natal Durban4041 South Africa

ISBN: (纸本)9781728155081

Online identification of power system network branches is critical in modern electric power system operation. Availability of phasor measurement units (PMUs) can be used to identify branch events. Due to complexity of the power system, a distributed cellular computational network (CCN) is proposed. Comparison of centralized and distributed neural network based power system network branch events identification is studied. IEEE 12-bus benchmark power system is simulated on real-time digital simulator platform for this study. CCN based distributed neural network approach is computationally efficient compared to centralized approach. © 2020 IEEE.

关键词： Phasor measurement units

Joint User Scheduling and computing Resource Allocation Optimization in Asynchronous Mobile Edge computing Networks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Cang, Yihan Chen, Ming Pan, Yijin Yang, Zhaohui Hu, Ye Sun, Haijian Chen, Mingzhe The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China The Purple Mountain Laboratories Nanjing211100 China College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China International Joint Innovation Center Zhejiang University Haining314400 China Hangzhou310027 China The Department of Industrial and System Engineering University of Miami Coral GablesFL33146 United States The School of Electrical and Computer Engineering The University of Georgia AthensGA30602 United States The Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States

In this paper, the problem of joint user scheduling and computing resource allocation in asynchronous mobile edge computing (MEC) networks is studied. In such networks, edge devices will offload their computational tasks to an MEC server, using the energy they harvest from this server. To get their tasks processed on time using the harvested energy, edge devices will strategically schedule their task offloading, and compete for the computational resource at the MEC server. Then, the MEC server will execute these tasks asynchronously based on the arrival of the tasks. This joint user scheduling, time and computation resource allocation problem is posed as an optimization framework whose goal is to find the optimal scheduling and allocation strategy that minimizes the energy consumption of these mobile computing tasks. To solve this mixed-integer non-linear programming problem, the general benders decomposition method is adopted which decomposes the original problem into a primal problem and a master problem. Specifically, the primal problem is related to computation resource and time slot allocation, of which the optimal closed-form solution is obtained. The master problem regarding discrete user scheduling variables is constructed by adding optimality cuts or feasibility cuts according to whether the primal problem is feasible, which is a standard mixed-integer linear programming problem and can be efficiently solved. By iteratively solving the primal problem and master problem, the optimal scheduling and resource allocation scheme is obtained. Simulation results demonstrate that the proposed asynchronous computing framework reduces 87.17% energy consumption compared with conventional synchronous computing counterpart. Copyright © 2024, The Authors. All rights reserved.

关键词： Energy transfer

Visible Light Positioning Based on a Single Luminaire: A Novel Visual Odometry Assisted Algorithm

学校读者我要写书评

暂无评论

Visible Light Positioning Based on a Single Luminaire: A Nov...

IEEE International Conference on Communications (ICC)

作者： Zhiyu Zhu Yang Yang Mingzhe Chen Caili Guo Yipeng Bai Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

Visible light positioning (VLP) is a promising positioning technique, which, however, typically requires multiple luminaires to achieve accurate positioning. This paper proposes a novel visual odometry (VO) assisted visible light positioning algorithm (VO-VLP) in achieving positioning with only a single luminaire. In the considered model, a user equipped with a camera jointly uses geometric features in the captured images and coordinates information obtained via visible light communication (VLC) for positioning. The proposed VLP algorithm does not rely on any extra inertial measurement unit and relaxes the tilted angle limitation at the user. In particular, VO-VLP first uses the circle feature of a luminaire to obtain dual normal vectors of the luminaire. Then, the basic principle of VO is used to eliminate the wrong normal vector by exploiting the geometric features in two consecutive images captured when the user moves. Finally, the pose and location of the user are obtained by using an artificially marked point on the luminaire's contour. VO-VLP can achieve accurate positioning with only a single luminaire and a camera. Simulation results show that the proposed indoor positioning algorithm can achieve a 97th-percentile positioning accuracy of around 10 cm.

关键词：

Communication-Efficient Large-Scale Distributed Deep Learning: A Comprehensive Survey

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liang, Feng Zhang, Zhen Lu, Haifeng Leung, Victor C.M. Guo, Yanyi Hu, Xiping Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518000 China Guangdong-Hong Kong-Macao Joint Laboratory for Emotional Intelligence and Pervasive Computing Shenzhen MSU-BIT University Shenzhen518107 China Gansu Provincial Key Laboratory of Wearable Computing School of information Science and Engineering Lanzhou University Gansu730000 China The Department of Electrical and Computer Engineering The University of British Columbia Vancouver Canada Frontier Cross Disciplinary Research Institute Shenzhen MSU-BIT University Shenzhen518000 China The School of Mechanical and Electrical Engineering Beijing Institute of Technology Beijing10081 China

With the rapid growth in the volume of data sets, models, and devices in the domain of deep learning, there is increasing attention on large-scale distributed deep learning. In contrast to traditional distributed deep learning, the large-scale scenario poses new challenges that include fault tolerance, scalability of algorithms and infrastructures, and heterogeneity in data sets, models, and resources. Due to intensive synchronization of models and sharing of data across GPUs and computing nodes during distributed training and inference processes, communication efficiency becomes the bottleneck for achieving high performance at a large scale. This article surveys the literature over the period of 2018-2023 on algorithms and technologies aimed at achieving efficient communication in large-scale distributed DL at various levels, including algorithms, frameworks, and infrastructures. Specifically, we first introduce efficient algorithms for model synchronization and communication data compression in the context of large-scale distributed training. Next, we introduce efficient strategies related to resource allocation and task scheduling for use in distributed training and inference. After that, we present the latest technologies pertaining to modern communication infrastructures used in distributed deep learning, including GPU interconnects, programmable network devices, collective communication protocols, and communication topologies. We focus our discussion of these topics on examining the impact of the communication overhead in a large-scale and heterogeneous setting. Finally, we conduct a case study on the distributed training of large language models at a large scale to illustrate how to apply these technologies in real cases. This article aims to offer researchers a comprehensive understanding of the current landscape of large-scale distributed deep learning and to reveal promising future research directions toward communication-efficient solutions in this scope.

关键词： Scalability