aiqbench analysis
This research introduces Magic Secret Sharing (MSS), a novel quantum cryptographic primitive that distributes computational power via GHZ entanglement rather than classical data. By utilizing phase gates to reconstruct non-stabilizer states, the protocol enables secure multi-server blind quantum computation with one-sided device-independent security guarantees. The team successfully validated this approach on IBM's 156-qubit Heron processor, demonstrating robust threshold control over universal quantum computational resources.
Magic Secret Sharing: Threshold Control of Quantum Computational Power via GHZ Entanglement
arXiv:2605.16614v2 Announce Type: replace 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: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.
arXiv:2605.16614 [quant-ph]
(or arXiv:2605.16614v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2605.16614 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 333 words
