A hierarchical prefix-tree algorithm identifies the dominant Pauli coefficients of sparse quantum states using Bell sampling on two copies, with sample-complexity bounds tied to the number of coefficients and state purity.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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
-
Measuring the largest coefficients of a quantum state
A hierarchical prefix-tree algorithm identifies the dominant Pauli coefficients of sparse quantum states using Bell sampling on two copies, with sample-complexity bounds tied to the number of coefficients and state purity.
-
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.