Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Andreas Bartschi"'
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
Publikováno v:
IEEE Transactions on Quantum Engineering, Vol 3, Pp 1-19 (2022)
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://doaj.org/article/652d310195874f94b8a7195ead65a34c
Publikováno v:
IEEE Transactions on Quantum Engineering, Vol 3, Pp 1-16 (2022)
We present a divide-and-conquer approach to deterministically prepare Dicke states $|D^{n}_{k}\rangle$ (i.e., equal-weight superpositions of all $n$-qubit states with Hamming weight $k$) on quantum computers. In an experimental evaluation for up to $
Externí odkaz:
https://doaj.org/article/a00d68e11f92491cae5c4cbf79d20050
Autor:
Andreas Bartschi, Stephan Eidenbenz
We present short-depth circuits to deterministically prepare any Dicke state |Dn,k>, which is the equal-amplitude superposition of all n-qubit computational basis states with Hamming Weight k. Dicke states are an important class of entangled quantum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e198fba784c5af9df4f7257a8bee95a9
http://arxiv.org/abs/2207.09998
http://arxiv.org/abs/2207.09998
Due to the no-cloning theorem, generating perfect quantum clones of an arbitrary unknown quantum state is not possible, however approximate quantum clones can be constructed. Quantum telecloning is a protocol that originates from a combination of qua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b914783af3f97c0e8e2010de0d3f5342
http://arxiv.org/abs/2205.00125
http://arxiv.org/abs/2205.00125
We present a divide-and-conquer approach to deterministically prepare Dicke states $\lvert D_k^n\rangle$ (i.e., equal-weight superpositions of all $n$-qubit states with Hamming Weight $k$) on quantum computers. In an experimental evaluation for up to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d0756cc3de00f457b8e6be475941482
http://arxiv.org/abs/2112.12435
http://arxiv.org/abs/2112.12435
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