Vertex-minor universal graphs for generating entangled quantum subsystems

DOI10.4230/LIPICS.ICALP.2024.36MaRDI QIDQ6875172zbMATH OpenFDO

Authors Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2024.36

zbMATH Keywords

\(k\)-pairabilitygraph statesquantum networksvertex-minors

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Entanglement distillation from Greenberger-Horne-Zeilinger shares
• Graph states for quantum secret sharing
• Multi-partite quantum cryptographic protocols with noisy GHZ states
• New protocols and lower bounds for quantum secret sharing with graph states
• Quantum coordinated multi-point communication based on entanglement swapping
• Transforming graph states using single-qubit operations
• Vertex-minor universal graphs for generating entangled quantum subsystems

Cited in

(4)

• Vertex-minor universal graphs for generating entangled quantum subsystems
• Covering a graph with minimal local sets
• Local equivalence of stabilizer states: a graphical characterisation
• Deciding local unitary equivalence of graph states in quasi-polynomial time

This page was built for publication: Vertex-minor universal graphs for generating entangled quantum subsystems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875172)