Quantum Consensus: an overview

Marcozzi, Marco; Mostarda, Leonardo

doi:10.48550/arxiv.2101.04192

Cited by 4 publications

(5 citation statements)

References 18 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, we can make the algorithm more efficient by assuming the usage parameter values to be 50%. 9 We refer to the O(n 5 ) algorithm with the above assumptions as DP-Approx, and the O(n 5 (log n) 4 ) algorithm based on (5) as DP-OPT. Both algorithms use throttling after the DP formulation.…”

Section: Constraint On Number Of Leavesmentioning

confidence: 99%

“…Quantum networks (QNs) enable the construction of large, robust, and more capable quantum computing platforms by connecting smaller QCs. Quantum networks [4] also enable various important applications [5]- [9]. However, quantum network communication is challenging -e.g., physical transmission of quantum states across nodes can incur irreparable communication errors, as the No-cloning Theorem [10] proscribes making independent copies of arbitrary qubits.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Quantum Network Communication Using Optimized Entanglement Swapping Trees

Ghaderibaneh

Zhan

Gupta

et al. 2022

IEEE Trans. Quantum Eng.

View full text Add to dashboard Cite

show abstract

Section: Constraint On Number Of Leavesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficient Quantum Network Communication Using Optimized Entanglement Swapping Trees

Ghaderibaneh

Zhan

Gupta

et al. 2022

IEEE Trans. Quantum Eng.

View full text Add to dashboard Cite

show abstract

“…Note that for any (s, d) EP request, we already know the SL that we will use in its swapping-tree-since, such assignment of SLs to (s, d) pairs is implicitly already done during selection of SLs. 10 For a given (s, d) pair request, let (x, y) be the SL used. Now, consider the sequence of nodes (i.e., the entanglement path) s, .…”

Section: Network Protocol and Implementationmentioning

confidence: 99%

“…Quantum networks (QNs) enable the construction of large, robust, and more capable quantum computing platforms by connecting smaller QCs. Quantum networks [5] also enable various important applications [6][7][8][9][10]. However, quantum network communication is challenging-e.g., physical transmission of quantum states across nodes can incur irreparable communication errors, as classical procedures such as amplified signals or retransmission cannot be applied due to quantum no-cloning [11,12].…”

Section: Introductionmentioning

confidence: 99%

Pre-Distribution of Entanglements in Quantum Networks

Ghaderibaneh¹,

Gupta²,

Ramakrishnan³

et al. 2022

Preprint

View full text Add to dashboard Cite

Quantum network communication is challenging, as the No-Cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only viable approach is teleportation of quantum states, which requires a prior distribution of entangled pairs (EPs) of qubits. Establishment of EPs across remote nodes can incur significant latency due to the low probability of success of the underlying physical processes. To reduce EP generation latency, prior works have looked at selection of efficient entanglement-routing paths and simultaneous use of multiple such paths for EP generation.In this paper, we propose and investigate a complementary technique to reduce EP generation latency-to pre-distribute EPs over certain (pre-determined) pairs of network nodes; these pre-distributed EPs can then be used to generate EPs for the requested pairs, when needed, with lower generation latency. For such an pre-distribution approach to be most effective, we need to address an optimization problem of selection of nodepairs where the EPs should be pre-distributed to minimize the generation latency of expected EP requests, under a given cost constraint. In this paper, we appropriately formulate the above optimization problem and design two efficient algorithms, one of which is a greedy approach based on an approximation algorithm for a special case. Via extensive evaluations over the NetSquid simulator [1], we demonstrate the effectiveness of our approach and developed techniques; we show that our developed algorithms outperform a naive approach by up to an order of magnitude.• We motivate and formulate the optimization problem of super-link selection (SLS): Given a set of node pairs {(s, d)} representing expected EPs requests, select a set S of super-links that results in minimum aggregate 1 An extreme pro-active approach could be to continuously generate EPs at the same node pairs as the ones that will be requested (or if unknown, at all the node pairs in the network), but this can be very wasteful of network resources and in many cases, may not be useful or even viable.

show abstract

“…Quantum Networks (QNs) enable the construction of large, robust, and more capable quantum computing platforms by connecting smaller QCs. Quantum networks [33] also enable various important applications [11,17,22,25,31]. However, quantum network communication is challenging -e.g., physical transmission of quantum states across nodes can incur irreparable communication errors, as the No-cloning Theorem [15] proscribes making independent copies of arbitrary qubits.…”

Section: Introductionmentioning

confidence: 99%

Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees

Ghaderibaneh,

Zhan,

Gupta

et al. 2021

Preprint

View full text Add to dashboard Cite

Quantum network communication is challenging, as the Nocloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only viable communication approach is teleportation of quantum states, which requires a prior distribution of entangled pairs (EPs) of qubits. 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. For the general setting, we develop an efficient iterative algorithm to compute a set of swapping trees. We present simulation results which show that our solutions outperform the prior approaches by an order of magnitude and are viable for long-distance entanglement generation.

show abstract

Quantum Consensus: an overview

Cited by 4 publications

References 18 publications

Efficient Quantum Network Communication Using Optimized Entanglement Swapping Trees

Efficient Quantum Network Communication Using Optimized Entanglement Swapping Trees

Pre-Distribution of Entanglements in Quantum Networks

Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees

Contact Info

Product

Resources

About