arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2411.19906quant-phcs.CLcs.DScs.FLcs.LG
收藏

基于图的经典与量子方法用于确定性L-系统推断

A Graph-Based Classical and Quantum Approach to Deterministic L-System Inference

Department of Computer Science, University of Saskatchewan(计算机科学系,萨斯喀彻温大学);Centre for Quantum Topology(量子拓扑中心);Statistics, University of Saskatchewan(统计学系,萨斯喀彻温大学)

Ali Lotfi, Ian McQuillan, Steven Rayan

AI总结:

本文提出利用字符串序列的特征图,将确定性上下文无关L-系统(D0L-系统)推断问题在多项式时间内转化为最大独立集问题和SAT问题,并分别给出经典精确算法与近似量子算法,从而实现从数据中自动推断L-系统。

摘要:

L-系统可用于建模和创建许多生物过程的模拟,例如植物发育。为给定过程寻找一个L-系统通常由专家手工完成,这是一个极其耗时的过程。如果能够从数据(例如图像序列)中自动完成这一工作,将具有重要意义。在本文中,我们关注从字符串序列中推断一种特定类型的L-系统,即确定性上下文无关L-系统(D0L-系统)。我们引入字符串序列的特征图,然后利用该特征图在多项式时间内将我们的问题(推断D0L-系统)转化为最大独立集问题(MIS)和SAT问题。此后,我们为该问题提供了一个经典精确算法和一个近似量子算法。

英文摘要:

L-systems can be made to model and create simulations of many biological processes, such as plant development. Finding an L-system for a given process is typically solved by hand, by experts, in a massively time-consuming process. It would be significant if this could be done automatically from data, such as from sequences of images. In this paper, we are interested in inferring a particular type of L-system, deterministic context-free L-system (D0L-system) from a sequence of strings. We introduce the characteristic graph of a sequence of strings, which we then utilize to translate our problem (inferring D0L-systems) in polynomial time into the maximum independent set problem (MIS) and the SAT problem. After that, we offer a classical exact algorithm and an approximate quantum algorithm for the problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑