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

A Fast Algorithm for Computing the Deficiency Number of a Mahjong Hand

Chinese Journal of Electronics 2024年第6期33卷 1383-1398页

作者： Xueqing YAN Yongming LI Sanjiang LI School of Computer Science Shaanxi Normal University School of Mathematics and Statistics Shaanxi Normal University Centre for Quantum Software and Information Faculty of Engineering and Information TechnologyUniversity of Technology Sydney

The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tiles in turn until they complete a winning hand. An important notion in Mahjong is the deficiency number(*** number in Japanese Mahjong) of a hand, which estimates how many tile changes are necessary to complete the hand into a winning hand. The deficiency number plays an essential role in major decision-making tasks such as selecting a tile to discard. This paper proposes a fast algorithm for computing the deficiency number of a Mahjong hand. Compared with the baseline algorithm, the new algorithm is usually 100 times faster and, more importantly,respects the agent's knowledge about available tiles. The algorithm can be used as a basic procedure in all Mahjong variants by both rule-based and machine learning-based Mahjong AI.

关键词： Machine learning algorithms Knowledge based systems Decision making Asia Games

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling of graph states via path decompositions

引用

Physical Review A 2025年第1期111卷 012627-012627页

作者： Samuel J. Elman Jason Gavriel Ryan L. Mann Centre for Quantum Software and Information School of Computer Science Faculty of Engineering and Information Technology University of Technology Sydney NSW 2007 Australia Centre for Quantum Computation and Communication Technology Faculty of Engineering and Information Technology University of Technology Sydney NSW 2007 Australia

We study the optimal scheduling of graph states in measurement-based quantum computation, establishing an equivalence between measurement schedules and path decompositions of graphs. We define the spatial cost of a measurement schedule based on the number of simultaneously active qubits and prove that an optimal measurement schedule corresponds to a path decomposition of minimal width. Our analysis shows that approximating the spatial cost of a graph is NP-hard, while for graphs with bounded spatial cost, we establish an efficient algorithm for computing an optimal measurement schedule.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

Effects of AI on Smart Agriculture: A Case Study of Digital Agriculture Base 3

Effects of AI on Smart Agriculture: A Case Study of Digital ...

引用

3rd International Conference on Artificial Intelligence, Big Data and Algorithms, CAIBDA 2023

作者： Wang, Dongxue Rajamanickam, Leelavathi Centre for Software Engineering Faculty of Engineering Built Environment & Information Technology SEGi University Selangor Darul Ehsan Malaysia

ISBN: (纸本)9781643684444

Smart agriculture in China still faces difficulties in the transformation of agricultural achievements by AI technology and the scattering of land. The current problems in smart agriculture are a serious shortage of talent, scattered data, a weak mass base, unfocused land and weak agricultural technology companies. To address the problems in the development of smart agriculture. Based on the earlier research, the hypothesis that AI technology plays a positive role in the development of smart agriculture. Combining case study and phenomenology of qualitative analysis theory, field observation, focus group discussion and in-depth interviews were used to conduct an in-depth qualitative analysis using the digital agriculture base as a typical smart agriculture construction. Artificial intelligence technology has been widely used in agricultural production, especially in the Digital Agriculture Base, and is an important part of the construction of smart agriculture. It has played a catalytic role in the development of the agricultural economy and the improvement of agricultural production efficiency. This paper explores the impact of AI technology on the development of smart agriculture, and the obstacles to implement AI technology into the construction of smart agriculture, with a view to propose strategies to sustainably promote the construction of smart agriculture. The results show that the hypothesis of AI technology has a positive effect on the construction of smart agriculture holds true. © 2023 The Authors.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Optimal Scheduling of Graph States via Path Decompositions

arXiv

引用

arXiv 2024年

作者： Elman, Samuel J. Gavriel, Jason Mann, Ryan L. Centre for Quantum Software and Information School of Computer Science Faculty of Engineering & Information Technology University of Technology SydneyNSW2007 Australia Centre for Quantum Computation and Communication Technology Australia

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Provision for Energy: A Resource Allocation Problem in Federated Learning for Edge Systems

EAI Endorsed Transactions on Energy Web

引用

EAI Endorsed Transactions on Energy Web 2024年 11卷

作者： Liu, Mingyue Rajamanickam, Leelavathi Parthasarathy, Rajamohan SEGi University Centre for Software Engineering Faculty of Engineering Built Environment Information Technology Malaysia SEGi University Centre for Software Engineering Centre for Network Security and IoT Faculty of Engineering Built Environment Information Technology Malaysia

The article explores an energy-efficient method for allocating transmission and computation resources for federated learning (FL) on wireless communication networks. The model being considered involves each user training a local FL model using their limited local computing resources and the data they have collected. These local models are then transmitted to a base station, where they are aggregated and broadcast back to all users. The level of accuracy in learning, as well as computation and communication latency, are determined by the exchange of models between users and the base station. Throughout the FL process, energy consumption for both local computation and transmission must be taken into account. Given the limited energy resources of wireless users, the communication problem is formulated as an optimization problem with the goal of minimizing overall system energy consumption while meeting a latency requirement. To address this problem, we propose an iterative algorithm that takes into account factors such as bandwidth, power, and computational resources. Results from numerical simulations demonstrate that the proposed algorithm can reduce energy consumption compared to traditional FL methods up to 51% reduction. © 2024 M. Liu et al., licensed to EAI. This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.

关键词： Base stations

来源：评论

学校读者我要写书评

暂无评论

Algorithmic Cluster Expansions for quantum Problems

引用

PRX quantum 2024年第1期5卷 010305-010305页

作者： Ryan L. Mann Romy M. Minko Centre for Quantum Computation and Communication Technology Centre for Quantum Software and Information School of Computer Science Faculty of Engineering & Information Technology University of Technology Sydney NSW 2007 Australia School of Mathematics University of Bristol Bristol BS8 1UG United Kingdom

We establish a general framework for developing approximation algorithms for a class of counting problems. Our framework is based on the cluster expansion of the abstract polymer model formalism of Kotecký and Preiss. We apply our framework to obtain efficient algorithms for (1) approximating probability amplitudes of a class of quantum circuits close to the identity, (2) approximating expectation values of a class of quantum circuits with operators close to the identity, (3) approximating partition functions of a class of quantum spin systems at high temperature, and (4) approximating thermal expectation values of a class of quantum spin systems at high temperature with positive-semidefinite operators. Further, we obtain hardness of approximation results for approximating probability amplitudes of quantum circuits and partition functions of quantum spin systems. This establishes a computational complexity transition for these problems and shows that our algorithmic conditions are optimal under complexity-theoretic assumptions. Finally, we show that our algorithmic condition is almost optimal for expectation values and optimal for thermal expectation values in the sense of zero freeness.

关键词： Phase transitions quantum computation quantum-to-classical transition Approximation methods for many-body systems Combinatorics Computational complexity Ising model Lee-Yang & Fisher zeroes Series expansions & exact enumeration

来源：评论

学校读者我要写书评

暂无评论

Sample efficient identity testing and independence testing of quantum states 12

Sample efficient identity testing and independence testing o...

引用

12th Innovations in Theoretical Computer Science Conference, ITCS 2021

作者： Yu, Nengkun Centre for Quantum Software and Information Faculty of Engineering and Information Technology University of Technology Sydney Australia

ISBN: (纸本)9783959771771

In this paper, we study the quantum identity testing problem, i.e., testing whether two given quantum states are identical, and quantum independence testing problem, i.e., testing whether a given multipartite quantum state is in tensor product form. For the quantum identity testing problem of D(Cd) system, we provide a deterministic measurement scheme that uses O(dΕ22) copies via independent measurements with d being the dimension of the state and Ε being the additive error. For the independence testing problem D(Cd1 ⊗ Cd2 ⊗ · · · ⊗ Cdm) system, we show that the sample complexity is Θ(~ Πmi=1Ε2di) via collective measurements, and O(Πmi=1Ε2d2i) via independent measurements. If randomized choice of independent measurements are allowed, the sample complexity is Θ(d3Ε2/2) for the quantum identity testing problem, and Θ(~ Πmi=1Ε2d3 i/2) for the quantum independence testing problem. © Nengkun Yu.

关键词： quantum optics

来源：评论

学校读者我要写书评

暂无评论

Exact quantum Sensing Limits for Bosonic Dephasing Channels

引用

PRX quantum 2024年第2期5卷 020354-020354页

作者： Zixin Huang Ludovico Lami Mark M. Wilde School of Mathematical and Physical Sciences Centre for Quantum Software and Information Faculty of Engineering and Information Technology Science Park 123 Amsterdam 1098 XG the Netherlands Korteweg–de Vries Institute for Mathematics Institute for Theoretical Physics School of Electrical and Computer Engineering

Dephasing is a prominent noise mechanism that afflicts quantum information carriers, and it is one of the main challenges toward realizing useful quantum computation, communication, and sensing. Here, we consider discrimination and estimation of bosonic dephasing channels, when using the most general adaptive strategies allowed by quantum mechanics. We reduce these difficult quantum problems to simple classical ones based on the probability densities defining the bosonic dephasing channels. By doing so, we rigorously establish the optimal performance of various distinguishability and estimation tasks and construct explicit strategies to achieve this performance. To the best of our knowledge, this is the first example of a non-Gaussian bosonic channel for which there are exact solutions for these tasks.

关键词： Non-gaussian quantum states quantum channels quantum fluctuations & noise quantum information theory quantum parameter estimation quantum sensing

来源：评论

学校读者我要写书评

暂无评论

quantum Circuit Optimisation and MBQC Scheduling with a Pauli Tracking Library

arXiv

引用

arXiv 2024年

作者： Ruh, Jannis Devitt, Simon Centre for Quantum Software and Information School of Computer Science Faculty of Engineering & Information Technology University of Technology Sydney NSW2007 Australia InstituteQ Aalto University Espoo02150 Finland

We present a software library for the commutation of Pauli operators through quantum Clifford circuits, which is called Pauli tracking. Tracking Pauli operators allows one to reduce the number of Pauli gates that must be executed on quantum hardware. This is relevant for measurement-based quantum computing and for error-corrected circuits that are implemented through Clifford circuits. Furthermore, we investigate the problem of qubit scheduling in measurement-based quantum computing and how Pauli tracking can be used to capture the constraints on the order of measurements. Copyright © 2024, The Authors. All rights reserved.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

A Substrate Scheduler for Compiling Arbitrary Fault-Tolerant Graph States 4

A Substrate Scheduler for Compiling Arbitrary Fault-Tolerant...

引用

4th IEEE International Conference on quantum Computing and engineering, QCE 2023

作者： Liu, Sitong Benchasattabuse, Naphan Morgan, Darcy Q.C. Hajdušek, Michal Devitt, Simon J. Van Meter, Rodney Graduate School of Media and Governance Keio University Shonan Fujisawa Campus Kanagawa Japan Keio University Quantum Computing Center Kanagawa Japan University of Technology Sydney Centre for Quantum Software and Information SydneyNSW2007 Australia Keio University Shonan Fujisawa Campus Faculty of Environment and Information Studies Kanagawa Japan

ISBN: (纸本)9798350343236

Graph states are useful computational resources in quantum computing, particularly in measurement-based quantum computing models. However, compiling arbitrary graph states into executable form for fault-tolerant surface code execution and accurately estimating the compilation cost and the run-time resource cost remains an open problem. We introduce the Substrate Scheduler, a compiler module designed for fault-tolerant graph state compilation. The Substrate Scheduler aims to minimize the space-time volume cost of generating graph states. We show that Substrate Scheduler can efficiently compile graph states with thousands of vertices for 'A Game of Surface Codes'-style patch-based surface code systems. The results show that our module generates graph states with the lowest execution time complexity to date, achieving graph state generation time complexity that is at or below linear in the number of vertices and demonstrating specific types of graphs to have constant generation time complexity. Moreover, it provides a solid foundation for developing compilers that can handle a larger number of vertices, up to the millions or billions needed to accommodate a wide range of post-classical quantum computing applications. © 2023 IEEE.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：