Access structure in graphs in high dimension and application to secret sharing
arXiv:1304.7105 · doi:10.4230/LIPIcs.TQC.2013.308
Abstract
We give graphical characterisation of the access structure to both classical and quantum information encoded onto a multigraph defined for prime dimension , as well as explicit decoding operations for quantum secret sharing based on graph state protocols. We give a lower bound on for the existence of a scheme and prove, using probabilistic methods, that there exists such that a random multigraph has an accessing parameter with high probability.
arXiv comment18 pages, 2 figures
References in corpus (16)
- Quantum secret sharing
- How to share a quantum secret
- Multi-party entanglement in graph states
- Graphical description of the action of local Clifford transformations on graph states
- Security Proof for Quantum Key Distribution Using Qudit Systems
- Quantum secret sharing with qudit graph states
- Reducing the quantum communication cost of quantum secret sharing
- Generalized Semi-Quantum Secret Sharing Schemes
- On the equivalence between sharing quantum and classical secrets, and error correction
- Graph States Under the Action of Local Clifford Group in Non-Binary Case
- The GHZ state in secret sharing and entanglement simulation
- Location of quantum information in additive graph codes
- New Protocols and Lower Bound for Quantum Secret Sharing with Graph States
- On Weak Odd Domination and Graph-based Quantum Secret Sharing
- Parametrized Complexity of Weak Odd Domination Problems
- Optimal accessing and non-accessing structures for graph protocols