On weak odd domination and graph-based quantum secret sharing

DOI10.1016/j.tcs.2015.05.038zbMath1329.68118arXiv1112.2495OpenAlexW1562747616MaRDI QIDQ496043

Sylvain Gravier, Simon Perdrix, Jérôme Javelle, Mehdi Mhalla

Publication date: 16 September 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.2495

zbMATH Keywords

complexitygraph theoryNP-completenessquantum information

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Authentication, digital signatures and secret sharing (94A62) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer ⋮ On the complexity of finding large odd induced subgraphs and odd colorings

Cites Work

• Parity dimension for graphs
• Linear cellular automata and the garden-of-eden
• Which Graph States are Useful for Quantum Information Processing?
• New Protocols and Lower Bounds for Quantum Secret Sharing with Graph States
• Finding Optimal Flows Efficiently
• A Finite Gilbert–Varshamov Bound for Pure Stabilizer Quantum Codes
• A constructive proof of the general lovász local lemma
• The One Way to Quantum Computation
• The σ-Game and Cellular Automata
• 1-perfect codes in Sierpiński graphs
• Graph states for quantum secret sharing
• MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS
• Graph concatenation for quantum codes
• A single quantum cannot be cloned
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On weak odd domination and graph-based quantum secret sharing