Tools for quantum network design

Azuma, Koji; Bäuml, Stefan; Coopmans, Tim; Elkouss, David; Li, Boxi

doi:10.1116/5.0024062

Cited by 50 publications

(38 citation statements)

References 200 publications

(297 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another scenario in which the completion time probability distribution is brought back to a known form includes the discarding of entanglement [35,36]. See [37] for a review of the completion time analysis for entanglement distribution schemes.…”

Section: Introductionmentioning

confidence: 99%

Improved analytical bounds on delivery times of long-distance entanglement

2022

Self Cite

View full text Add to dashboard Cite

The ability to distribute high-quality entanglement between remote parties is a necessary primitive for many quantum communication applications. A large range of schemes for realizing the long-distance delivery of remote entanglement has been proposed, for both bipartite and multipartite entanglement. For assessing the viability of these schemes, knowledge of the time at which entanglement is delivered is crucial. Specifically, if the communication task requires multiple remote-entangled quantum states and these states are generated at different times by the scheme, the earlier states will need to wait and thus their quality will decrease while being stored in an (imperfect) memory. For the remote-entanglement delivery schemes which are closest to experimental reach, this time assessment is challenging, as they consist of nondeterministic components such as probabilistic entanglement swaps. For many such protocols even the average time at which entanglement can be distributed is not known exactly, in particular when they consist of feedback loops and forced restarts. In this work, we provide improved analytical bounds on the average and on the quantiles of the completion time of entanglement distribution protocols in the case that all network components have success probabilities lower bounded by a constant. A canonical example of such a protocol is a nested quantum repeater scheme which consists of heralded entanglement generation and entanglement swaps. For this scheme specifically, our results imply that a common approximation to the mean entanglement distribution time, the 3-over-2 formula, is in essence an upper bound to the real time. Our results rely on a novel connection with reliability theory.

show abstract

Section: Introductionmentioning

confidence: 99%

Improved analytical bounds on delivery times of long-distance entanglement

2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…Therefore, PEN states are those that can be generated by only distributing bipartite entanglement among different pairs of parties. Thus, they constitute a realistic class of multipartite states that are relatively simple to prepare, underlying the current investigations on quantum networks as platforms for quantum information processing [40]. Moreover, their convenient mathematical structure makes it possible to exploit the much better developed theory of bipartite entanglement in order to analyze the complex structure of entanglement in the multipartite scenario, as the proof of Theorem 2 further exemplifies.…”

Section: Discussionmentioning

confidence: 99%

“…However, contrary to the set of biseparable states, the set of non-GNME is not closed under LOCC manipulation and relevant resources in this paradigm do not pass the GNME test. This is the case, for instance, of PEN states that underpin protocols held in quantum networks [40] (such as the star network in which a powerful central laboratory prepares entangled states for satellite nodes [41]). Indeed, if all parties share sufficient bipartite entanglement as to enable perfect teleportation any state of any given local dimension can be obtained from them and they are, therefore, universal resources in the standard paradigm of state manipulation under LOCC.…”

Section: Discussionmentioning

confidence: 99%

Genuine multipartite entanglement of quantum states in the multiple-copy scenario

Palazuelos,

de Vicente

2022

Preprint

View full text Add to dashboard Cite

Genuine multipartite entanglement (GME) is considered a powerful form of entanglement since it corresponds to those states that are not biseparable, i.e. a mixture of partially separable states across different bipartitions of the parties. In this work we study this phenomenon in the multiple-copy regime, where many perfect copies of a given state can be produced and controlled. In this scenario the above definition leads to subtle intricacies as biseparable states can be GME-activatable, i.e. several copies of a biseparable state can display GME. We show that the set of GME-activatable states admits a simple characterization: a state is GME-activatable if and only if it is not partially separable across one bipartition of the parties. This leads to the second question of whether there is a general upper bound in the number of copies that needs to be considered in order to observe the activation of GME, which we answer in the negative. In particular, by providing an explicit construction, we prove that for any number of parties and any number k ∈ N there exist GMEactivatable multipartite states of fixed (i.e. independent of k) local dimensions such that k copies of them remain biseparable.

show abstract

“…Network end-nodes will comprise of a variety of QCs, heterogeneous in terms of base technology, and quantum sensing nodes. Many simulation tools are emerging as an effort to study how resources and applications are allo-cated in quantum network architectures [33][34][35] -see [36,Section 6] or [37] for a summary of related work. A major challenge to date involves developing high-efficiency and high-fidelity methods from matter qubits used primarily and processors and mobile qubits used in transfers.…”

Section: A Two Major Regimes In Quantum Networkingmentioning

confidence: 99%

Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation

LaRacuente¹,

Smith²,

Imany³

et al. 2022

Preprint

View full text Add to dashboard Cite

A core challenge for superconducting quantum computers is to scale up the number of qubits in each processor without increasing noise or cross-talk. Distributing a quantum computer across nearby small qubit arrays, known as chiplets, could solve many problems associated with size. We propose a chiplet architecture over microwave links with potential to exceed monolithic performance on near-term hardware. We model and evaluate the chiplet architecture in a way that bridges the physical and network layers. We find concrete evidence that distributed quantum computing may accelerate the path toward useful and ultimately scalable quantum computers. In the long-term, short-range networks may underlie quantum computers just as local area networks underlie classical datacenters and supercomputers today.

show abstract

Tools for quantum network design

Cited by 50 publications

References 200 publications

Improved analytical bounds on delivery times of long-distance entanglement

Improved analytical bounds on delivery times of long-distance entanglement

Genuine multipartite entanglement of quantum states in the multiple-copy scenario

Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation

Contact Info

Product

Resources

About