Quantum Property Testing Algorithm for the Concatenation of Two Palindromes Language

被引：0
|
作者：
Khadiev, Kamil [1 ]
Serov, Danil [1 ]
机构：
[1] Kazan Fed Univ, Inst Computat Math & Informat Technol, Kazan, Russia
来源：
UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION, UCNC 2024 | 2024年 / 14776卷
关键词：
palindromes; property testing; strings; quantum algorithms; query complexity; context-free languages; NUMBER;
D O I：
10.1007/978-3-031-63742-1_10
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we present a quantum property testing algorithm for recognizing a context-free language that is a concatenation of two palindromes L-REV. The query complexity of our algorithm is O(1/epsilon(n1/3) log n), where n is the length of an input. It is better than the classical complexity that is theta* (root n). At the same time, in the general setting, the picture is different a little. Classical query complexity is theta(n), and quantum query complexity is theta* (root n). So, we obtain polynomial speed-up for both cases (general and property testing).
引用
收藏
页码：134 / 147
页数：14
相关论文
共 50 条
  • [1] Quantum property testing
    Buhrman, Harry
    Fortnow, Lance
    Newman, Ilan
    Roehrig, Hein
    SIAM JOURNAL ON COMPUTING, 2008, 37 (05) : 1387 - 1400
  • [2] Quantum property testing
    Buhrman, H
    Fortnow, L
    Newman, I
    Röhrig, H
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 480 - 488
  • [3] Quantum Property Testing of Group Solvability
    Yoshifumi Inui
    François Le Gall
    Algorithmica, 2011, 59 : 35 - 47
  • [4] New Results on Quantum Property Testing
    Chakraborty, Sourav
    Fischer, Eldar
    Matsliah, Arie
    de Wolf, Ronald
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 145 - 156
  • [5] Quantum Property Testing of Group Solvability
    Inui, Yoshifumi
    Le Gall, Francois
    ALGORITHMICA, 2011, 59 (01) : 35 - 47
  • [6] Quantum property testing of group solvability
    Inui, Yoshifumi
    Le Gall, Francois
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 772 - +
  • [7] Entanglement is Necessary for Optimal Quantum Property Testing
    Bubeck, Sebastien
    Chen, Sitan
    Li, Jerry
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 692 - 703
  • [8] Quantum Algorithm to Identify Division Property of a Multiset
    Ashwini Kumar Malviya
    Namita Tiwari
    Arabian Journal for Science and Engineering, 2021, 46 : 8711 - 8719
  • [9] Quantum Algorithm to Identify Division Property of a Multiset
    Malviya, Ashwini Kumar
    Tiwari, Namita
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2021, 46 (09) : 8711 - 8719
  • [10] Recognition property of quantum character recognition algorithm
    Matoba, Osamu
    Murata, Takuya
    Nitta, Kouichi
    Yoshimura, Takeaki
    2006 IEEE LEOS ANNUAL MEETING CONFERENCE PROCEEDINGS, VOLS 1 AND 2, 2006, : 350 - +
12345