Quantum search with modular variables

Quantum search with modular variables

We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {\bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by manipulating quantum two--level systems, qubits. We show that this g...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ketterer, A, Douce, T, Keller, A, Coudreau, T, Milman, P
Format: Artikel
Sprache:eng
Schlagworte:
Physics - Quantum Physics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Ketterer, A
Douce, T
Keller, A
Coudreau, T
Milman, P
description We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {\bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by manipulating quantum two--level systems, qubits. We show that this gain, already known to be optimal, is preserved, irrespectively of the dimension of the system used to encode quantum information. This is shown by adapting the protocol to Hilbert spaces of any dimension using the same sequence of operations/logical gates as its original qubit formulation. Our results are detailed and illustrated for a system described by continuous variables, where qubits can be encoded in infinitely many distinct states using the modular variable formalism.
doi_str_mv 10.48550/arxiv.1407.1298
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1407_1298</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1407_1298</sourcerecordid><originalsourceid>FETCH-LOGICAL-a658-cd8153fdfb3545575cff2495833b78ea4420700735a6f6689ac721071bd669b33</originalsourceid><addsrcrecordid>eNotzjsLwjAUQOEsDlLdnaSLY2teN0lHEV8giNC93LQNLbQqaevj34uP6WyHj5AZo7E0AHSJ_lnfYyapjhlPzJgszgNe-qENuxJ9XoWPuq_C9loMDfrwjr5G25TdhIwcNl05_Tcg6XaTrvfR8bQ7rFfHCBWYKC8MA-EKZwVIAA25c1wmYISw2pQoJaeaUi0AlVPKJJhrzqhmtlAqsUIEZP7bfpnZzdct-lf24WYfrngDmvw4uA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Quantum search with modular variables</title><source>arXiv.org</source><creator>Ketterer, A ; Douce, T ; Keller, A ; Coudreau, T ; Milman, P</creator><creatorcontrib>Ketterer, A ; Douce, T ; Keller, A ; Coudreau, T ; Milman, P</creatorcontrib><description>We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {\bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by manipulating quantum two--level systems, qubits. We show that this gain, already known to be optimal, is preserved, irrespectively of the dimension of the system used to encode quantum information. This is shown by adapting the protocol to Hilbert spaces of any dimension using the same sequence of operations/logical gates as its original qubit formulation. Our results are detailed and illustrated for a system described by continuous variables, where qubits can be encoded in infinitely many distinct states using the modular variable formalism.</description><identifier>DOI: 10.48550/arxiv.1407.1298</identifier><language>eng</language><subject>Physics - Quantum Physics</subject><creationdate>2014-07</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1407.1298$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1407.1298$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Ketterer, A</creatorcontrib><creatorcontrib>Douce, T</creatorcontrib><creatorcontrib>Keller, A</creatorcontrib><creatorcontrib>Coudreau, T</creatorcontrib><creatorcontrib>Milman, P</creatorcontrib><title>Quantum search with modular variables</title><description>We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {\bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by manipulating quantum two--level systems, qubits. We show that this gain, already known to be optimal, is preserved, irrespectively of the dimension of the system used to encode quantum information. This is shown by adapting the protocol to Hilbert spaces of any dimension using the same sequence of operations/logical gates as its original qubit formulation. Our results are detailed and illustrated for a system described by continuous variables, where qubits can be encoded in infinitely many distinct states using the modular variable formalism.</description><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzjsLwjAUQOEsDlLdnaSLY2teN0lHEV8giNC93LQNLbQqaevj34uP6WyHj5AZo7E0AHSJ_lnfYyapjhlPzJgszgNe-qENuxJ9XoWPuq_C9loMDfrwjr5G25TdhIwcNl05_Tcg6XaTrvfR8bQ7rFfHCBWYKC8MA-EKZwVIAA25c1wmYISw2pQoJaeaUi0AlVPKJJhrzqhmtlAqsUIEZP7bfpnZzdct-lf24WYfrngDmvw4uA</recordid><startdate>20140704</startdate><enddate>20140704</enddate><creator>Ketterer, A</creator><creator>Douce, T</creator><creator>Keller, A</creator><creator>Coudreau, T</creator><creator>Milman, P</creator><scope>GOX</scope></search><sort><creationdate>20140704</creationdate><title>Quantum search with modular variables</title><author>Ketterer, A ; Douce, T ; Keller, A ; Coudreau, T ; Milman, P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a658-cd8153fdfb3545575cff2495833b78ea4420700735a6f6689ac721071bd669b33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Ketterer, A</creatorcontrib><creatorcontrib>Douce, T</creatorcontrib><creatorcontrib>Keller, A</creatorcontrib><creatorcontrib>Coudreau, T</creatorcontrib><creatorcontrib>Milman, P</creatorcontrib><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ketterer, A</au><au>Douce, T</au><au>Keller, A</au><au>Coudreau, T</au><au>Milman, P</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quantum search with modular variables</atitle><date>2014-07-04</date><risdate>2014</risdate><abstract>We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {\bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by manipulating quantum two--level systems, qubits. We show that this gain, already known to be optimal, is preserved, irrespectively of the dimension of the system used to encode quantum information. This is shown by adapting the protocol to Hilbert spaces of any dimension using the same sequence of operations/logical gates as its original qubit formulation. Our results are detailed and illustrated for a system described by continuous variables, where qubits can be encoded in infinitely many distinct states using the modular variable formalism.</abstract><doi>10.48550/arxiv.1407.1298</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1407.1298
ispartof
issn
language eng
recordid cdi_arxiv_primary_1407_1298
source arXiv.org
subjects Physics - Quantum Physics
title Quantum search with modular variables
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T00%3A30%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quantum%20search%20with%20modular%20variables&rft.au=Ketterer,%20A&rft.date=2014-07-04&rft_id=info:doi/10.48550/arxiv.1407.1298&rft_dat=%3Carxiv_GOX%3E1407_1298%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true