Entanglement Generation

Introduction

Quantum network communication is challenging, as the no-cloning theorem in the quantum regime makes many classical techniques inapplicable; in particular, the direct transmission of qubit states over long distances is infeasible due to unrecoverable errors. For the long-distance communication of unknown quantum states, the only viable communication approach (assuming local operations and classical communications) is the teleportation of quantum states, which requires a prior distribution of the entangled pairs (EPs) of qubits. The establishment of EPs across remote nodes can incur significant latency due to the low probability of success of the underlying physical processes. The focus of our work is to develop efficient techniques that minimize EP generation latency.

Prior works have focused on selecting entanglement paths; in contrast, we select entanglement swapping trees—a more accurate representation of the entanglement generation structure. We develop a dynamic programming algorithm to select an optimal swapping tree for a single pair of nodes, under the given capacity and fidelity constraints.

Published Papers

1. Mohammad Ghaderibaneh, Himanshu Gupta, C.R. Ramakrishnan, Generation and Distribution of GHZ States in Quantum Networks, IEEE QCE 2023

2. Mohammad Ghaderibaneh, Caitao Zhan, Himanshu Gupta, CR Ramakrishnan, Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees, IEEE Transactions on Quantum Engineering 2022

3. Mohammad Ghaderibaneh, Himanshu Gupta, C.R. Ramakrishnan, E. Luo, Pre-distribution of Entanglements in Quantum Networks, IEEE QCE 2022

IEEE QCE 2023 Best Paper Award (Quantum Network Track)