George Popescu

Prof. George Popescu


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 December 2022 in Scientific Reports
Verified
Journal Article
Open access
PDF file
ATAndrei Tănăsescu
Andrei Tănăsescu
DCDavid Constantinescu
David Constantinescu
GPGeorge Popescu
George Popescu
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 system. This is why we propose a protocol for distributed quantum computation applicable to small register devices, specifically for the distribution of controlled unitary gates, the key element in the construction of every quantum computation algorithm. We leverage quantum sharing of partial results to obtain a parallel processing scheme, allowing for the first time the quantum distribution of very large gates with thousands of inputs using only small register devices with tens of qubits. In this way, we improve all previous controlled unitary gate distribution approaches, obtaining surprising results. The impact is quantified for recent milestone hardware realizations of quantum processors.

18 November 2021 in Entropy
Verified
Journal Article
Open access
PDF file
ATAndrei Tanasescu
Andrei Tanasescu
MCMarios O. Choudary
Marios O. Choudary
Olivier RioulOlivier Rioul
Olivier Rioul
GPGeorge Popescu
George Popescu
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 Massey-like inequality and then further refining it for finite support distributions. The impact of these results is highlighted for side-channel attack evaluations, demonstrating the improvements over the CHES 2017 bounds.

11 December 2014 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
GPGeorge Popescu
George Popescu
ESEmil‐Ioan Sluşanschi
Emil‐Ioan Sluşanschi
VIVoichiţa Iancu
Voichiţa Iancu
FPFlorin Pop
Florin Pop

7 April 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
ATAndrei Tanasescu
Andrei Tanasescu
VIValentina-Florentina Iliescu
Valentina-Florentina Iliescu
GPGeorge Popescu
George Popescu
Entanglement-assisted random access codes (EARACs) compress a large amount of bits, such that any chosen one of them can be recovered with a large probability of success. They have been used for information theoretic treatments of semi-device-independent randomness certification and other communication complexity problems. For high-dimensional problems, the access request distribution can be used to obtain better performance, which until now could only be achieved through numerical methods. This paper makes an analytical account of access request distribution for arbitrary input sizes. We introduce entanglement-assisted almost-random access codes (EAARACs), which maximize the average probability of access under an arbitrary distribution of requests, thus refining EARACs and generalizing the methods used in the study of low-dimensional communication complexity problems. We analytically find the optimal probability of success for EAARACs under arbitrary request distributions and provide an illustrative numerical example.

16 October 2018 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MMMihai-Zicu Mina
Mihai-Zicu Mina
GPGeorge Popescu
George Popescu
In the practical context of quantum networks, the most reliable method of transmitting quantum information is via teleportation because quantum states are highly sensitive. However, teleportation consumes a shared maximally entangled state. Two parties Alice and Bob located at separate nodes that wish to reestablish their shared entanglement will not send entangled qubits directly to achieve this goal, but rather employ a more efficient mechanism that ensures minimal time resources. In this paper, we present a quantum routing scheme that exploits entanglement swapping to reestablish consumed entanglement. It improves and generalizes previous work on the subject and reduces the entanglement distribution time by a factor of 4 k in an arbitrary scale quantum network, where N = 4 k - 1 is a required number of quantum nodes located between source and destination. In addition, k is the greatest positive integer considered by Alice or Bob, such that afterwards they choose N quantum switches.

3 December 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
ATAndrei Tanasescu
Andrei Tanasescu
MCMihai Carabas
Mihai Carabas
Florin POPFlorin POP
Florin POP
GPGeorge Popescu
George Popescu
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 refinement of this method, proving that reordering singular values does not affect performance. We complement our refinement with a scalability study on a real physical cluster setup, offering surprising results. Thus, this method provides a major step up over standard industry implementations.