Search Results - "Popescu, Pantelimon George"

Bloch vector norms of separable multi-partite quantum systems by T n sescu, Andrei, Popescu, Pantelimon-George

“…In this letter, we find an upper bound for the norms of Bloch vectors for quantum systems comprised of an arbitrary number of qudits. We generalize a recent…”
Get full text

A Geometric Programming Solution for the Mutual-Interference Model in HetNets by Diez, Luis, Popescu, George-Pantelimon, Aguero, Ramon

“…It is well known that the use of heterogeneous networks and densification strategies will be crucial to handle the wireless cellular traffic increase that is…”
Get full text

Optimal key forwarding strategy in QKD behaviours by Popa, Alin-Bogdan, Popescu, Pantelimon George

“…Nowadays QKD plays a critical role in unconditionally-secure and quantum-safe key distribution. Commercially available QKD devices are getting more popular for…”
Get full text

Distribution of controlled unitary quantum gates towards factoring large numbers on today’s small-register devices by Tănăsescu, Andrei, Constantinescu, David, Popescu, Pantelimon George

“…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…”
Get full text

Optimal and scalable entanglement distribution over crossbar quantum networks by Ciobanu, Bogdan-Călin, Verzotti, Luca Perju, Popescu, Pantelimon George

“…Crossbar networks are a cornerstone of network architectures, capable of operating both as standalone interconnections or as integral switching components in…”
Get full text

Optimal quantum network decongestion strategies by Perju Verzotti, Luca, Ciobanu, Bogdan-Călin, Popescu, Pantelimon George

“…This study clarifies the problem of decongestion in quantum networks, with a specific focus on the crucial task of entanglement distribution. Entangled…”
Get full text

EntangleNetSat: A Satellite-Based Entanglement Resupply Network by Ciobanu, Bogdan-Calin, Iancu, Voichita, Popescu, Pantelimon George

“…In the practical context of quantum networks, quantum teleportation plays a key role in transmitting quantum information. In the process of teleportation, a…”
Get full text

Exploiting the Massey Gap by Tănăsescu, Andrei, Popescu, Pantelimon George

“…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…”
Get full text

Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy by Tănăsescu, Andrei, Choudary, Marios O., Rioul, Olivier, Popescu, Pantelimon George

“…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…”
Get full text

Scalability of k-Tridiagonal Matrix Singular Value Decomposition by Tănăsescu, Andrei, Carabaş, Mihai, Pop, Florin, Popescu, Pantelimon George

“…Singular value decomposition has recently seen a great theoretical improvement for k-tridiagonal matrices, obtaining a considerable speed up over all previous…”
Get full text

EntangleNet: Theoretical Reestablishment of Entanglement in Quantum Networks by Mina, Mihai-Zicu, Popescu, Pantelimon

“…In the practical context of quantum networks, the most reliable method of transmitting quantum information is via teleportation because quantum states are…”
Get full text

A fast singular value decomposition algorithm of general k-tridiagonal matrices by Tănăsescu, Andrei, Popescu, Pantelimon George

“…•Improvement of any Singular Value Decomposition Black Box Algorithm for k-tridiagonal matrices.•Mathematical proofs.•Complexity analysis.•Numerical…”
Get full text

Energy-efficient virtualized clusters by Carabaş, Mihai, Popescu, Pantelimon George

“…In this paper we provide the state of the art for the virtualization techniques and means to reduce power consumption using it. Virtualization allows us to…”
Get full text

Simple exact quantum search by Guţoiu, Raj Alexandru, Tănăsescu, Andrei, Popescu, Pantelimon George

“…While Grover’s search algorithm is asymptotically optimal, it does not always result in a real solution. If the search fails, the algorithm must be ran again…”
Get full text

A fast way to compute definite integrals by Ciobanu, Bogdan-Călin, Pop, Florin, Popescu, Pantelimon George

“…In this paper, we present a fast method to compute definite integrals using triangles to approximate the area beneath a function. This method achieves the same…”
Get full text

SkySwapping: Entanglement resupply by separating quantum swapping and photon exchange by Popa, Alin-Bogdan, Ciobanu, Bogdan-Călin, Iancu, Voichiţa, Pop, Florin, Popescu, Pantelimon George

“…We propose a fast, satellite-based, on-demand entanglement resupply protocol which leverages entangled pairs exchanged in advance between satellites and ground…”
Get full text

Separability of heterogeneous quantum systems using multipartite concurrence and tangle by Tănăsescu, Andrei, Popescu, Pantelimon George

“…As heterogeneous quantum systems become a high-impact topic in the state of the art through hybrid entanglement, none of the many competing measures of…”
Get full text

Zero-correlation entanglement vs. Schmidt rank by Tănăsescu, Andrei, Balan, Adriana, Popescu, Pantelimon George

“…In this paper, we find the minimal number of correlation tests required to certify independence of two classical random variables of arbitrary finite support…”
Get full text

Non-local quantum functions and the distributed Deutsch-Jozsa algorithm by Tănăsescu, Andrei, Mina, Mihai-Zicu, Popescu, Pantelimon George

“…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…”
Get full text

Separability of heterogeneous multipartite quantum systems using Bloch Vectors by Tănăsescu, Andrei, Popescu, Pantelimon George

“…Refining recent results, we propose an upper bound for the norms of Bloch Vectors for heterogeneous quantum systems containing an arbitrary number of qudits…”
Get full text