We consider the problem of estimating the state of a large but finite number N of identical quantum systems. As N becomes large the problem simplifies dramatically. The only relevant measure of the quality of estimation becomes the mean quadratic error matrix. Here we present a bound on this quantity: a quantum Cram\'er-Rao inequality. This bound succinctly expresses how in the quantum case one can trade information about one parameter for information about another. The bound holds for arbitrary measurements on pure states, but only for separable measurements on mixed states---a striking example of nonlocality without entanglement for mixed but not for pure states. Cram\'er-Rao bounds are generally only derived for unbiased estimators. Here we give a version of our bound for biased estimators, and a simple asymptotic version for large N. Finally we prove that when the unknown state belongs to a two-dimensional Hilbert space our quantum Cram\'er-Rao bound can always be attained, and we provide an explicit measurement strategy that attains it. Thus we have a complete solution to the problem of estimating as efficiently as possible the unknown state of a large ensemble of qubits in the same pure state. The same is true for qubits in the same mixed state if one restricts oneself to separable measurements, but nonseparable measurements allow dramatic increase of efficiency. Exactly how much increase is possible is a major open problem.
Given a large number N of copies of a qubit state of which we wish to estimate its purity, we prove that separable-measurement protocols can be as efficient as the optimal joint-measurement one if classical communication is used. This shows that the optimal estimation of the entanglement of a two-qubit state can also be achieved asymptotically with fully separable measurements. Thus, quantum memories provide no advantage in this situation. The relationship between our global Bayesian approach and the quantum Cramér-Rao bound is discussed.
We analyse the reconstruction of an unknown pure qubit state. We derive the optimal guess that can be inferred from any set of measurements on N identical copies of the system with the fidelity as a figure of merit. We study in detail the estimation process with individual von Neumann measurements and demonstrate that they are very competitive as compared to (complicated) collective measurements. We compute the expressions of the fidelity for large
N and show that individual measurement schemes can perform optimally in the asymptotic regime.
Quantum state estimation is important for various quantum information processes, including quantum communications, computation, and metrology, which require the characterization of quantum states for evaluation and optimization. We present a three-stage adaptive method for estimating arbitrary
d-dimensional pure quantum states using locally informationally complete Fisher symmetric measurements (FSM) and a single-shot measurement basis. We derive finite-sample high-probability error bounds for the protocol and demonstrate that our approach scales as
O(d/N) for large sample sizes, thereby guaranteeing the advantage of adaptation. Moreover, numerical simulations indicate that the protocol achieves an average infidelity close to the optimal given by the Gill-Massar lower bound (GMB). The total number of measurement outcomes scales linearly with
7d−3, avoiding the need for collective measurements on multiple copies of the unknown state. This work highlights the potential of adaptive estimation techniques in quantum state characterization while maintaining efficiency in the number of measurement outcomes.
As quantum devices scale, quantifying how close an experimental state aligns with a target becomes both vital and challenging. Fidelity is the standard metric, but existing estimators either require full tomography or apply only to restricted state/measurement families. Huang, Preskill, and Soleimanifar (Nature Physics, 2025) introduced an efficient certification protocol for Haar-random states using only a polynomial number of non-adaptive, single-copy, local Pauli measurements. Here, we adopt the same data collection routine but recast it as a fidelity estimation protocol with rigorous performance guarantees and broaden its applicability. We analyze the bias in this estimator, linking its performance to the mixing time
τ of a Markov chain induced by the target state, and resolve the three open questions posed by Huang, Preskill, and Soleimanifar (Nature Physics, 2025). Our analysis extends beyond Haar-random states to state
t-designs, states prepared by low-depth random circuits, physically relevant states and families of mixed states. We introduce a
k-generalized local escape property that identifies when the fidelity estimation protocol is both efficient and accurate, and design a practical empirical test to verify its applicability for arbitrary states. This work enables scalable benchmarking, error characterization, and tomography assistance, supports adaptive quantum algorithms in high dimensions, and clarifies fundamental limits of learning from local measurements.