Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2410.13575 · Communications in Mathematical Physics

Third Moments of Qudit Clifford Orbits and 3-Designs Based on Magic Orbits

Huangjun Zhu, Chengsi Mao, Changhao Yi

Published Sep 27, 2026• 0 citations
arXivHTMLPDF
DOI
10.1007/s00220-026-05583-8

Related papers

ON t-DESIGNS AND GENERALISED COHERENT STATES

P. S. TURNER

WORLD SCIENTIFIC eBooks•Aug 14, 2013•0 citations

Qudit Shadow Estimation Based on the Clifford Group and the Power of a Single Magic Gate

Chengsi Mao, Changhao Yi, Huangjun Zhu

Shadow estimation is a sample-efficient protocol for learning the properties of a quantum system using randomized measurements, but the current understanding of qudit shadow estimation is quite limited compared with the qubit setting. Here, we clarify the sample complexity of qudit shadow estimation based on the Clifford group, where the local dimension d is an odd prime. Notably, we show that the overhead of qudit shadow estimation over the qubit counterpart is only O(d), which is independent of the qudit number n, although the set of stabilizer states may deviate exponentially from a 3-design with respect to the third moment operator. Furthermore, by adding one layer of magic gates, we propose a simple circuit that can significantly boost the efficiency. Actually, a single magic gate can already eliminate the O(d) overhead in qudit shadow estimation and bridge the gap from the qubit setting.

arXiv:2410.13572•Physical Review Letters•Apr 21, 2025•8 citations

Novel Qubit Designs

L. B. Ioffe

Bulletin of the American Physical Society•Mar 2, 2020•0 citations

Clifford and Haar scramblers yield equal mean fidelity but unequal fluctuations in black hole-inspired teleportation

Sudhanva Joshi, Sunil Kumar Mishra

Quantum information transfer between entangled black holes has inspired many-body teleportation protocols. We study such a protocol without assuming a gravitational dual and ask whether its fidelity requires nonstabilizerness, or magic, in the scrambling dynamics. Because the mean fidelity depends only on the third moments of the scrambler ensemble, zero-magic Clifford scramblers teleport on average as well as Haar-random unitaries. Solving the protocol exactly at infinite temperature, we find that typical Clifford scramblers approach perfect teleportation while the magic of the complete circuit vanishes as the inverse system size. The two ensembles nevertheless differ in their fluctuations: the exact Clifford fidelity variance decays only algebraically with system size, whereas the Haar variance is exponentially small. This separation characterizes the ensembles rather than magic itself, since magic added away from the message qubit can leave every fidelity statistic unchanged. With a decoder uncorrelated with the scrambler, every unitary 2-design leaves the mean fidelity at the no-transfer value, whatever its magic.

quant-pharXiv:2606.19180•Jun 18, 2026•0 citations

Strength-Two Trades and Transversal Cubic Gates: The Clebsch Cubic-Phase Codes and Their Magic

Tavis Rudd

Strength-two signed trades define high-rate error-detecting qudit codes whose surviving third moment is a transversal logical cubic phase. The paper studies conic-matching examples through exact Hessian-rank and Pauli spectra. The ten-qudit example over the field of eleven elements is not Clifford-equivalent to a product across any bipartition. For the six-qudit example over the field of seven elements, exact enumerators prove a resource advantage over specified independent primitive-distillation menus for independent uniform Z noise, ideal Clifford operations, and input error between zero and one percent. A chordal restriction identifies the Clifford action of geometric sign choices. The scholarly supplement records finite computations and their trust boundaries; no Lean coverage is claimed.

•Sep 8, 2026•0 citations

Quantum structures in qudit spaces

Roberto Leporini, Cesarino Bertini

Theoretical Computer Science•Dec 2, 2017•1 citation
Shadow estimation is a sample-efficient protocol for learning the properties of a quantum system using randomized measurements, but the current understanding of qudit shadow estimation is quite limited compared with the qubit setting. Here, we clarify the sample complexity of qudit shadow estimation based on the Clifford group, where the local dimension d is an odd prime. Notably, we show that the overhead of qudit shadow estimation over the qubit counterpart is only O(d), which is independent of the qudit number n, although the set of stabilizer states may deviate exponentially from a 3-design with respect to the third moment operator. Furthermore, by adding one layer of magic gates, we propose a simple circuit that can significantly boost the efficiency. Actually, a single magic gate can already eliminate the O(d) overhead in qudit shadow estimation and bridge the gap from the qubit setting.
Quantum information transfer between entangled black holes has inspired many-body teleportation protocols. We study such a protocol without assuming a gravitational dual and ask whether its fidelity requires nonstabilizerness, or magic, in the scrambling dynamics. Because the mean fidelity depends only on the third moments of the scrambler ensemble, zero-magic Clifford scramblers teleport on average as well as Haar-random unitaries. Solving the protocol exactly at infinite temperature, we find that typical Clifford scramblers approach perfect teleportation while the magic of the complete circuit vanishes as the inverse system size. The two ensembles nevertheless differ in their fluctuations: the exact Clifford fidelity variance decays only algebraically with system size, whereas the Haar variance is exponentially small. This separation characterizes the ensembles rather than magic itself, since magic added away from the message qubit can leave every fidelity statistic unchanged. With a decoder uncorrelated with the scrambler, every unitary 2-design leaves the mean fidelity at the no-transfer value, whatever its magic.
Strength-two signed trades define high-rate error-detecting qudit codes whose surviving third moment is a transversal logical cubic phase. The paper studies conic-matching examples through exact Hessian-rank and Pauli spectra. The ten-qudit example over the field of eleven elements is not Clifford-equivalent to a product across any bipartition. For the six-qudit example over the field of seven elements, exact enumerators prove a resource advantage over specified independent primitive-distillation menus for independent uniform Z noise, ideal Clifford operations, and input error between zero and one percent. A chordal restriction identifies the Clifford action of geometric sign choices. The scholarly supplement records finite computations and their trust boundaries; no Lean coverage is claimed.