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
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 4years
2026 4roles
background 1polarities
background 1representative citing papers
Energy and heat measurements provide witnesses that certify quantum magic without full state tomography.
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.
Phase stripping reduces target-state magic to enable O(poly(n)) or O(1) sample fidelity estimation for phase-dominated states using a single fan-out gate plus nonlinear Pauli post-processing.
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.
-
Every Little Thing Heat Does Is Magic
Energy and heat measurements provide witnesses that certify quantum magic without full state tomography.
-
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.
-
Sample- and Hardware-Efficient Fidelity Estimation by Stripping Phase-Dominated Magic
Phase stripping reduces target-state magic to enable O(poly(n)) or O(1) sample fidelity estimation for phase-dominated states using a single fan-out gate plus nonlinear Pauli post-processing.