Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Andrei Tănăsescu"'
Autor:
Narcisa Prodan, Xiao Pan Ding, Raluca Diana Szekely-Copîndean, Andrei Tănăsescu, Laura Visu-Petra
Publikováno v:
Acta Psychologica, Vol 240, Iss , Pp 104019- (2023)
Competing for limited resources with peers is common among children from an early age, illustrating their propensity to use deceptive strategies to win. We focused on how primary school-age (6–8 years old) children's strategic deception toward peer
Externí odkaz:
https://doaj.org/article/08e511ee6da94bce8919d72ef9ebcea5
Publikováno v:
Scientific Reports, Vol 12, Iss 1, Pp 1-8 (2022)
Abstract Factoring a 2048-bit number using Shor’s algorithm, when accounting for error correction, reportedly requires 400,000 qubits. However, it is well known that there is yet much time before we will have this many qubits in the same local syst
Externí odkaz:
https://doaj.org/article/2707c8d4528342859d2610fdcca3a0df
Publikováno v:
Mathematics, Vol 9, Iss 23, p 3123 (2021)
Singular value decomposition has recently seen a great theoretical improvement for k-tridiagonal matrices, obtaining a considerable speed up over all previous implementations, but at the cost of not ordering the singular values. We provide here a ref
Externí odkaz:
https://doaj.org/article/13852fc8cbff4361844532ee8ed60421
Publikováno v:
Entropy, Vol 23, Iss 11, p 1538 (2021)
The bounds presented at CHES 2017 based on Massey’s guessing entropy represent the most scalable side-channel security evaluation method to date. In this paper, we present an improvement of this method, by determining the asymptotically optimal Mas
Externí odkaz:
https://doaj.org/article/bbb36787c13942409968395533f7abbb
Publikováno v:
Entropy, Vol 22, Iss 12, p 1398 (2020)
In this paper, we find new refinements to the Massey inequality, which relates the Shannon and guessing entropies, introducing a new concept: the Massey gap. By shrinking the Massey gap, we improve all previous work without introducing any new parame
Externí odkaz:
https://doaj.org/article/316b726726b549379db1ce3715792fe9
Publikováno v:
Entropy
Entropy, Vol 23, Iss 1538, p 1538 (2021)
Volume 23
Issue 11
Entropy, Vol 23, Iss 1538, p 1538 (2021)
Volume 23
Issue 11
The bounds presented at CHES 2017 based on Massey’s guessing entropy represent the most scalable side-channel security evaluation method to date. In this paper, we present an improvement of this method, by determining the asymptotically optimal Mas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::659cb35ff89c42759d8ffa6b1d82260d
https://pubmed.ncbi.nlm.nih.gov/34828236
https://pubmed.ncbi.nlm.nih.gov/34828236
Publikováno v:
Physics Letters A. 383:2168-2171
Non-local implementations of quantum gates are a vital part of quantum networks. We find an optimal non-local implementation of quantum functions, the quantum gate equivalent of a switch statement. Then, we apply this result to the Deutsch-Jozsa prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::357c96fee435260b24e4f8e718a69778
https://doi.org/10.1016/j.physleta.2019.04.023
https://doi.org/10.1016/j.physleta.2019.04.023
Publikováno v:
The European Physical Journal Plus. 136
In this paper, we find the minimal number of correlation tests required to certify independence of two classical random variables of arbitrary finite support. Moreover, we completely characterize the constraints implied by zero correlations upon an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea60e95aeaaa8f0475e00a272967a613
https://doi.org/10.1140/epjp/s13360-021-01468-y
https://doi.org/10.1140/epjp/s13360-021-01468-y
Publikováno v:
Entropy, Vol 22, Iss 1398, p 1398 (2020)
Entropy
Volume 22
Issue 12
Entropy
Volume 22
Issue 12
In this paper, we find new refinements to the Massey inequality, which relates the Shannon and guessing entropies, introducing a new concept: the Massey gap. By shrinking the Massey gap, we improve all previous work without introducing any new parame
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8d05925a944c294a8e9f55d0eca6f3c
https://www.mdpi.com/1099-4300/22/12/1398
https://www.mdpi.com/1099-4300/22/12/1398
Publikováno v:
Quantum Information Processing. 19
Refining recent results, we propose an upper bound for the norms of Bloch Vectors for heterogeneous quantum systems containing an arbitrary number of qudits with possibly different numbers of levels. We also generalize recent approaches for tripartit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d03de9030b33f7bfe4007479ea09097
https://doi.org/10.1007/s11128-020-02668-8
https://doi.org/10.1007/s11128-020-02668-8