Quantum secret sharing with qudit graph states

Abstract

We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

13 pages, 12 figures. v2: Corrected to reflect imperfections of (n,n) QQ protocol. Also changed notation from $(n,m)$ to $(k,n)$, corrected typos, updated references, shortened introduction. v3: Updated acknowledgements

References in corpus (17)

• Quantum secret sharing
• Persistent entanglement in arrays of interacting particles
• Encoding a qubit in an oscillator
• How to share a quantum secret
• Experimental One-Way Quantum Computing
• Experimental entanglement of six photons in graph states
• On the Theory of Quantum Secret Sharing
• A new proof for the existence of mutually unbiased bases
• Graph States for Quantum Secret Sharing
• Graphical description of the action of local Clifford transformations on graph states
• A No-Go Theorem for Gaussian Quantum Error Correction
• Quantum Encodings in Spin Systems and Harmonic Oscillators
• Quantum Error Correcting Codes Using Qudit Graph States
• Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
• Information Flow in Secret Sharing Protocols
• Location of quantum information in additive graph codes
• Blind encoding into qudits

Cited by in corpus (59)

• Advances in Quantum Cryptography
• Qudits and high-dimensional quantum computing
• Unconditional security of entanglement-based continuous-variable quantum secret sharing
• Experimental demonstration of graph-state quantum secret sharing
• Quantum secret sharing with continuous-variable cluster states
• Quantum secret sharing with polarization-entangled photon pairs
• Quantum cryptography: key distribution and beyond
• Characterizing Genuine Multilevel Entanglement
• Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism
• Quantum Router with Network Coding
• Conditional Mutual Information of Bipartite Unitaries and Scrambling
• Multi-party quantum private comparison of size relation with d-level single-particle states
• Absolutely Maximally Entangled Qudit Graph States
• Circular multi-party quantum private comparison with n-level single-particle states
• Generalized Semi-Quantum Secret Sharing Schemes
• On the equivalence between sharing quantum and classical secrets, and error correction
• A verifiable framework of entanglement-free quantum secret sharing with information-theoretical security
• Retrieving and Routing Quantum Information in a Quantum Network
• Device Independent Quantum Secret Sharing in Arbitrary Even Dimension
• Accessing quantum secrets via local operations and classical communication
• Effect of induced transition on the quantum entanglement and coherence in two-coupled double quantum dots system
• Robust and efficient verification of graph states in blind measurement-based quantum computation
• Universal quantum computing using $({\mathbb{Z}}_d{)}^3$ symmetry-protected topologically ordered states
• Graph-state formalism for mutually unbiased bases
• Sequential Quantum Secret Sharing in a Noisy Environment aided with Weak Measurements
• Approximate reconstructability of quantum states and noisy quantum secret sharing schemes
• Qudit Hypergraph States
• Generalized cluster states from Hopf algebras: non-invertible symmetry and Hopf tensor network representation
• Examining the dimensionality of genuine multipartite entanglement
• New Protocols and Lower Bound for Quantum Secret Sharing with Graph States
• On Weak Odd Domination and Graph-based Quantum Secret Sharing
• Preserving multi-level quantum coherence by dynamical decoupling
• Differential Phase Shift Quantum Secret Sharing Using a Twin Field with Asymmetric Source Intensities
• Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems
• On the local equivalence of complete bipartite and repeater graph states
• Quantum secret aggregation utilizing a network of agents
• Calculating Concentratable Entanglement in Graph States
• An Overview of CV-MDI-QKD
• Generation of complete graph states in a spin-$1/2$ Heisenberg chain with a globally optimized magnetic field
• Advance sharing of quantum shares for classical secrets
• Bounds on the Information Rate of Quantum Secret Sharing Schemes
• Entropic Inequalities for a Class of Quantum Secret Sharing States
• Equivalence of Local Complementation and Euler Decomposition in the Qutrit ZX-calculus
• Measurement-based quantum computation using two-component BECs
• Finite-Function-Encoding Quantum States
• Non-symmetric GHZ states: weighted hypergraph and controlled-unitary graph representations
• On The Stabilizer Formalism And Its Generalization
• Secure quantum carriers for quantum state sharing
• Revocation and Reconstruction of Shared Quantum States
• Cooperation and dependencies in multipartite systems
• Maximally nonlocal subspaces
• Planar two-region multi-partite maximally entangled states
• Qudit Clauser-Horne-Shimony-Holt Inequality and Nonlocality from Wigner Negativity
• $\chi$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays
• Measurement-based quantum computation utilizing the graph states of Bose-Einstein condensates and continuous variables
• Qudit Noisy Stabilizer Formalism
• Revocation and Reconstruction of Shared Quantum States
• Access structure in graphs in high dimension and application to secret sharing
• Sharing classical secrets with continuous-variable entanglement: Composable security and network coding advantage