An autoregressive sampler draws Pauli strings sequentially from computable conditionals to enable linear-cost fidelity estimation for random matrix product states, with a grouped commuting extension to lower variance.
Heralded Polynomial-Time Quantum State Tomography
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
We describe an algorithm for quantum state tomography that converges in polynomial time to an estimate, together with a rigorous error bound on the fidelity between the estimate and the true state. The result suggests that state tomography on large quantum systems may be much more feasible than the exponential size of state space suggests. In many situations, the correctness of the state estimate can be certified from the data alone, with no a priori assumptions on the form of the measured state.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.
citing papers explorer
-
Verifying random matrix product states with autoregressive local measurements
An autoregressive sampler draws Pauli strings sequentially from computable conditionals to enable linear-cost fidelity estimation for random matrix product states, with a grouped commuting extension to lower variance.
-
Entanglement Certification $-$ From Theory to Experiment
Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.