Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Andreas Bärtschi"'
Publikováno v:
npj Quantum Information, Vol 10, Iss 1, Pp 1-19 (2024)
Abstract We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p = 1, 2 rounds is executed on the 127 qubit heavy-hex graph gate-model quantum computer
Externí odkaz:
https://doaj.org/article/a31d0921dd4e4f32b6f46bf94afe6107
Publikováno v:
ACM Transactions on Quantum Computing. 3:1-23
We study the status of fair sampling on Noisy Intermediate Scale Quantum (NISQ) devices, in particular the IBM Q family of backends. Using the recently introduced Grover Mixer-QAOA algorithm for discrete optimization, we generate fair sampling circui
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031320408
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af1510418ed6a42d84c526b4f69cc3d4
https://doi.org/10.1007/978-3-031-32041-5_13
https://doi.org/10.1007/978-3-031-32041-5_13
Quantum volume (QV) has become the de-facto standard benchmark to quantify the capability of Noisy Intermediate-Scale Quantum (NISQ) devices. While QV values are often reported by NISQ providers for their systems, we perform our own series of QV calc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b05b5206bca833bc7203478a76f84852
http://arxiv.org/abs/2203.03816
http://arxiv.org/abs/2203.03816
Autor:
Zachary Morrell, Marc Vuffray, Andrey Y. Lokhov, Andreas Bärtschi, Tameem Albash, Carleton Coffrin
We propose a quantum annealing protocol that more effectively probes the dynamics of a single qubit on D-Wave's quantum annealing hardware. This protocol uses D-Wave's h-gain schedule functionality, which allows the rapid quenching of the longitudina
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a00b8a029d5ed4b8bd9fa445a4681c0
Although perfect copying of an unknown quantum state is not possible, approximate cloning is possible in quantum mechanics. Quantum telecloning is a variant of approximate quantum cloning which uses quantum teleportation to allow for the use of class
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa99a612a502cab1afe64c16788460f4
Publikováno v:
QCE
Modern NISQ devices are subject to a variety of biases and sources of noise that degrade the solution quality of computations carried out on these devices. A natural question that arises in the NISQ era, is how fairly do these devices sample ground s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c7afa0ea3142443042f11522f28d18e
Publikováno v:
IEEE Transactions on Quantum Engineering, Vol 5, Pp 1-19 (2024)
Quantum information cannot be perfectly cloned, but approximate copies of quantum information can be generated. Quantum telecloning combines approximate quantum cloning, more typically referred to as quantum cloning, and quantum teleportation. Quantu
Externí odkaz:
https://doaj.org/article/5cb68a51b6ad4eda99fd783b5befa0b8
Autor:
Stephan Eidenbenz, Andreas Bärtschi
Publikováno v:
QCE
We propose GM-QAOA, a variation of the Quantum Alternating Operator Ansatz (QAOA) that uses Grover-like selective phase shift mixing operators. GM-QAOA works on any NP optimization problem for which it is possible to efficiently prepare an equal supe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42ac39a246c6ef27deea1c9b1988b9f2
http://arxiv.org/abs/2006.00354
http://arxiv.org/abs/2006.00354
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030507428
We propose two new algorithms – Spring-Based MinorMiner (SPMM) and Clique-Based MinorMiner (CLMM) – which take as input the connectivity graph of a Quadratic Unconstrained Binary Optimization (QUBO) problem and produce as output an embedding of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80852a6ee7b87b39e07769051af8d90a
https://doi.org/10.1007/978-3-030-50743-5_10
https://doi.org/10.1007/978-3-030-50743-5_10