# Quantum network reliability with perfect nodes

@inproceedings{Burgos2022QuantumNR, title={Quantum network reliability with perfect nodes}, author={Juan Manuel Burgos}, year={2022} }

. We introduce the concept of quantum reliability as an extension of the concept of network reliability in the context of quantum networks. We show that this concept is intimately related to the concept of quantum reliability operator that we also introduce and show a Negami like splitting formula for it. Considering that the simple factorization formula for classical networks which is the basis of most of the calculation algorithms does not hold in the quantum context due to entanglement, a…

## References

SHOWING 1-10 OF 18 REFERENCES

### Towards Large-Scale Quantum Networks

- Computer Science, PhysicsNANOCOM
- 2019

A gentle introduction to quantum networking targeted at computer scientists, and the state of the art is surveyed to discuss key challenges for computer science in order to make such networks a reality.

### General monogamy inequality for bipartite qubit entanglement.

- PhysicsPhysical review letters
- 2006

We consider multipartite states of qubits and prove that their bipartite quantum entanglement, as quantified by the concurrence, satisfies a monogamy inequality conjectured by Coffman, Kundu, and…

### Is entanglement monogamous?

- PhysicsIBM J. Res. Dev.
- 2004

By considering the question of whether entanglement is "monogamous," Charles Bennett's influence on modern quantum information theory is illustrated and the recent answers to this entanglements question are reviewed.

### On the Problem of Hidden Variables in Quantum Mechanics

- Physics
- 1966

The demonstrations of von Neumann and others, that quantum mechanics does not permit a hidden variable interpretation, are reconsidered. It is shown that their essential axioms are unreasonable. It…

### Distributed Entanglement

- Physics
- 1999

Consider three qubits A, B, and C which may be entangled with each other. We show that there is a trade-oﬀ between A’s entanglement with B and its entanglement with C. This relation is expressed in…

### Factorization of network reliability with perfect nodes II: Connectivity matrix

- Computer Science, MathematicsDiscret. Appl. Math.
- 2016

### The Combinatorics of Network Reliability

- Computer Science
- 1987

The reliability polynominal Edge-disjoint subgraphs Additive and multiplicative improvements Combining the bounds The k-cycle bound Computational results References Index.

### Measures on the Closed Subspaces of a Hilbert Space

- Mathematics
- 1957

In his investigations of the mathematical foundations of quantum mechanics, Mackey1 has proposed the following problem: Determine all measures on the closed subspaces of a Hilbert space. A measure on…

### Singularities in Negami's splitting formula for the Tutte polynomial

- MathematicsDiscret. Appl. Math.
- 2018

### The Lattice of Non-crossing Partitions and the Birkhoff-Lewis Equations

- MathematicsEur. J. Comb.
- 1994

Abstract A matrix associated with the chromatic join of non-crossing partitions has been introduced by Tutte to generalise the Birkhoff-Lewis equations. A conjecture is given for its determinant in…