Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2205.06300 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Scheduling Quantum Teleportation with Noisy Memories

Aparimit Chandra, Wenhan Dai, Don Towsley

Published Sep 1, 2022• 12 citations
arXivHTMLPDF

Abstract

Quantum teleportation channels can overcome the effects of photonic loss, a major challenge in the implementation of a quantum network over fiber. Teleportation channels are created by distributing an entangled state between two nodes, which is a probabilistic process requiring classical communication. This causes critical delays that can cause information loss as quantum data suffers from decoherence when stored in memory. In this work, we quantify the effect of decoherence on fidelity at a node in a quantum network due to the storage of qubits in noisy memory platforms. We model a memory platform as a buffer that stores incoming qubits waiting for the creation of a teleportation channel. Memory platforms are parameterized with decoherence rate and buffer size. We show that fidelity at a node is a linear sum of terms, exponentially decaying with time, where the decay rate depends on the decoherence rate of the memory platform. This allows us to utilize Laplace transforms to derive computable functions of average fidelity with respect to the load, buffer size, and decoherence rate of the memory platform. We prove that serving qubits in a Last In First Out order with pushout for buffer overflow management maximizes average fidelity. Last, we apply this framework to model a single repeater node to calculate the average fidelity of the end-to-end entanglement created by this repeater assuming perfect gate operations.

DOI
10.1109/qce53715.2022.00065

Related papers

Role of Error Syndromes in Teleportation Scheduling

Aparimit Chandra, Filip Rozpędek, Don Towsley

Quantum teleportation enables quantum information transmission, but requires distribution of entangled resource states. Unfortunately, decoherence, caused by environmental interference during quantum state storage, can degrade quantum states, leading to entanglement loss in the resource state and re-duction of the fidelity of the teleported information. In this work, we investigate the use of error correction and error syndrome information in scheduling teleportation at a quantum network node in the presence of multiple teleportation requests and a finite rate of remote entanglement distribution. Specifically, we focus on the scenario where stored qubits undergo decoherence over time due to imperfect memories. To protect the qubits from the resulting errors, we employ quantum encodings, and the stored qubits undergo repeated error correction, generating error syndromes in each round. These error syndromes can provide additional benefits, as they can be used to calculate qubit-specific error likelihoods, which can then be utilized to make better scheduling decisions. By integrating error correction techniques into the scheduling process, our goal is to minimize errors and decoherence effects, thereby enhancing the fidelity and efficiency of teleportation in a quantum network setting.

arXiv:2408.04536•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

Fidelity of quantum teleportation through noisy channels

Sangchul Oh, Soonchil Lee, Hai-Woong Lee

We investigate quantum teleportation through noisy quantum channels by solving analytically and numerically a master equation in the Lindblad form. We calculate the fidelity as a function of decoherence rates and angles of a state to be teleported. It is found that the average fidelity and the range of states to be accurately teleported depend on types of noises acting on quantum channels. If the quantum channels are subject to isotropic noise, the average fidelity decays to $1/2,$ which is smaller than the best possible value of $2/3$ obtained only by the classical communication. On the other hand, if the noisy quantum channel is modeled by a single Lindblad operator, the average fidelity is always greater than $2/3.$

arXiv:quant-ph/0206173•Physical Review A•Aug 27, 2002•202 citations

How Many Qubits Can Be Teleported? Scalability of Fidelity-Constrained Quantum Applications

Oscar Ramón Adamuz-Hinojosa, Jonathan Prados-Garzon, Sara Vaquero-Gil +1 more

Quantum networks (QNs) enable qubit transfer between distant nodes through quantum teleportation, which reconstructs a quantum state at a remote node by consuming a shared Bell pair. In multi-qubit quantum applications (QApps), the teleported qubits may need to remain stored in quantum memories until execution can start, while decoherence progressively reduces their fidelity with respect to the ideal target state. Such QApps can operate only if all teleported qubits simultaneously satisfy a minimum fidelity threshold. In this paper, we study how many qubits can be teleported under this fidelity-constrained operation in a two-node QN. To this end, we define a QApplevel reliability metric as the probability that all end-to-end Bell pairs satisfy the target fidelity when the multi-qubit teleportation stage is completed. We then develop a Monte Carlo simulator that captures stochastic Bell-pair generation, Quantum Repeater (QR)-assisted entanglement distribution, and fidelity degradation. The analysis considers fiber-based and terrestrial free-space optical (FSO) quantum links, as well as representative NV-center- and trapped-ion-based quantum memories. Results show that memory coherence is the main scalability bottleneck under stringent fidelity targets, while parallel entanglement generation is essential for multi-qubit teleportation.

arXiv:2603.28672•Joint European Conference on Networks and Communications & 6G Summit (EuCNC/6G Summit)•Jun 2, 2026•0 citations

Quantum gate-assisted teleportation in noisy environments: robustness and fidelity improvement

Sajede Harraz, Jiaoyang Zhang, Shuang Cong

Abstract Quantum teleportation as the key strategy for quantum communication requires pure maximally shared entangled states among quantum nodes. In practice, quantum decoherence drastically degrades the shared entanglement during entanglement distribution, which is a serious challenge for the development of quantum networks. However, most of the decoherence control strategies proposed thus far are either resource-intensive or time-consuming. To overcome this obstacle, we enable noise-resistant teleportation through a noisy channel with a limited number of qubits and without applying time-consuming weak measurements. We apply a quantum gate control unit consisting of a controlled NOT gate and a rotation gate after the original teleportation protocol is accomplished. Furthermore, we demonstrate that a teleportation fidelity of unity is attainable when environment-assisted measurement is added to the proposed teleportation protocol via quantum gates. Moreover, we present an entanglement distribution process by employing the designed quantum gate control unit followed by the deterministic standard teleportation protocol to improve teleportation fidelity by establishing improved shared entanglement. Our performance analysis indicates that the proposed teleportation schemes offer a competitive fidelity and success probability compared with the conventional schemes and a recent weak measurement-based teleportation protocol.

Communications in Theoretical Physics•Dec 7, 2023•4 citations

Repeater-Based Quantum Communication Protocol: Maximizing Teleportation Fidelity with Minimal Entanglement

Arkaprabha Ghosal, Jatin Ghai, Tanmay Saha +2 more

Transmitting unknown quantum states to distant locations is crucial for distributed quantum information protocols. The seminal quantum teleportation scheme achieves this feat while requiring prior maximal entanglement between the sender and receiver. In scenarios with noisy entangled states, optimal teleportation fidelity characterizes the efficacy of transmitting the state, demanding the proper selection of local operations at the sender's and receiver's ends. The complexity escalates further in long-range communication setups, prompting the consideration of a repeater-based approach, which incorporates arrays of nodes with multiple segments to facilitate the efficient transmission of quantum information. The fidelity of the communication line gets degraded even if a single segment is affected by noise. In such cases, the general wisdom employs the standard entanglement swapping protocol involving maximally entangled states across the noiseless segments and applying maximally entangled basis measurement at the corresponding nodes to achieve optimal fidelity. In this Letter, we propose a more efficient protocol for a certain class of noisy states, achieving the same fidelity as the standard protocol while consuming less amount of entanglement. Our approach ensures optimal teleportation fidelity even when the end-to-end state gets noisier, and thus promises efficient utility of quantum resources in repeater-based distributed quantum protocols.

arXiv:2406.14216•Physical Review Letters•Apr 23, 2025•8 citations

Resource allocation in quantum networks

Shahrooz Pouryousef

Quantum computing promises computational capabilities beyond those of classical systems by exploiting superposition, entanglement, and quantum interference. However, the scalability of current noisy intermediate-scale quantum (NISQ) devices is limited by physical and engineering constraints, restricting the number of available qubits. Distributed quantum computing (DQC) mitigates this limitation by interconnecting multiple quantum processing units (QPUs) via quantum networks capable of distributing high-fidelity entanglement. Realizing such networks requires overcoming probabilistic entanglement generation, finite memory coherence, photon loss, and architectural constraints. This dissertation conducts an in-depth and comprehensive study of resource allocation in quantum networks, aiming to support high-throughput and high-fidelity entanglement distribution over lossy infrastructures. Our work spans the quantum networking stack, from physical-layer entanglement distribution protocols to network planning, quantum storage architectures, and distributed quantum computing. We begin by introducing two asynchronous entanglement distribution protocols-Sequential and Parallel-designed for early-stage quantum networks without global synchronization. Unlike many prior models, our protocols account for classical communication delays and quantum memory decoherence, reflecting practical constraints. Through simulations on real-world topologies such as SURFnet, we show that simple mechanisms such as cutoff-based memory management and sequential asynchronous entanglement distribution protocols can deliver competitive performance while significantly simplifying coordination, narrowing the gap between theoretical proposals and deployable protocols. Next, we formulate quantum network planning as a utility maximization problem that jointly considers entanglement distribution rate and fidelity, treating repeater and memory placement as optimization variables. We propose scalable heuristics and mixed-integer formulations, evaluating them under realistic conditions such as finite coherence time of quantum memories, limited number of memories per repeaters and end nodes, and real network topologies such as ESNet. Our findings offer practical design guidance and highlight how optimal placements depend on underlying physical constraints. To support dynamic workloads and respond to traffic bursts, we propose the Quantum Storage Network (QSN) architecture, where storage nodes buffer EPR pairs in advance of demand as an overlay network. This temporal decoupling improves responsiveness and throughput. Simulations across multiple topologies show that QSNs reduce entanglement distribution service latency by up to 40% and provide improved robustness compared to non-overlay designs, underscoring the value of storage-aware planning in future quantum networks. Finally, we focus on DQC, where large-scale quantum circuits are executed across networked QPUs. We propose a window-based circuit partitioning algorithm that minimizes nonlocal gate execution while balancing load across QPUs. Building on this partitioning, we design an adaptive, dependency-aware entanglement generation scheduler that opportunistically initiates remote entanglement as soon as dependent gates are ready, while accounting for realistic constraints such as coherence limits, probabilistic link generation, and Bell-state measurement (BSM) contention. Applied to benchmark circuits such as QAOA and QFT, this joint approach reduces execution delay by up to 35%. We further perform a two-qubit gate fidelity-sensitivity analysis under to show when the distributed quantum computing can be beneficial. Results show that the number of QPUs significantly impacts sensitivity to non-local gate fidelity: with fewer QPUs, distributed execution can outperform monolithic execution under looser fidelity constraints, whereas with more QPUs, achieving the same advantage requires substantially higher non-local gate fidelities relative to local gate fidelities. These findings identify the parameter regimes in which distributed quantum computing is beneficial, mapping break-even regions (as a function of number of QPUs) and quantifying how much cross-QPU (non-local) gate fidelity must improve—or, equivalently, how much per-QPU local gate fidelity must improve under modularization—for distributed execution to outperform a monolithic baseline. Together, these contributions form a cohesive framework for resource allocation in quantum networks in order to build scalable, delay-tolerant quantum networks and distributed computing systems. By grounding architectural design in realistic physical assumptions, this work advances the state of the art from theoretical modeling to practical, deployable quantum infrastructure.

•Jan 1, 2025•0 citations
Quantum teleportation channels can overcome the effects of photonic loss, a major challenge in the implementation of a quantum network over fiber. Teleportation channels are created by distributing an entangled state between two nodes, which is a probabilistic process requiring classical communication. This causes critical delays that can cause information loss as quantum data suffers from decoherence when stored in memory. In this work, we quantify the effect of decoherence on fidelity at a node in a quantum network due to the storage of qubits in noisy memory platforms. We model a memory platform as a buffer that stores incoming qubits waiting for the creation of a teleportation channel. Memory platforms are parameterized with decoherence rate and buffer size. We show that fidelity at a node is a linear sum of terms, exponentially decaying with time, where the decay rate depends on the decoherence rate of the memory platform. This allows us to utilize Laplace transforms to derive computable functions of average fidelity with respect to the load, buffer size, and decoherence rate of the memory platform. We prove that serving qubits in a Last In First Out order with pushout for buffer overflow management maximizes average fidelity. Last, we apply this framework to model a single repeater node to calculate the average fidelity of the end-to-end entanglement created by this repeater assuming perfect gate operations.
Quantum teleportation enables quantum information transmission, but requires distribution of entangled resource states. Unfortunately, decoherence, caused by environmental interference during quantum state storage, can degrade quantum states, leading to entanglement loss in the resource state and re-duction of the fidelity of the teleported information. In this work, we investigate the use of error correction and error syndrome information in scheduling teleportation at a quantum network node in the presence of multiple teleportation requests and a finite rate of remote entanglement distribution. Specifically, we focus on the scenario where stored qubits undergo decoherence over time due to imperfect memories. To protect the qubits from the resulting errors, we employ quantum encodings, and the stored qubits undergo repeated error correction, generating error syndromes in each round. These error syndromes can provide additional benefits, as they can be used to calculate qubit-specific error likelihoods, which can then be utilized to make better scheduling decisions. By integrating error correction techniques into the scheduling process, our goal is to minimize errors and decoherence effects, thereby enhancing the fidelity and efficiency of teleportation in a quantum network setting.
We investigate quantum teleportation through noisy quantum channels by solving analytically and numerically a master equation in the Lindblad form. We calculate the fidelity as a function of decoherence rates and angles of a state to be teleported. It is found that the average fidelity and the range of states to be accurately teleported depend on types of noises acting on quantum channels. If the quantum channels are subject to isotropic noise, the average fidelity decays to 1/2,1/2,1/2, which is smaller than the best possible value of 2/32/32/3 obtained only by the classical communication. On the other hand, if the noisy quantum channel is modeled by a single Lindblad operator, the average fidelity is always greater than 2/3.2/3.2/3.
Quantum networks (QNs) enable qubit transfer between distant nodes through quantum teleportation, which reconstructs a quantum state at a remote node by consuming a shared Bell pair. In multi-qubit quantum applications (QApps), the teleported qubits may need to remain stored in quantum memories until execution can start, while decoherence progressively reduces their fidelity with respect to the ideal target state. Such QApps can operate only if all teleported qubits simultaneously satisfy a minimum fidelity threshold. In this paper, we study how many qubits can be teleported under this fidelity-constrained operation in a two-node QN. To this end, we define a QApplevel reliability metric as the probability that all end-to-end Bell pairs satisfy the target fidelity when the multi-qubit teleportation stage is completed. We then develop a Monte Carlo simulator that captures stochastic Bell-pair generation, Quantum Repeater (QR)-assisted entanglement distribution, and fidelity degradation. The analysis considers fiber-based and terrestrial free-space optical (FSO) quantum links, as well as representative NV-center- and trapped-ion-based quantum memories. Results show that memory coherence is the main scalability bottleneck under stringent fidelity targets, while parallel entanglement generation is essential for multi-qubit teleportation.
Abstract Quantum teleportation as the key strategy for quantum communication requires pure maximally shared entangled states among quantum nodes. In practice, quantum decoherence drastically degrades the shared entanglement during entanglement distribution, which is a serious challenge for the development of quantum networks. However, most of the decoherence control strategies proposed thus far are either resource-intensive or time-consuming. To overcome this obstacle, we enable noise-resistant teleportation through a noisy channel with a limited number of qubits and without applying time-consuming weak measurements. We apply a quantum gate control unit consisting of a controlled NOT gate and a rotation gate after the original teleportation protocol is accomplished. Furthermore, we demonstrate that a teleportation fidelity of unity is attainable when environment-assisted measurement is added to the proposed teleportation protocol via quantum gates. Moreover, we present an entanglement distribution process by employing the designed quantum gate control unit followed by the deterministic standard teleportation protocol to improve teleportation fidelity by establishing improved shared entanglement. Our performance analysis indicates that the proposed teleportation schemes offer a competitive fidelity and success probability compared with the conventional schemes and a recent weak measurement-based teleportation protocol.
Transmitting unknown quantum states to distant locations is crucial for distributed quantum information protocols. The seminal quantum teleportation scheme achieves this feat while requiring prior maximal entanglement between the sender and receiver. In scenarios with noisy entangled states, optimal teleportation fidelity characterizes the efficacy of transmitting the state, demanding the proper selection of local operations at the sender's and receiver's ends. The complexity escalates further in long-range communication setups, prompting the consideration of a repeater-based approach, which incorporates arrays of nodes with multiple segments to facilitate the efficient transmission of quantum information. The fidelity of the communication line gets degraded even if a single segment is affected by noise. In such cases, the general wisdom employs the standard entanglement swapping protocol involving maximally entangled states across the noiseless segments and applying maximally entangled basis measurement at the corresponding nodes to achieve optimal fidelity. In this Letter, we propose a more efficient protocol for a certain class of noisy states, achieving the same fidelity as the standard protocol while consuming less amount of entanglement. Our approach ensures optimal teleportation fidelity even when the end-to-end state gets noisier, and thus promises efficient utility of quantum resources in repeater-based distributed quantum protocols.
Quantum computing promises computational capabilities beyond those of classical systems by exploiting superposition, entanglement, and quantum interference. However, the scalability of current noisy intermediate-scale quantum (NISQ) devices is limited by physical and engineering constraints, restricting the number of available qubits. Distributed quantum computing (DQC) mitigates this limitation by interconnecting multiple quantum processing units (QPUs) via quantum networks capable of distributing high-fidelity entanglement. Realizing such networks requires overcoming probabilistic entanglement generation, finite memory coherence, photon loss, and architectural constraints. This dissertation conducts an in-depth and comprehensive study of resource allocation in quantum networks, aiming to support high-throughput and high-fidelity entanglement distribution over lossy infrastructures. Our work spans the quantum networking stack, from physical-layer entanglement distribution protocols to network planning, quantum storage architectures, and distributed quantum computing. We begin by introducing two asynchronous entanglement distribution protocols-Sequential and Parallel-designed for early-stage quantum networks without global synchronization. Unlike many prior models, our protocols account for classical communication delays and quantum memory decoherence, reflecting practical constraints. Through simulations on real-world topologies such as SURFnet, we show that simple mechanisms such as cutoff-based memory management and sequential asynchronous entanglement distribution protocols can deliver competitive performance while significantly simplifying coordination, narrowing the gap between theoretical proposals and deployable protocols. Next, we formulate quantum network planning as a utility maximization problem that jointly considers entanglement distribution rate and fidelity, treating repeater and memory placement as optimization variables. We propose scalable heuristics and mixed-integer formulations, evaluating them under realistic conditions such as finite coherence time of quantum memories, limited number of memories per repeaters and end nodes, and real network topologies such as ESNet. Our findings offer practical design guidance and highlight how optimal placements depend on underlying physical constraints. To support dynamic workloads and respond to traffic bursts, we propose the Quantum Storage Network (QSN) architecture, where storage nodes buffer EPR pairs in advance of demand as an overlay network. This temporal decoupling improves responsiveness and throughput. Simulations across multiple topologies show that QSNs reduce entanglement distribution service latency by up to 40% and provide improved robustness compared to non-overlay designs, underscoring the value of storage-aware planning in future quantum networks. Finally, we focus on DQC, where large-scale quantum circuits are executed across networked QPUs. We propose a window-based circuit partitioning algorithm that minimizes nonlocal gate execution while balancing load across QPUs. Building on this partitioning, we design an adaptive, dependency-aware entanglement generation scheduler that opportunistically initiates remote entanglement as soon as dependent gates are ready, while accounting for realistic constraints such as coherence limits, probabilistic link generation, and Bell-state measurement (BSM) contention. Applied to benchmark circuits such as QAOA and QFT, this joint approach reduces execution delay by up to 35%. We further perform a two-qubit gate fidelity-sensitivity analysis under to show when the distributed quantum computing can be beneficial. Results show that the number of QPUs significantly impacts sensitivity to non-local gate fidelity: with fewer QPUs, distributed execution can outperform monolithic execution under looser fidelity constraints, whereas with more QPUs, achieving the same advantage requires substantially higher non-local gate fidelities relative to local gate fidelities. These findings identify the parameter regimes in which distributed quantum computing is beneficial, mapping break-even regions (as a function of number of QPUs) and quantifying how much cross-QPU (non-local) gate fidelity must improve—or, equivalently, how much per-QPU local gate fidelity must improve under modularization—for distributed execution to outperform a monolithic baseline. Together, these contributions form a cohesive framework for resource allocation in quantum networks in order to build scalable, delay-tolerant quantum networks and distributed computing systems. By grounding architectural design in realistic physical assumptions, this work advances the state of the art from theoretical modeling to practical, deployable quantum infrastructure.