Benchmarking 16-element quantum search algorithms on superconducting quantum processors

Benchmarking 16-element quantum search algorithms on superconducting quantum processors

We present experimental results on running 4-qubit unstructured search on IBM quantum processors. Our best attempt attained probability of success around 24.5%. We try several algorithms and use the most recent developments in quantum search to reduce the number of entangling gates that are currentl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gwinner, Jan, Briański, Marcin, Burkot, Wojciech, Czerwiński, Łukasz, Hlembotskyi, Vladyslav
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Data Structures and Algorithms
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 Gwinner, Jan
Briański, Marcin
Burkot, Wojciech
Czerwiński, Łukasz
Hlembotskyi, Vladyslav
description We present experimental results on running 4-qubit unstructured search on IBM quantum processors. Our best attempt attained probability of success around 24.5%. We try several algorithms and use the most recent developments in quantum search to reduce the number of entangling gates that are currently considered the main source of errors in quantum computations. Comparing theoretical expectations of an algorithm performance with the actual data, we explore the hardware limits, showing sharp, phase-transition-like degradation of performance on quantum processors. We conclude that it is extremely important to design hardware-aware algorithms and to include any other low level optimizations on NISQ devices.
doi_str_mv 10.48550/arxiv.2007.06539
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2007_06539</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2007_06539</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-eb99c906a80fa925bbe674df0041ccadf99994c18ba3e602118a40f733626c533</originalsourceid><addsrcrecordid>eNo1z01OwzAQBWBvWKCWA7DCF0gYx44TL0vFn1SJTSWW0cQZNxGJE-wEwe1pC53N28x70sfYrYBUlXkO9xi-u680AyhS0Lk01-z9gbxtBwwfnT9woRPqaSA_888F_bwMPBIG23LsD2Po5naIfPQ8LhMFO_pmsfOpd3mewmgpxjHENbty2Ee6-c8V2z897rcvye7t-XW72SWoC5NQbYw1oLEEhybL65p0oRoHoIS12DhzPGVFWaMkDZkQJSpwhZQ60zaXcsXu_mbPsmoK3ZHyU52E1VkofwGLGk1S</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Benchmarking 16-element quantum search algorithms on superconducting quantum processors</title><source>arXiv.org</source><creator>Gwinner, Jan ; Briański, Marcin ; Burkot, Wojciech ; Czerwiński, Łukasz ; Hlembotskyi, Vladyslav</creator><creatorcontrib>Gwinner, Jan ; Briański, Marcin ; Burkot, Wojciech ; Czerwiński, Łukasz ; Hlembotskyi, Vladyslav</creatorcontrib><description>We present experimental results on running 4-qubit unstructured search on IBM quantum processors. Our best attempt attained probability of success around 24.5%. We try several algorithms and use the most recent developments in quantum search to reduce the number of entangling gates that are currently considered the main source of errors in quantum computations. Comparing theoretical expectations of an algorithm performance with the actual data, we explore the hardware limits, showing sharp, phase-transition-like degradation of performance on quantum processors. We conclude that it is extremely important to design hardware-aware algorithms and to include any other low level optimizations on NISQ devices.</description><identifier>DOI: 10.48550/arxiv.2007.06539</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Physics - Quantum Physics</subject><creationdate>2020-07</creationdate><rights>http://creativecommons.org/licenses/by/4.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/2007.06539$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2007.06539$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Gwinner, Jan</creatorcontrib><creatorcontrib>Briański, Marcin</creatorcontrib><creatorcontrib>Burkot, Wojciech</creatorcontrib><creatorcontrib>Czerwiński, Łukasz</creatorcontrib><creatorcontrib>Hlembotskyi, Vladyslav</creatorcontrib><title>Benchmarking 16-element quantum search algorithms on superconducting quantum processors</title><description>We present experimental results on running 4-qubit unstructured search on IBM quantum processors. Our best attempt attained probability of success around 24.5%. We try several algorithms and use the most recent developments in quantum search to reduce the number of entangling gates that are currently considered the main source of errors in quantum computations. Comparing theoretical expectations of an algorithm performance with the actual data, we explore the hardware limits, showing sharp, phase-transition-like degradation of performance on quantum processors. We conclude that it is extremely important to design hardware-aware algorithms and to include any other low level optimizations on NISQ devices.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNo1z01OwzAQBWBvWKCWA7DCF0gYx44TL0vFn1SJTSWW0cQZNxGJE-wEwe1pC53N28x70sfYrYBUlXkO9xi-u680AyhS0Lk01-z9gbxtBwwfnT9woRPqaSA_888F_bwMPBIG23LsD2Po5naIfPQ8LhMFO_pmsfOpd3mewmgpxjHENbty2Ee6-c8V2z897rcvye7t-XW72SWoC5NQbYw1oLEEhybL65p0oRoHoIS12DhzPGVFWaMkDZkQJSpwhZQ60zaXcsXu_mbPsmoK3ZHyU52E1VkofwGLGk1S</recordid><startdate>20200713</startdate><enddate>20200713</enddate><creator>Gwinner, Jan</creator><creator>Briański, Marcin</creator><creator>Burkot, Wojciech</creator><creator>Czerwiński, Łukasz</creator><creator>Hlembotskyi, Vladyslav</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20200713</creationdate><title>Benchmarking 16-element quantum search algorithms on superconducting quantum processors</title><author>Gwinner, Jan ; Briański, Marcin ; Burkot, Wojciech ; Czerwiński, Łukasz ; Hlembotskyi, Vladyslav</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-eb99c906a80fa925bbe674df0041ccadf99994c18ba3e602118a40f733626c533</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Gwinner, Jan</creatorcontrib><creatorcontrib>Briański, Marcin</creatorcontrib><creatorcontrib>Burkot, Wojciech</creatorcontrib><creatorcontrib>Czerwiński, Łukasz</creatorcontrib><creatorcontrib>Hlembotskyi, Vladyslav</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gwinner, Jan</au><au>Briański, Marcin</au><au>Burkot, Wojciech</au><au>Czerwiński, Łukasz</au><au>Hlembotskyi, Vladyslav</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Benchmarking 16-element quantum search algorithms on superconducting quantum processors</atitle><date>2020-07-13</date><risdate>2020</risdate><abstract>We present experimental results on running 4-qubit unstructured search on IBM quantum processors. Our best attempt attained probability of success around 24.5%. We try several algorithms and use the most recent developments in quantum search to reduce the number of entangling gates that are currently considered the main source of errors in quantum computations. Comparing theoretical expectations of an algorithm performance with the actual data, we explore the hardware limits, showing sharp, phase-transition-like degradation of performance on quantum processors. We conclude that it is extremely important to design hardware-aware algorithms and to include any other low level optimizations on NISQ devices.</abstract><doi>10.48550/arxiv.2007.06539</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2007.06539
ispartof
issn
language eng
recordid cdi_arxiv_primary_2007_06539
source arXiv.org
subjects Computer Science - Data Structures and Algorithms
Physics - Quantum Physics
title Benchmarking 16-element quantum search algorithms on superconducting quantum processors
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T09%3A16%3A36IST&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=Benchmarking%2016-element%20quantum%20search%20algorithms%20on%20superconducting%20quantum%20processors&rft.au=Gwinner,%20Jan&rft.date=2020-07-13&rft_id=info:doi/10.48550/arxiv.2007.06539&rft_dat=%3Carxiv_GOX%3E2007_06539%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