activity
20182026
most citedNear-term quantum-repeater experiments with nitrogen-vacancy centers: Overcoming the limitations of direct transmission

139 citations · 166 across the 5 of their papers we have counts for

collaborators

6 papers

quant-ph2026

Energy efficiency of quantum computers

Miquel Carrasco-Codina, Pau Escofet, Paul Hilaire +13

How much energy does a quantum computer consume? Are they more efficient than their classical counterparts? In this work, we make a step towards answering these questions. We defin…

quant-ph2024

Free-space model for a balloon-based quantum network

Ilektra Karakosta-Amarantidou, Raja Yehia, Matteo Schiavon

Long-distance communication is one of the main bottlenecks in the development of quantum communication networks. Free-space communication is a way to circumvent exponential fiber l…

quant-ph2023★ 16 cited

Connecting Quantum Cities: Simulation of a Satellite-Based Quantum Network

Raja Yehia, Matteo Schiavon, Valentina Marulanda Acosta +4

We present and analyse an architecture for a European-scale quantum network using satellite links to connect Quantum Cities, which are metropolitan quantum networks with minimal ha…

quant-ph2022★ 5 cited

Quantum City: simulation of a practical near-term metropolitan quantum network

Raja Yehia, Simon Neves, Eleni Diamanti +1

We present the architecture and analyze the applications of a metropolitan-scale quantum network that requires only limited hardware resources for end users. Using NetSquid, a quan…

quant-ph2020★ 6 cited

Composable Security for Multipartite Entanglement Verification

Raja Yehia, Eleni Diamanti, Iordanis Kerenidis

We present a composably secure protocol allowing parties to test an entanglement generation resource controlled by a possibly dishonest party. The test consists only in local q…

quant-ph2018★ 139 cited

Near-term quantum-repeater experiments with nitrogen-vacancy centers: Overcoming the limitations of direct transmission

Filip Rozpędek, Raja Yehia, Kenneth Goodenough +5

Quantum channels enable the implementation of communication tasks inaccessible to their classical counterparts. The most famous example is the distribution of secret key. However,…