Hashing protocol for distilling multipartite Calderbank-Shor-Steane states

Hostens, Erik; Dehaene, Jeroen; Moor, Bart De

doi:10.1103/physreva.73.042316

Cited by 24 publications

(19 citation statements)

References 19 publications

(48 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Observe that noise due to transmission decrease the fidelity of network states relative to pure GHZ states. In order to deal with this channel noise we employ entanglement distillation protocols for two colorable graph states to generate high fidelity network states [20,39,[67][68][69][70][71][72][73][74]. Recall that the requested graph state is generated by connecting GHZ states (which are two colorable) via the connecting procedures of section 2.2.1 which the network devices apply.…”

Section: Security Considerations-trusted Networkmentioning

confidence: 99%

Modular architectures for quantum networks

Pirker¹,

Wallnöfer²,

Dür³

2018

New J. Phys.

130

View full text Add to dashboard Cite

We consider the problem of generating multipartite entangled states in a quantum network upon request. We follow a top-down approach, where the required entanglement is initially present in the network in form of network states shared between network devices, and then manipulated in such a way that the desired target state is generated. This minimizes generation times, and allows for network structures that are in principle independent of physical links. We present a modular and flexible architecture, where a multi-layer network consists of devices of varying complexity, including quantum network routers, switches and clients, that share certain resource states. We concentrate on the generation of graph states among clients, which are resources for numerous distributed quantum tasks. We assume minimal functionality for clients, i.e. they do not participate in the complex and distributed generation process of the target state. We present architectures based on shared multipartite entangled Greenberger-Horne-Zeilinger states of different size, and fully connected decorated graph states, respectively. We compare the features of these architectures to an approach that is based on bipartite entanglement, and identify advantages of the multipartite approach in terms of memory requirements and complexity of state manipulation. The architectures can handle parallel requests, and are designed in such a way that the network state can be dynamically extended if new clients or devices join the network. For generation or dynamical extension of the network states, we propose a quantum network configuration protocol, where entanglement purification is used to establish high fidelity states. The latter also allows one to show that the entanglement generated among clients is private, i.e. the network is secure.

show abstract

Section: Security Considerations-trusted Networkmentioning

confidence: 99%

Modular architectures for quantum networks

Pirker¹,

Wallnöfer²,

Dür³

2018

New J. Phys.

130

View full text Add to dashboard Cite

show abstract

“…Quantum hashing protocols [25,26,35,[41][42][43][44][45] are a type of entanglement purification protocol. They are based on the quantum analogon of the noiseless coding theorem [46,47] and rely on the fact that it is exponentially likely that the input states are in a so-called likely subspace.…”

Section: F Multipartite Quantum Hashing Protocolmentioning

confidence: 99%

Multipartite state generation in quantum networks with optimal scaling

Wallnöfer

Pirker

Zwerger

et al. 2019

Sci Rep

View full text Add to dashboard Cite

We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over arbitrary distances, with a constant overhead per node/channel that is independent of the distance. The approach is genuine multipartite, and is based on the measurement-based implementation of multipartite hashing, an entanglement purification protocol that operates on a large ensemble together with local merging/connection of elementary building blocks. We analyze the performance of the scheme in a setting where local or global storage is limited, and compare it to bipartite and hybrid approaches that are based on the distribution of entangled pairs. We find that the multipartite approach offers a storage advantage, which results in higher efficiency and better performance in certain parameter regimes. We generalize our approach to arbitrary network topologies and different target graph states.

show abstract

“…Distillation is better understood in the bipartite case [23][24][25][26] than in the multipartite case [27][28][29][30][31][32][33][34][35]. In the bipartite case, it is even known that some protocols achieve an optimal trade-off between rate and fidelity [36].…”

Section: Introductionmentioning

confidence: 99%

Protocols for creating and distilling multipartite GHZ states with Bell pairs

de Bone,

Ouyang,

Goodenough

et al. 2020

Preprint

View full text Add to dashboard Cite

The distribution of high-quality Greenberger-Horne-Zeilinger (GHZ) states is at the heart of many quantum communication tasks, ranging from extending the baseline of telescopes to secret sharing. They also play an important role in error-correction architectures for distributed quantum computation, where Bell pairs can be leveraged to create an entangled network of quantum computers. We investigate the creation and distillation of GHZ states out of non-perfect Bell pairs over quantum networks. In particular, we introduce a heuristic dynamic programming algorithm to optimize over a large class of protocols that create and purify GHZ states. All protocols considered use a common framework based on measurements of non-local stabilizer operators of the target state (i.e., the GHZ state), where each non-local measurement consumes another (non-perfect) entangled state as a resource. The new protocols outperform previous proposals for scenarios without decoherence and local gate noise. Furthermore, the algorithms can be applied for finding protocols for any number of parties and any number of entangled pairs involved.

show abstract

Hashing protocol for distilling multipartite Calderbank-Shor-Steane states

Cited by 24 publications

References 19 publications

Modular architectures for quantum networks

Modular architectures for quantum networks

Multipartite state generation in quantum networks with optimal scaling

Protocols for creating and distilling multipartite GHZ states with Bell pairs

Contact Info

Product

Resources

About