Pantelimon George Popescu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Pantelimon George Popescu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Andrei Tănăsescu
Department of Computer Science and Engineering, University Politehnica of Bucharest, Splaiul Independentei 313 (6), 060042 Bucharest, Romania
5 shared publications - Florin Pop
Faculty of Automatic Control and Computers, National University of Science and Technology Politehnica, 060042 Bucharest, Romania
4 shared publications Andrei Tănăsescu
Computer Science and Engineering Department, University Politehnica of Bucharest, Bucharest, Romania
3 shared publications- R. C. Poenaru
University “Politehnica” of Bucharest
2 shared publications Adriana Balan
University Politehnica of Bucharest, Bucharest, Romania
1 shared publication- Bogdan-Călin Ciobanu
Computer Science Department, University Politehnica of Bucharest, Bucharest, Romania
1 shared publication
Latest Publications
- Open Access
- 9 December 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-8
Distribution of controlled unitary quantum gates towards factoring large numbers on today’s small-register devices
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.
- 9 December 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-8
Open AccessDistribution of controlled unitary quantum gates towards factoring large numbers on today’s small-register devices
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.
- 1 October 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (24) , 13485-13488
A fast way to compute definite integrals
- 1 October 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (24) , 13485-13488
A fast way to compute definite integrals
- Open Access
- 3 December 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (23) , 3123
Scalability of k-Tridiagonal Matrix Singular Value Decomposition
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.
- 3 December 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (23) , 3123
Open AccessScalability of k-Tridiagonal Matrix Singular Value Decomposition
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.
- Open Access
Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy
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.
Open AccessTight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy
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.
- 2 May 2021
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 136 (5) , 1-12
Zero-correlation entanglement vs. Schmidt rank
- 2 May 2021
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 136 (5) , 1-12
Zero-correlation entanglement vs. Schmidt rank
- 4 February 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (2) , 1-17
Separability of heterogeneous quantum systems using multipartite concurrence and tangle
- 4 February 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (2) , 1-17
Separability of heterogeneous quantum systems using multipartite concurrence and tangle
- Open Access
Exploiting the Massey Gap
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 parameters, providing closed-form strict refinements, as well as a numerical procedure improving them even further.
Open AccessExploiting the Massey Gap
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 parameters, providing closed-form strict refinements, as well as a numerical procedure improving them even further.
- 25 April 2020
- Published by Springer Nature in Quantum Information Processing
- Vol. 19 (6) , 1-15
Separability of heterogeneous multipartite quantum systems using Bloch Vectors
- 25 April 2020
- Published by Springer Nature in Quantum Information Processing
- Vol. 19 (6) , 1-15
Separability of heterogeneous multipartite quantum systems using Bloch Vectors
- 7 April 2020
- Published by American Physical Society (APS) in Physical Review A
- Vol. 101 (4) , 042309
Optimal entanglement-assisted almost-random access codes
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.
- 7 April 2020
- Published by American Physical Society (APS) in Physical Review A
- Vol. 101 (4) , 042309
Optimal entanglement-assisted almost-random access codes
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.
- 18 January 2019
- Published by Springer Nature in Soft Computing
- Vol. 23 (22) , 11729-11736
A new version of KSOR method with lower number of iterations and lower spectral radius
- 18 January 2019
- Published by Springer Nature in Soft Computing
- Vol. 23 (22) , 11729-11736
A new version of KSOR method with lower number of iterations and lower spectral radius