Towards An Implementation of the Subset-sum Problem on the IBM Quantum Experience
In seeking out an algorithm to test out the capability of the IBM Quantum Experience quantum computer, we were given a review paper covering various algorithms for solving the subset-sum problem, including both classical and quantum algorithms. The paper went on to present a novel algorithm that bea...
Saved in:
Main Authors | , |
---|---|
Format | Journal Article |
Language | English |
Published |
04.12.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | In seeking out an algorithm to test out the capability of the IBM Quantum
Experience quantum computer, we were given a review paper covering various
algorithms for solving the subset-sum problem, including both classical and
quantum algorithms. The paper went on to present a novel algorithm that beat
the previous best algorithm known at the time. The complex nature of the
algorithm made it difficult to see a path for implementation on the Quantum
Experience machine and the exponential cost - only slightly better than the
best classical algorithm - left us looking for a different approach for solving
this problem. We present here a new quantum algorithm for solving the
subset-sum problem that for many cases should lead to O(poly(n))-time to
solution. The work is reminiscent of the verification procedure used in a
polynomial-time algorithm for the quantum Arthur-Merlin games presented
elsewhere, where the use of a quantum binary search to find a maximum
eigenvalue in the final output stage has been adapted to the subset-sum problem
as in another paper. |
---|---|
AbstractList | In seeking out an algorithm to test out the capability of the IBM Quantum
Experience quantum computer, we were given a review paper covering various
algorithms for solving the subset-sum problem, including both classical and
quantum algorithms. The paper went on to present a novel algorithm that beat
the previous best algorithm known at the time. The complex nature of the
algorithm made it difficult to see a path for implementation on the Quantum
Experience machine and the exponential cost - only slightly better than the
best classical algorithm - left us looking for a different approach for solving
this problem. We present here a new quantum algorithm for solving the
subset-sum problem that for many cases should lead to O(poly(n))-time to
solution. The work is reminiscent of the verification procedure used in a
polynomial-time algorithm for the quantum Arthur-Merlin games presented
elsewhere, where the use of a quantum binary search to find a maximum
eigenvalue in the final output stage has been adapted to the subset-sum problem
as in another paper. |
Author | Adedoyin, Toks Gunter, David |
Author_xml | – sequence: 1 givenname: David surname: Gunter fullname: Gunter, David – sequence: 2 givenname: Toks surname: Adedoyin fullname: Adedoyin, Toks |
BackLink | https://doi.org/10.48550/arXiv.1912.03254$$DView paper in arXiv |
BookMark | eNotj81Og0AUhWehC60-gCvnBcAZmN9lbaqS1Ggje3JhLpGkzJABtL69tLo6OflOTvJdkwsfPBJyx1kqjJTsAeKx-0q55VnK8kyKK7IvwzdEN9K1p0U_HLBHP8HUBU9DS6dPpB9zPeKUjHNP32OolwVd4IkUj690P4OfFrQ9Dhg79A3ekMsWDiPe_ueKlE_bcvOS7N6ei816l4DSIrEAbZMrYE7IzHKhlp5loBCtBZUzbYQDq412teSKs5qDci1qYUCYRrJ8Re7_bs9O1RC7HuJPdXKrzm75L_dXSxA |
ContentType | Journal Article |
Copyright | http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
Copyright_xml | – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
DBID | AKY GOX |
DOI | 10.48550/arxiv.1912.03254 |
DatabaseName | arXiv Computer Science arXiv.org |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
ExternalDocumentID | 1912_03254 |
GroupedDBID | AKY GOX |
ID | FETCH-LOGICAL-a674-9aafc36a0d4529146aaf22a6ee99a630784da9787db51610b1a6dfe748a48c503 |
IEDL.DBID | GOX |
IngestDate | Mon Jan 08 05:45:27 EST 2024 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-a674-9aafc36a0d4529146aaf22a6ee99a630784da9787db51610b1a6dfe748a48c503 |
Notes | LA-UR: 18-28220 |
OpenAccessLink | https://arxiv.org/abs/1912.03254 |
ParticipantIDs | arxiv_primary_1912_03254 |
PublicationCentury | 2000 |
PublicationDate | 2019-12-04 |
PublicationDateYYYYMMDD | 2019-12-04 |
PublicationDate_xml | – month: 12 year: 2019 text: 2019-12-04 day: 04 |
PublicationDecade | 2010 |
PublicationYear | 2019 |
Score | 1.7570972 |
SecondaryResourceType | preprint |
Snippet | In seeking out an algorithm to test out the capability of the IBM Quantum
Experience quantum computer, we were given a review paper covering various
algorithms... |
SourceID | arxiv |
SourceType | Open Access Repository |
SubjectTerms | Computer Science - Emerging Technologies Physics - Quantum Physics |
Title | Towards An Implementation of the Subset-sum Problem on the IBM Quantum Experience |
URI | https://arxiv.org/abs/1912.03254 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV07TwMxDLbaTiwIBKg8lYE1EHK55DIWRClIBSoVqVuVSxyJgSvqA_Hz8eUOlYUxsZc4D3-W488Al04Zk6FA7tHmXBXBcBu957mNQUVLkB7rQHH8rEdv6mmWzzrAfmth3PL7_avhBy5X1xRMyCuRURDTha6U9Zeth5dZk5xMVFyt_laPMGaa-uMkhnuw26I7Nmi2Yx86WB3AZJq-pq7YoGKJjPejrfep2CIyAmCsvr245nQo2GvT4IWRsJY83o7ZZEOrJ9GWlfgQpsP76d2It50MuNNGcetc9Jl2ItRpTnqbaCyl04jWOk23rFDBUThnQpkTAhPljdMholGFU4XPRXYEvWpRYR-YNxhKF1BJLJWO1ok8WuEj6evCRnkM_bT--WdDVjGvTTNPpjn5X3QKOwQEUl8Eoc6gt15u8Jyc7bq8SBb_AZsegCs |
link.rule.ids | 228,230,786,891 |
linkProvider | Cornell University |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Towards+An+Implementation+of+the+Subset-sum+Problem+on+the+IBM+Quantum+Experience&rft.au=Gunter%2C+David&rft.au=Adedoyin%2C+Toks&rft.date=2019-12-04&rft_id=info:doi/10.48550%2Farxiv.1912.03254&rft.externalDocID=1912_03254 |