Develops an optimization-free disentangling algorithm and algebraic criterion for efficient CAMPS representations of Clifford circuits doped with αI+βP gates, enabling polynomial classical simulation for more circuits including typical N-T-gate random instances.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
Introduces permutation-agnostic distance measures to quantify non-stabiliserness consumption and shows structured variational methods use it more efficiently than unstructured ones with greater classical optimisation freedom.
Efficient witnesses and testing algorithms based on stabilizer Rényi entropy certify and quantify magic in mixed states, with experimental demonstration on IonQ hardware showing robustness under strong noise.
citing papers explorer
-
Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
Develops an optimization-free disentangling algorithm and algebraic criterion for efficient CAMPS representations of Clifford circuits doped with αI+βP gates, enabling polynomial classical simulation for more circuits including typical N-T-gate random instances.
-
Geometric and Resource-Theoretic Characterisation of Non-Stabiliserness in Quantum Algorithms
Introduces permutation-agnostic distance measures to quantify non-stabiliserness consumption and shows structured variational methods use it more efficiently than unstructured ones with greater classical optimisation freedom.
-
Efficient witnessing and testing of magic in mixed quantum states
Efficient witnesses and testing algorithms based on stabilizer Rényi entropy certify and quantify magic in mixed states, with experimental demonstration on IonQ hardware showing robustness under strong noise.