• Corpus ID: 252367672

Quantum network reliability with perfect nodes

@inproceedings{Burgos2022QuantumNR,
  title={Quantum network reliability with perfect nodes},
  author={Juan Manuel Burgos},
  year={2022}
}
  • J. M. Burgos
  • Published 19 September 2022
  • Physics, Computer Science
. 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… 

Figures from this paper

References

SHOWING 1-10 OF 18 REFERENCES

Towards Large-Scale Quantum Networks

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.

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?

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

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

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

The Combinatorics of Network Reliability

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

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

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

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