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

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

来源：评论

学校读者我要写书评

暂无评论

Security analysis of satellite-to-ground reference-frame-independent quantum key distribution with beam wandering

引用

Chinese Physics B 2024年第8期33卷 192-201页

作者：周淳赵燕美杨晓亮陆宜飞周雨姜晓磊汪海涛汪洋李家骥江木生汪翔张海龙李宏伟鲍皖苏 Henan Key Laboratory of Quantum Information and Cryptography SSF IEUZhengzhou 450001China Synergetic Innovation Centre of Quantum Information and Quantum Physics University of Science and Technology of ChinaHefei 230026China

The reference-frame-independent(RFI)quantum key distribution(QKD)is suitable for satellite-based links by removing the active alignment on the reference ***,how the beam wandering influences the performance of RFI-QKD remains a pending issue in satellite-to-ground *** this paper,based on the mathematical model for characterizing beam wandering,we present the security analysis for satellite-to-ground RFI-QKD and analytically derive formulas for calculating the secret key rate with beam *** simulation results show that the performance of RFI-QKD is better than the Bennett–Brassard 1984(BB84)QKD with beam wandering in asymptotic ***,the degree of influences of beam wandering is specifically presented for satellite-to-ground RFI-QKD when statistical fluctuations are taken into *** work can provide theoretical support for the realization of RFI-QKD using satellite-to-ground links and have implications for the construction of large-scale satellite-based quantum networks.

关键词： quantum key distribution satellite-to-ground beam wandering

来源：评论

学校读者我要写书评

暂无评论

Effect of weak randomness flaws on security evaluation of practical quantum key distribution with distinguishable decoy states

引用

Chinese Physics B 2023年第5期32卷 254-260页

作者：周雨李宏伟周淳汪洋陆宜飞江木生张晓旭鲍皖苏 Henan Key Laboratory of Quantum Information and Cryptography SSF IEUZhengzhou 450001China Synergetic Innovation Centre of Quantum Information and Quantum Physics University of Science and Technology of ChinaHefei 230026China

quantum key distribution provides an unconditional secure key sharing method in theory,but the imperfect factors of practical devices will bring security *** this paper,we characterize the imperfections of the sender and analyze the possible attack strategies of ***,we present a quantized model for distinguishability of decoy states caused by intensity ***,considering that Eve may control the preparation of states through hidden variables,we evaluate the security of preparation in practical quantum key distribution(QKD)scheme based on the weak-randomness ***,we analyze the influence of the distinguishability of decoy state to secure key rate,for Eve may conduct the beam splitting attack and control the channel attenuation of different *** the simulation,it can be seen that the secure key rate is sensitive to the distinguishability of decoy state and weak randomness,especially when Eve can control the channel attenuation.

关键词： weak randomness quantum key distribution distinguishable decoy state

来源：评论

学校读者我要写书评

暂无评论

Time-Efficient quantum Entropy Estimator via Samplizer 32

Time-Efficient Quantum Entropy Estimator via Samplizer

引用

32nd Annual European Symposium on Algorithms, ESA 2024

作者： Wang, Qisheng Zhang, Zhicheng Graduate School of Mathematics Nagoya University Japan Centre for Quantum Software and Information University of Technology Sydney Ultimo Australia

ISBN: (纸本)9783959773386

Entropy is a measure of the randomness of a system. Estimating the entropy of a quantum state is a basic problem in quantum information. In this paper, we introduce a time-efficient quantum approach to estimating the von Neumann entropy S(ρ) and Rényi entropy Sα(ρ) of an N-dimensional quantum state ρ, given access to independent samples of ρ. Specifically, we provide the following quantum estimators. A quantum estimator for S(ρ) with time complexity Oe(N2),1 improving the prior best time complexity Oe(N6) by Acharya, Issa, Shende, and Wagner (2020) and Bavarian, Mehraba, and Wright (2016). A quantum estimator for Sα(ρ) with time complexity Oe(N4/α−2) for 0 e(N4−2/α) for α > 1, improving the prior best time complexity Oe(N6/α) for 0 e(N6) for α > 1 by Acharya, Issa, Shende, and Wagner (2020), though at a cost of a slightly larger sample complexity. Moreover, these estimators are naturally extensible to the low-rank case. We also provide a sample lower bound Ω(max{N/Ε, N1/α−1/Ε1/α}) for estimating Sα(ρ). Technically, our method is quite different from the previous ones that are based on weak Schur sampling and Young diagrams. At the heart of our construction, is a novel tool called samplizer, which can "samplize" a quantum query algorithm to a quantum algorithm with similar behavior using only samples of quantum states;this suggests a unified framework for estimating quantum entropies. Specifically, when a quantum oracle U block-encodes a mixed quantum state ρ, any quantum query algorithm using Q queries to U can be samplized to a δ-close (in the diamond norm) quantum algorithm using Θ(e Q2/δ) samples of ρ. Moreover, this samplization is proven to be optimal, up to a polylogarithmic factor. © Qisheng Wang and Zhicheng Zhang;licensed under Creative Commons License CC-BY 4.0.

关键词： quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Image Computation for quantum Transition Systems

Image Computation for Quantum Transition Systems

引用

2025 Design, Automation and Test in Europe Conference, DATE 2025

作者： Hong, Xin Gao, Dingchao Li, Sanjiang Ying, Shenggang Ying, Mingsheng State Key Laboratory of Computer Science Beijing China University of Technology Sydney Centre for Quantum Software and Information Sydney Australia

ISBN: (纸本)9783982674100

With the rapid progress in quantum hardware and software, the need for verification of quantum systems becomes increasingly crucial. While model checking is a dominant and very successful technique for verifying classical systems, its application to quantum systems is still an underdeveloped research area. This paper advances the development of model checking quantum systems by providing efficient image computation algorithms for quantum transition systems, which play a fundamental role in model checking. In our approach, we represent quantum circuits as tensor networks and design algorithms by leveraging the properties of tensor networks and tensor decision diagrams. Our experiments demonstrate that our contraction partition-based algorithm can greatly improve the efficiency of image computation for quantum transition systems. © 2025 EDAA.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Phase-matching quantum key distribution with imperfect sources

引用

Chinese Physics B 2023年第5期32卷 288-296页

作者：张晓旭陆宜飞汪洋江木生李宏伟周淳周雨鲍皖苏 Henan Key Laboratory of Quantum Information and Cryptography SSF IEUZhengzhou 450001China Synergetic Innovation Centre of Quantum Information and Quantum Physics University of Science and Technology of ChinaHefei 230026China Basic Department SSF IEUZhengzhou 450001China

The huge discrepancies between actual devices and theoretical assumptions severely threaten the security of quantum key ***,a general new framework called the reference technique has attracted wide attention in defending against the imperfect sources of quantum key ***,the state preparation flaws,the side channels of mode dependencies,the Trojan horse attacks,and the pulse classical correlations are studied by using the reference technique on the phase-matching *** simulation results highlight the importance of the actual secure parameters choice for transmitters,which is necessary to achieve secure *** the single actual secure parameter will reduce the secure key ***,as long as the parameters are set properly,the secure key rate is still *** the influences of multiple actual secure parameters will significantly reduce the secure key *** actual secure parameters must be considered when scientists calibrate *** work is an important step towards the practical and secure implementation of phase-matching *** the future,it is essential to study the main parameters,find out their maximum and general values,classify the multiple parameters as the same parameter,and give countermeasures.

关键词： quantum key distribution reference technique imperfect sources phase-matching

来源：评论

学校读者我要写书评

暂无评论

Qualitative and Quantitative Model Checking Against Recurrent Neural Networks

引用

Journal of Computer Science & technology 2024年第6期39卷 1292-1311页

作者： Zhen Liang Wan-Wei Liu Fu Song Bai Xue Wen-Jing Yang Ji Wang Zheng-Bin Pang Institute for Quantum Information&State Key Laboratory of High Performance Computing College of Computer Science and TechnologyNational University of Defense TechnologyChangsha 410073China College of Computer Science and Technology National University of Defense TechnologyChangsha 410073China School of Information Science and Technology ShanghaiTech UniversityShanghai 201210China Institute of Software Chinese Academy of SciencesBeijing 100190China

Recurrent neural networks (RNNs) have been heavily used in applications relying on sequence data such as time series and natural languages. As a matter of fact, their behaviors lack rigorous quality assurance due to the black-box nature of deep learning. It is an urgent and challenging task to formally reason about the behaviors of RNNs. To this end, we first present an extension of linear-time temporal logic to reason about properties with respect to RNNs, such as local robustness, reachability, and some temporal properties. Based on the proposed logic, we formalize the verification obligation as a Hoare-like triple, from both qualitative and quantitative perspectives. The former concerns whether all the outputs resulting from the inputs fulfilling the pre-condition satisfy the post-condition, whereas the latter is to compute the probability that the post-condition is satisfied on the premise that the inputs fulfill the pre-condition. To tackle these problems, we develop a systematic verification framework, mainly based on polyhedron propagation, dimension-preserving abstraction, and the Monte Carlo sampling. We also implement our algorithm with a prototype tool and conduct experiments to demonstrate its feasibility and efficiency.

关键词： recurrent neural network model checking temporal logic qualitative/quantitative verification

来源：评论

学校读者我要写书评

暂无评论

Classifying extended,localized and critical states in quasiperiodic lattices via unsupervised learning

引用

Chinese Physics B 2025年第1期34卷 422-427页

作者： Bohan Zheng Siyu Zhu Xingping Zhou Tong Liu School of Computer Science and Technology School of SoftwareNanjing University of Posts and TelecommunicationsNanjing 210023China Institute of Quantum Information and Technology Nanjing University of Posts and TelecommunicationsNanjing 210003China Department of Applied Physics School of ScienceNanjing University of Posts and TelecommunicationsNanjing 210003China

Classification of quantum phases is one of the most important areas of research in condensed matter *** this work,we obtain the phase diagram of one-dimensional quasiperiodic models via unsupervised ***,we choose two advanced unsupervised learning algorithms,namely,density-based spatial clustering of applications with noise(DBSCAN)and ordering points to identify the clustering structure(OPTICS),to explore the distinct phases of the Aubry–André–Harper model and the quasiperiodic p-wave *** unsupervised learning results match well with those obtained through traditional numerical ***,we assess similarity across different algorithms and find that the highest degree of similarity between the results of unsupervised learning algorithms and those of traditional algorithms exceeds 98%.Our work sheds light on applications of unsupervised learning for phase classification.

关键词： quantum phase quasiperiodic machine learning

来源：评论

学校读者我要写书评

暂无评论

On the Trainability and Classical Simulability of Learning Matrix Product States Variationally 39

On the Trainability and Classical Simulability of Learning M...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Basheer, Afrad Feng, Yuan Ferrie, Christopher Li, Sanjiang Pashayan, Hakop Centre for Quantum Software and Information University of Technology SydneyNSW2007 Australia Department of Computer Science and Technology Tsinghua University Beijing100084 China Dahlem Center for Complex Quantum Systems Freie Universität Berlin 14195 Germany

ISBN: (纸本)157735897X

We prove that using global observables to train the matrix product state ansatz results in the vanishing of all partial derivatives, also known as barren plateaus, while using local observables avoids this. This ansatz is widely used in quantum machine learning for learning weakly entangled state approximations. Additionally, we empirically demonstrate that in many cases, the objective function is an inner product of almost sparse operators, highlighting the potential for classically simulating such a learning problem with few quantum resources. All our results are experimentally validated across various scenarios. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：