{
  "abstract": "We introduce Magic Secret Sharing (MSS), a quantum cryptographic primitive in which the secret is the computational capability of a quantum state rather than its classical description. In the resource theory of magic, non-stabilizer states fuel universal quantum computation via non-Clifford gates; MSS distributes this resource with an (n-1,n) threshold structure using a pre-shared GHZ state and a single local phase gate P(phi) = diag(1, exp(i*phi)). Any individual party holds the maximally mixed state I/2, with Wigner distance C(I/2) = 0, so no local operation can yield non-Clifford computational advantage regardless of what operations are applied or what noise acts on the device. The authorised coalition reconstructs magic content C(phi) = (|sin(phi)| + |cos(phi)| - 1)/2 exactly, enabling a logical T gate via gate teleportation in multi-server blind quantum computation (BQC). Among diagonal parametric gates, phase gates are the unique class satisfying the security condition, characterised via an exact column-sum condition. The protocol is elevated to a one-sided device-independent (1SDI) setting via a steering inequality: the assemblage produced on the recipient's side certifies magic delivery without trusting the coalition's devices. We demonstrate the (2,3) instance on ibm_marrakesh (156-qubit IBM Heron): security (C(rho_Bob) < 10^-6, the linear-programming solver tolerance) holds in every run and is independently reproduced on a second qubit assignment, and state fidelity reaches 0.959-0.973 for the authorised party, with faithfulness confirmed for all four test values of phi to within 0.025 in magic content, a residual that depolarising noise alone accounts for.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2605.16614",
  "author_total": 2,
  "authors": [
    {
      "name": "Soumyojyoti Dutta"
    },
    {
      "name": "Tushar"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/5kkhtm3fcj5q8.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2605.16614",
  "fulltext_url": null,
  "id": "5kkhtm3fcj5q8",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2605.16614",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Information and Cryptography"
    ]
  ],
  "openalex": "W7161702094",
  "pdf_url": "https://arxiv.org/pdf/2605.16614",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-06",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/5kkhtm3fcj5q8.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:22Z",
      "native_id": "2605.16614",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2605.16614"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Magic Secret Sharing: Threshold Control of Quantum Computational Power via GHZ Entanglement",
  "title_text": "Magic Secret Sharing: Threshold Control of Quantum Computational Power via GHZ Entanglement",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:22Z",
  "url": "https://research.draconitic.com/paper/5kkhtm3fcj5q8",
  "venue": "arXiv",
  "versions": []
}