Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Alexander Poremba"'
Publikováno v:
Quantum, Vol 8, p 1330 (2024)
Copy-protection allows a software distributor to encode a program in such a way that it can be evaluated on any input, yet it cannot be "pirated" – a notion that is impossible to achieve in a classical setting. Aaronson (CCC 2009) initiated the for
Externí odkaz:
https://doaj.org/article/d6dbe3c1f9024125ae3d2a241a50c07b
Publikováno v:
Quantum, Vol 4, p 248 (2020)
Computing quantum state fidelity will be important to verify and characterize states prepared on a quantum computer. In this work, we propose novel lower and upper bounds for the fidelity $F(\rho,\sigma)$ based on the ``truncated fidelity'' $F(\rho_m
Externí odkaz:
https://doaj.org/article/8eed981b53f541f788318a88a7741434
Publikováno v:
Cryptography, Vol 4, Iss 1, p 10 (2020)
Large-scale quantum computing poses a major threat to classical public-key cryptography. Recently, strong “quantum access” security models have shown that numerous symmetric-key cryptosystems are also vulnerable. In this paper, we consider classi
Externí odkaz:
https://doaj.org/article/ff71784863cd4441abd966c568a90578
Autor:
Sumeet Khatri, Ryan LaRose, Alexander Poremba, Lukasz Cincio, Andrew T. Sornborger, Patrick J. Coles
Publikováno v:
Quantum, Vol 3, p 140 (2019)
Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of clas
Externí odkaz:
https://doaj.org/article/fb52be12dd6d4173b22fe864366efcc0
Publikováno v:
Quantum, Vol 4, p 248 (2020)
Computing quantum state fidelity will be important to verify and characterize states prepared on a quantum computer. In this work, we propose novel lower and upper bounds for the fidelity $F(\rho,\sigma)$ based on the "truncated fidelity" $F(\rho_m,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bada694d43147e0cd5fb031a05491d27
https://resolver.caltech.edu/CaltechAUTHORS:20200423-104102695
https://resolver.caltech.edu/CaltechAUTHORS:20200423-104102695
Publikováno v:
Cryptography
Volume 4
Issue 1
Cryptography, Vol 4, Iss 1, p 10 (2020)
Cryptography, 4(1):10. MDPI AG
Volume 4
Issue 1
Cryptography, Vol 4, Iss 1, p 10 (2020)
Cryptography, 4(1):10. MDPI AG
Large-scale quantum computing poses a major threat to classical public-key cryptography. Recently, strong &ldquo
quantum access&rdquo
security models have shown that numerous symmetric-key cryptosystems are also vulnerable. In this paper, w
quantum access&rdquo
security models have shown that numerous symmetric-key cryptosystems are also vulnerable. In this paper, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cd6bce6fcdf238434cc265a169d6dcc
Autor:
Ryan LaRose, Andrew T. Sornborger, Sumeet Khatri, Alexander Poremba, Lukasz Cincio, Patrick J. Coles
Publikováno v:
Quantum, Vol 3, p 140 (2019)
Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of clas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d40180a69d308ba01aa26c0307de922
https://doi.org/10.22331/q-2019-05-13-140
https://doi.org/10.22331/q-2019-05-13-140