Magic Secret Sharing distributes non-Clifford magic via GHZ entanglement and phase gates with (n-1,n) threshold security, experimentally validated on IBM hardware for the (2,3) case with C=0 for unauthorized parties.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3years
2026 3roles
background 1polarities
background 1representative citing papers
Efficient algorithms compute stabilizer Rényi entropy and mana for quantum states from vectors at O(N d^{2N}) cost using fast Hadamard transform, with open-source implementation.
A new fault-tolerant scheme called parity unfolding distills gates from any Clifford hierarchy level using 2^{k+3} + O(2^{k/2}) biased-noise qubits, cutting logical error rates by 43% and resources by 26% for arbitrary rotation synthesis compared to T-only distillation.
citing papers explorer
-
Magic Secret Sharing: Threshold Control of Quantum Computational Power via GHZ Entanglement
Magic Secret Sharing distributes non-Clifford magic via GHZ entanglement and phase gates with (n-1,n) threshold security, experimentally validated on IBM hardware for the (2,3) case with C=0 for unauthorized parties.
-
Computing quantum magic of state vectors
Efficient algorithms compute stabilizer Rényi entropy and mana for quantum states from vectors at O(N d^{2N}) cost using fast Hadamard transform, with open-source implementation.
-
Parity-unfolded distillation architecture for noise-biased platforms
A new fault-tolerant scheme called parity unfolding distills gates from any Clifford hierarchy level using 2^{k+3} + O(2^{k/2}) biased-noise qubits, cutting logical error rates by 43% and resources by 26% for arbitrary rotation synthesis compared to T-only distillation.