Quantum pattern matching oracle construction
Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exa...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Menon, Vikram [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2021 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Indian Academy of Sciences 2021 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Pramāna - Springer India, 1973, 95(2021), 1 vom: 06. Feb. |
|---|---|
| Übergeordnetes Werk: |
volume:95 ; year:2021 ; number:1 ; day:06 ; month:02 |
| Links: |
|---|
| DOI / URN: |
10.1007/s12043-020-02062-0 |
|---|
| Katalog-ID: |
OLC2123353477 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2123353477 | ||
| 003 | DE-627 | ||
| 005 | 20230505101529.0 | ||
| 007 | tu | ||
| 008 | 230505s2021 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s12043-020-02062-0 |2 doi | |
| 035 | |a (DE-627)OLC2123353477 | ||
| 035 | |a (DE-He213)s12043-020-02062-0-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 530 |q VZ |
| 100 | 1 | |a Menon, Vikram |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Quantum pattern matching oracle construction |
| 264 | 1 | |c 2021 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Indian Academy of Sciences 2021 | ||
| 520 | |a Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome. | ||
| 650 | 4 | |a Pattern matching | |
| 650 | 4 | |a quantum search | |
| 650 | 4 | |a quantum pattern matching | |
| 700 | 1 | |a Chattopadhyay, Ayan |0 (orcid)0000-0001-7279-8873 |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Pramāna |d Springer India, 1973 |g 95(2021), 1 vom: 06. Feb. |w (DE-627)129403342 |w (DE-600)186949-8 |w (DE-576)014785102 |x 0304-4289 |7 nnns |
| 773 | 1 | 8 | |g volume:95 |g year:2021 |g number:1 |g day:06 |g month:02 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s12043-020-02062-0 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-PHY | ||
| 912 | |a GBV_ILN_70 | ||
| 951 | |a AR | ||
| 952 | |d 95 |j 2021 |e 1 |b 06 |c 02 | ||
| author_variant |
v m vm a c ac |
|---|---|
| matchkey_str |
article:03044289:2021----::unuptenacigrceo |
| hierarchy_sort_str |
2021 |
| publishDate |
2021 |
| allfields |
10.1007/s12043-020-02062-0 doi (DE-627)OLC2123353477 (DE-He213)s12043-020-02062-0-p DE-627 ger DE-627 rakwb eng 530 VZ Menon, Vikram verfasserin aut Quantum pattern matching oracle construction 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Indian Academy of Sciences 2021 Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome. Pattern matching quantum search quantum pattern matching Chattopadhyay, Ayan (orcid)0000-0001-7279-8873 aut Enthalten in Pramāna Springer India, 1973 95(2021), 1 vom: 06. Feb. (DE-627)129403342 (DE-600)186949-8 (DE-576)014785102 0304-4289 nnns volume:95 year:2021 number:1 day:06 month:02 https://doi.org/10.1007/s12043-020-02062-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_70 AR 95 2021 1 06 02 |
| spelling |
10.1007/s12043-020-02062-0 doi (DE-627)OLC2123353477 (DE-He213)s12043-020-02062-0-p DE-627 ger DE-627 rakwb eng 530 VZ Menon, Vikram verfasserin aut Quantum pattern matching oracle construction 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Indian Academy of Sciences 2021 Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome. Pattern matching quantum search quantum pattern matching Chattopadhyay, Ayan (orcid)0000-0001-7279-8873 aut Enthalten in Pramāna Springer India, 1973 95(2021), 1 vom: 06. Feb. (DE-627)129403342 (DE-600)186949-8 (DE-576)014785102 0304-4289 nnns volume:95 year:2021 number:1 day:06 month:02 https://doi.org/10.1007/s12043-020-02062-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_70 AR 95 2021 1 06 02 |
| allfields_unstemmed |
10.1007/s12043-020-02062-0 doi (DE-627)OLC2123353477 (DE-He213)s12043-020-02062-0-p DE-627 ger DE-627 rakwb eng 530 VZ Menon, Vikram verfasserin aut Quantum pattern matching oracle construction 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Indian Academy of Sciences 2021 Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome. Pattern matching quantum search quantum pattern matching Chattopadhyay, Ayan (orcid)0000-0001-7279-8873 aut Enthalten in Pramāna Springer India, 1973 95(2021), 1 vom: 06. Feb. (DE-627)129403342 (DE-600)186949-8 (DE-576)014785102 0304-4289 nnns volume:95 year:2021 number:1 day:06 month:02 https://doi.org/10.1007/s12043-020-02062-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_70 AR 95 2021 1 06 02 |
| allfieldsGer |
10.1007/s12043-020-02062-0 doi (DE-627)OLC2123353477 (DE-He213)s12043-020-02062-0-p DE-627 ger DE-627 rakwb eng 530 VZ Menon, Vikram verfasserin aut Quantum pattern matching oracle construction 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Indian Academy of Sciences 2021 Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome. Pattern matching quantum search quantum pattern matching Chattopadhyay, Ayan (orcid)0000-0001-7279-8873 aut Enthalten in Pramāna Springer India, 1973 95(2021), 1 vom: 06. Feb. (DE-627)129403342 (DE-600)186949-8 (DE-576)014785102 0304-4289 nnns volume:95 year:2021 number:1 day:06 month:02 https://doi.org/10.1007/s12043-020-02062-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_70 AR 95 2021 1 06 02 |
| allfieldsSound |
10.1007/s12043-020-02062-0 doi (DE-627)OLC2123353477 (DE-He213)s12043-020-02062-0-p DE-627 ger DE-627 rakwb eng 530 VZ Menon, Vikram verfasserin aut Quantum pattern matching oracle construction 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Indian Academy of Sciences 2021 Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome. Pattern matching quantum search quantum pattern matching Chattopadhyay, Ayan (orcid)0000-0001-7279-8873 aut Enthalten in Pramāna Springer India, 1973 95(2021), 1 vom: 06. Feb. (DE-627)129403342 (DE-600)186949-8 (DE-576)014785102 0304-4289 nnns volume:95 year:2021 number:1 day:06 month:02 https://doi.org/10.1007/s12043-020-02062-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_70 AR 95 2021 1 06 02 |
| language |
English |
| source |
Enthalten in Pramāna 95(2021), 1 vom: 06. Feb. volume:95 year:2021 number:1 day:06 month:02 |
| sourceStr |
Enthalten in Pramāna 95(2021), 1 vom: 06. Feb. volume:95 year:2021 number:1 day:06 month:02 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Pattern matching quantum search quantum pattern matching |
| dewey-raw |
530 |
| isfreeaccess_bool |
false |
| container_title |
Pramāna |
| authorswithroles_txt_mv |
Menon, Vikram @@aut@@ Chattopadhyay, Ayan @@aut@@ |
| publishDateDaySort_date |
2021-02-06T00:00:00Z |
| hierarchy_top_id |
129403342 |
| dewey-sort |
3530 |
| id |
OLC2123353477 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2123353477</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505101529.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230505s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s12043-020-02062-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2123353477</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s12043-020-02062-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">530</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Menon, Vikram</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Quantum pattern matching oracle construction</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Indian Academy of Sciences 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pattern matching</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">quantum search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">quantum pattern matching</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chattopadhyay, Ayan</subfield><subfield code="0">(orcid)0000-0001-7279-8873</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Pramāna</subfield><subfield code="d">Springer India, 1973</subfield><subfield code="g">95(2021), 1 vom: 06. Feb.</subfield><subfield code="w">(DE-627)129403342</subfield><subfield code="w">(DE-600)186949-8</subfield><subfield code="w">(DE-576)014785102</subfield><subfield code="x">0304-4289</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:95</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:1</subfield><subfield code="g">day:06</subfield><subfield code="g">month:02</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s12043-020-02062-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">95</subfield><subfield code="j">2021</subfield><subfield code="e">1</subfield><subfield code="b">06</subfield><subfield code="c">02</subfield></datafield></record></collection>
|
| author |
Menon, Vikram |
| spellingShingle |
Menon, Vikram ddc 530 misc Pattern matching misc quantum search misc quantum pattern matching Quantum pattern matching oracle construction |
| authorStr |
Menon, Vikram |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129403342 |
| format |
Article |
| dewey-ones |
530 - Physics |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0304-4289 |
| topic_title |
530 VZ Quantum pattern matching oracle construction Pattern matching quantum search quantum pattern matching |
| topic |
ddc 530 misc Pattern matching misc quantum search misc quantum pattern matching |
| topic_unstemmed |
ddc 530 misc Pattern matching misc quantum search misc quantum pattern matching |
| topic_browse |
ddc 530 misc Pattern matching misc quantum search misc quantum pattern matching |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Pramāna |
| hierarchy_parent_id |
129403342 |
| dewey-tens |
530 - Physics |
| hierarchy_top_title |
Pramāna |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129403342 (DE-600)186949-8 (DE-576)014785102 |
| title |
Quantum pattern matching oracle construction |
| ctrlnum |
(DE-627)OLC2123353477 (DE-He213)s12043-020-02062-0-p |
| title_full |
Quantum pattern matching oracle construction |
| author_sort |
Menon, Vikram |
| journal |
Pramāna |
| journalStr |
Pramāna |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2021 |
| contenttype_str_mv |
txt |
| author_browse |
Menon, Vikram Chattopadhyay, Ayan |
| container_volume |
95 |
| class |
530 VZ |
| format_se |
Aufsätze |
| author-letter |
Menon, Vikram |
| doi_str_mv |
10.1007/s12043-020-02062-0 |
| normlink |
(ORCID)0000-0001-7279-8873 |
| normlink_prefix_str_mv |
(orcid)0000-0001-7279-8873 |
| dewey-full |
530 |
| title_sort |
quantum pattern matching oracle construction |
| title_auth |
Quantum pattern matching oracle construction |
| abstract |
Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome. © Indian Academy of Sciences 2021 |
| abstractGer |
Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome. © Indian Academy of Sciences 2021 |
| abstract_unstemmed |
Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome. © Indian Academy of Sciences 2021 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-PHY GBV_ILN_70 |
| container_issue |
1 |
| title_short |
Quantum pattern matching oracle construction |
| url |
https://doi.org/10.1007/s12043-020-02062-0 |
| remote_bool |
false |
| author2 |
Chattopadhyay, Ayan |
| author2Str |
Chattopadhyay, Ayan |
| ppnlink |
129403342 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s12043-020-02062-0 |
| up_date |
2024-07-03T17:46:41.540Z |
| _version_ |
1803580920608849920 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2123353477</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505101529.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230505s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s12043-020-02062-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2123353477</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s12043-020-02062-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">530</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Menon, Vikram</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Quantum pattern matching oracle construction</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Indian Academy of Sciences 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pattern matching</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">quantum search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">quantum pattern matching</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chattopadhyay, Ayan</subfield><subfield code="0">(orcid)0000-0001-7279-8873</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Pramāna</subfield><subfield code="d">Springer India, 1973</subfield><subfield code="g">95(2021), 1 vom: 06. Feb.</subfield><subfield code="w">(DE-627)129403342</subfield><subfield code="w">(DE-600)186949-8</subfield><subfield code="w">(DE-576)014785102</subfield><subfield code="x">0304-4289</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:95</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:1</subfield><subfield code="g">day:06</subfield><subfield code="g">month:02</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s12043-020-02062-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">95</subfield><subfield code="j">2021</subfield><subfield code="e">1</subfield><subfield code="b">06</subfield><subfield code="c">02</subfield></datafield></record></collection>
|
| score |
7.400464 |