Acta Informatica最新文献_第6页

Exact distributed quantum algorithm for generalized Simon’s problem 广义西蒙问题的精确分布式量子算法

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-03-10 DOI: 10.1007/s00236-024-00455-x

Hao Li, Daowen Qiu, Le Luo, Paulo Mateus

{"title":"Exact distributed quantum algorithm for generalized Simon’s problem","authors":"Hao Li, Daowen Qiu, Le Luo, Paulo Mateus","doi":"10.1007/s00236-024-00455-x","DOIUrl":"10.1007/s00236-024-00455-x","url":null,"abstract":"<div>Simon’s problem is one of the most important problems demonstrating the power of quantum algorithms, as it greatly inspired the proposal of Shor’s algorithm. The generalized Simon’s problem is a natural extension of Simon’s problem and also a special hidden subgroup problem: Given a function (f:{0,1}^n rightarrow {0,1}^m), it is promised that there exists a hidden subgroup (Sle mathbb {Z}_2^n) of rank k such that for any (x, yin {{0, 1}}^n), (f(x) = f(y)) iff (x oplus y in S). The goal of generalized Simon’s problem is to find the hidden subgroup S. In this paper, we present two key contributions. Firstly, we characterize the structure of the generalized Simon’s problem in distributed scenario and introduce a corresponding distributed quantum algorithm. Secondly, we refine the algorithm to ensure exactness due to the application of quantum amplitude amplification technique. Our algorithm offers exponential speedup compared to the distributed classical algorithm. When contrasted with the quantum algorithm for the generalized Simon’s problem, our algorithm’s oracle requires fewer qubits, thus making it easier to be physically implemented. Particularly, the exact distributed quantum algorithm we develop for the generalized Simon’s problem outperforms the best previously proposed distributed quantum algorithm for Simon’s problem in terms of generalizability and exactness.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 2","pages":"131 - 159"},"PeriodicalIF":0.4,"publicationDate":"2024-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140100125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

New families of Laplacian borderenergetic graphs 拉普拉斯边能图新族

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-02-26 DOI: 10.1007/s00236-024-00454-y

Cahit Dede

{"title":"New families of Laplacian borderenergetic graphs","authors":"Cahit Dede","doi":"10.1007/s00236-024-00454-y","DOIUrl":"10.1007/s00236-024-00454-y","url":null,"abstract":"<div>Laplacian matrix and its spectrum are commonly used for giving a measure in networks in order to analyse its topological properties. In this paper, Laplacian matrix of graphs and their spectrum are studied. Laplacian energy of a graph G of order n is defined as ( mathrm{{LE}}(G) = sum _{i=1}^n|lambda _i(L)-{bar{d}}|), where (lambda _i(L)) is the i-th eigenvalue of Laplacian matrix of G, and ({bar{d}}) is their average. If (mathrm{{LE}}(G) = mathrm{{LE}}(K_n)) for the complete graph (K_n) of order n, then G is known as L-borderenergetic graph. In the first part of this paper, we construct three infinite families of non-complete disconnected L-borderenergetic graphs: (Lambda _1 = { G_{b,j,k} = [(((j-2)k-2j+2)b+1)K_{(j-1)k-(j-2)}] cup b(K_j times K_k)| b,j,k in {{mathbb {Z}}}^+}), ( Lambda _2 = {G_{2,b} = [K_6 nabla b(K_2 times K_3)] cup (4b-2)K_9 | bin {{mathbb {Z}}}^+ }), ( Lambda _3 = {G_{3,b} = [bK_8 nabla b(K_2 times K_4)] cup (14b-4)K_{8b+6} | bin {{mathbb {Z}}}^+ }), where (nabla ) is join operator and (times ) is direct product operator on graphs. Then, in the second part of this work, we construct new infinite families of non-complete connected L-borderenergetic graphs (Omega _1= {K_2 nabla overline{aK_2^r} vert ain {{mathbb {Z}}}^+}), (Omega _2 = {overline{aK_3 cup 2(K_2times K_3)}vert ain {{mathbb {Z}}}^+ }) and (Omega _3 = {overline{aK_5 cup (K_3times K_3)}vert ain {{mathbb {Z}}}^+ }), where ({overline{G}}) is the complement operator on G.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 2","pages":"115 - 129"},"PeriodicalIF":0.4,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140006220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Approximating subset sum ratio via partition computations 通过分区计算逼近子集和比率

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2024-01-12 DOI: 10.1007/s00236-023-00451-7

Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis

引用次数: 0

Neighborhood mutual remainder: self-stabilizing distributed implementation and applications 邻域互余：自稳定分布式实现与应用

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2023-12-18 DOI: 10.1007/s00236-023-00450-8

Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada

{"title":"Neighborhood mutual remainder: self-stabilizing distributed implementation and applications","authors":"Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada","doi":"10.1007/s00236-023-00450-8","DOIUrl":"10.1007/s00236-023-00450-8","url":null,"abstract":"<div>Motivated by the need to convert move-atomic assumption in LOOK-COMPUTE-MOVE (LCM) robot algorithms to be implemented in existing distributed systems, we define a new distributed fundamental task, the neighborhood mutual remainder (NMR). Consider a situation where each process has a set of operations (O_p) and executes each operation in (O_p) infinitely often in distributed systems. Then, let (O_esubset O_p) be a subset of operations, which a process cannot execute, while its closed neighborhood executes operations in (O_psetminus O_e). The NMR is defined for such a situation. A distributed algorithm that satisfies the NMR requirement should satisfy the following two properties: (1) Liveness is satisfied if a process executes each operation in (O_p) infinitely often and (2) safety is satisfied if, when each process executes operations in (O_e), no process in its closed neighborhood executes operations in (O_psetminus O_e). We formalize the concept of NMR and give a simple self-stabilizing algorithm using the pigeon-hole principle to demonstrate the design paradigm to achieve NMR. A self-stabilizing algorithm tolerates transient faults (e.g., message loss, memory corruption, etc.) by its ability to converge from an arbitrary configuration to the legitimate one. In addition, we present an application of NMR to an LCM robot system for implementing a move-atomic property, where robots possess an independent clock that is advanced at the same speed. It is the first self-stabilizing implementation of the LCM synchronization for environments where each robot can have limited visibility and lights.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 1","pages":"83 - 100"},"PeriodicalIF":0.4,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138745976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

n-PS-codes, 2-infix-outfix codes and some related classes of codes n-PS 码、2-后缀码和一些相关的码类

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2023-12-15 DOI: 10.1007/s00236-023-00449-1

Haiyan Liu, Rongdong Cui, Tianjie Zhang

引用次数: 0

Balancing m-ary search trees with compressions on the fringe 用边缘压缩平衡 mary 搜索树

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2023-12-15 DOI: 10.1007/s00236-023-00448-2

Shuyang Gao, Leen Hatem, Hosam Mahmoud

引用次数: 0

Editorial 2023: changes and invariants 编辑2023:变化与不变

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2023-11-03 DOI: 10.1007/s00236-023-00447-3

Henning Fernau

引用次数: 0

A decision procedure for string constraints with string/integer conversion and flat regular constraints 带字符串/整数转换和平面正则约束的字符串约束决策程序

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2023-10-24 DOI: 10.1007/s00236-023-00446-4

Hao Wu, Yu-Fang Chen, Zhilin Wu, Bican Xia, Naijun Zhan

{"title":"A decision procedure for string constraints with string/integer conversion and flat regular constraints","authors":"Hao Wu, Yu-Fang Chen, Zhilin Wu, Bican Xia, Naijun Zhan","doi":"10.1007/s00236-023-00446-4","DOIUrl":"10.1007/s00236-023-00446-4","url":null,"abstract":"<div>String constraint solving is the core of various testing and verification approaches for scripting languages. Among algorithms for solving string constraints, flattening is a well-known approach that is particularly useful in handling satisfiable instances. As string/integer conversion is an important function appearing in almost all scripting languages, Abdulla et al. extended the flattening approach to this function recently. However, their approach supports only a special flattening pattern and leaves the support of the general flat regular constraints as an open problem. In this paper, we fill the gap by proposing a complete flattening approach for the string/integer conversion. The approach is built upon a new quantifier elimination procedure for the linear-exponential arithmetic (namely, the extension of Presburger arithmetic with exponential functions, denoted by ExpPA) improved from the one proposed by Cherlin and Point in 1986. We analyze the complexity of our quantifier elimination procedure and show that the decision problem for existential ExpPA formulas is in 3-EXPTIME. Up to our knowledge, this is the first elementary complexity upper bound for this problem. While the quantifier elimination procedure is too expensive to be implemented efficiently, we propose various optimizations and provide a prototypical implementation. We evaluate the performance of our implementation on the benchmarks that are generated from the string hash functions as well as randomly. The experimental results show that our implementation outperforms the state-of-the-art solvers.</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 1","pages":"23 - 52"},"PeriodicalIF":0.4,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135268450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Discovering workflow nets of concurrent iterative processes 发现并发迭代过程的工作流网络

IF 0.4 4区计算机科学

Acta Informatica Pub Date : 2023-09-14 DOI: 10.1007/s00236-023-00445-5

Tonatiuh Tapia-Flores, Ernesto López-Mellado

引用次数: 0

The second step in characterizing a three-word code 描述三字代码的第二步

IF 0.6 4区计算机科学

Acta Informatica Pub Date : 2023-09-08 DOI: 10.1007/s00236-023-00444-6

Chunhua Cao, Jiao Xu, Lei Liao, Di Yang, Guichuan Jia, Qian Du

引用次数: 0