Moment-based tomography efficiently reconstructs Gaussian states, but stochastic phase noise generally produces mixed, non-Gaussian outputs. For approximately Gaussian outputs, we formulate reconstruction as a problem in quantum learning theory under model misspecification. Our trace-distance guarantee separates the intrinsic Gaussian approximation error from statistical errors in estimating the first moments and covariance matrix. Using recent Gaussian trace-distance bounds, we obtain linear dependence of the statistical contribution on moment errors when the covariance inverses remain bounded, improving on the square-root dependence on covariance error in earlier guarantees. A Fock-space truncation procedure provides certified, convergent lower and upper bounds on the intrinsic error. Under an explicit sub-Gaussian condition on the heterodyne outcomes, the sufficient sample count scales inversely with the square of the allowed statistical error remaining after accounting for the approximation error. We verify the statistical condition for stochastic phase rotations and heralded unitary-averaged states with bounded input squeezing. We apply the framework to probabilistic unitary averaging for phase noise reduction, quantifying reconstruction error and accounting for heralding overhead in the total number of estimation attempts.
Moment-based tomography efficiently reconstructs Gaussian states, but stochastic phase noise generally produces mixed, non-Gaussian outputs. For approximately Gaussian outputs, we formulate reconstruction as a problem in quantum learning theory under model misspecification. Our trace-distance guarantee separates the intrinsic Gaussian approximation error from statistical errors in estimating the first moments and covariance matrix. Using recent Gaussian trace-distance bounds, we obtain linear dependence of the statistical contribution on moment errors when the covariance inverses remain bounded, improving on the square-root dependence on covariance error in earlier guarantees. A Fock-space truncation procedure provides certified, convergent lower and upper bounds on the intrinsic error. Under an explicit sub-Gaussian condition on the heterodyne outcomes, the sufficient sample count scales inversely with the square of the allowed statistical error remaining after accounting for the approximation error. We verify the statistical condition for stochastic phase rotations and heralded unitary-averaged states with bounded input squeezing. We apply the framework to probabilistic unitary averaging for phase noise reduction, quantifying reconstruction error and accounting for heralding overhead in the total number of estimation attempts.
The exploration of tomography of bosonic Gaussian states is presumably as old as quantum optics, but only recently, their precise and rigorous study have been moving into the focus of attention, motivated by technological developments. In this work, we present an efficient and experimentally feasible Gaussian state tomography algorithm with provable recovery trace-distance guarantees, whose sample complexity depends only on the number of modes, and - remarkably - is independent of the state's photon number or energy, up to doubly logarithmic factors. Our algorithm yields a doubly-exponential improvement over existing methods, and it employs operations that are readily accessible in experimental settings: the preparation of an auxiliary squeezed vacuum, passive Gaussian unitaries, and homodyne detection. At its core lies an adaptive strategy that systematically reduces the total squeezing of the system, enabling efficient tomography. Quite surprisingly, this proves that estimating a Gaussian state in trace distance is generally more efficient than directly estimating its covariance matrix. Our algorithm is particularly well-suited for applications in quantum metrology and sensing, where highly squeezed - and hence high-energy - states are commonly employed. As a further contribution, we establish improved sample complexity bounds for standard heterodyne tomography, equipping this widely used protocol with rigorous trace-norm guarantees.
Quantum measurements are probabilistic and, in general, provide only partial information about the underlying quantum state. Obtaining a full classical description of an unknown quantum state requires the analysis of several different measurements, a task known as quantum-state tomography. Here we analyse the ultimate achievable performance in the tomography of continuous-variable systems, such as bosonic and quantum optical systems. We prove that tomography of these systems is extremely inefficient in terms of time resources, much more so than tomography of finite-dimensional systems such as qubits. Not only does the minimum number of state copies needed for tomography scale exponentially with the number of modes, but, even for low-energy states, it also scales unfavourably with the trace-distance error between the original state and its estimated classical description. On a more positive note, we prove that the tomography of Gaussian states is efficient by establishing a bound on the trace-distance error made when approximating a Gaussian state from knowledge of the first and second moments within a specified error bound. Last, we demonstrate that the tomography of non-Gaussian states prepared through Gaussian unitaries and a few local non-Gaussian evolutions is efficient and experimentally feasible.
Gaussian states of bosonic quantum systems enjoy numerous technological applications and are ubiquitous in nature. Their significance lies in their simplicity, which in turn rests on the fact that they are uniquely determined by two experimentally accessible quantities, their first and second moments. But what if these moments are only known approximately, as is inevitable in any realistic experiment? What is the resulting error on the Gaussian state itself, as measured by the most operationally meaningful metric for distinguishing quantum states, namely, the trace distance? In this work, we fully resolve this question by demonstrating that if the first and second moments are known up to an error ε , the trace distance error on the state also scales as ε , and this functional dependence is optimal. To prove this, we establish tight bounds on the trace distance between two Gaussian states in terms of the norm distance of their first and second moments. As an application, we improve existing bounds on the sample complexity of tomography of Gaussian states.
We give collective tomography protocols for quantum states and channels with known symmetries, using random purification and dilation to reduce learning to pure-state estimation. For states commuting with a compact-group representation with multiplicities mλ, the optimal copy complexity is Θ((∑λmλ2+logη−1)/ε2) for sufficiently small trace-distance error ε and failure probability η for the nontrivial case ∑λmλ2>1. For G-covariant channels with finite-dimensional unitary representations of a compact group G, parallel O(DG/ε2) queries achieve a diamond-distance error $\varepsilon $ at fixed success probability 2/3, where DG counts the real parameters of covariant Choi operators before imposing trace preservation. For permutation-covariant channels on k qudits of fixed local dimension d, at sufficiently small fixed error and fixed success probability 2/3, we obtain the optimal query scalings Θd(kd4−1) for diamond distance and Θd(kd4−d2) for Choi trace distance. Furthermore, we resolve an open problem in quantum tomography of constructing efficient quantum circuits that approximate the Hayashi measurement for optimal pure-state estimation. We encode states in the symmetric subspace into bosonic occupation modes, realize the measurement by heterodyne detection and normalization, and approximate this procedure on qubits using the quantum Hermite transform. Combined with our symmetry-compatible purification and dilation circuits, this yields query-optimal and gate-efficient learners of permutation-covariant states and channels with gate complexity Od(poly(k,ε−1,logη−1)).
We study the complexity of two closely related learning problems, one quantum and one classical. In the quantum setting, we consider agnostic tomography for the natural class of product mixed states. Given N copies of an n-qubit state ρ, the goal is to output a nearly optimal product mixed state approximation in trace distance. While recent work has focused on pure-state ansatz (e.g., product or stabilizer states), no polynomial-time guarantees were previously known for mixed-state ansatz. In the classical setting, we study robust learning of binary product distributions: given samples from an unknown distribution on 0,1n, the goal is to output a nearly optimal product approximation. Our main contributions are as follows. (1) We give a semi-agnostic tomography algorithm for product mixed states with polynomial sample and computational complexity achieving error O(optlog(1/opt)), where opt is the trace distance to the best product approximation. This is the first efficient algorithm with any nontrivial agnostic guarantee for mixed-state ansatz, using only single-qubit, single-copy measurements. We also prove a Quantum Statistical Query lower bound showing near-optimality, and an unconditional lower bound demonstrating that adaptivity is necessary under single-qubit measurements. (2) We give a semi-agnostic algorithm for robustly learning binary product distributions with matching guarantees and establish a Statistical Query lower bound, essentially resolving the efficient robust learnability of this class and improving on prior work since Diakonikolas et al. (2016).
We prove that learning an unknown mixed fermionic Gaussian state on m modes to trace distance ε requires Ω(m3/ε2) copies when measurements act on one copy at a time, even with arbitrary POVMs, fresh ancillas and classical adaptivity, but without quantum memory between copies. The bound holds for 0<ε≤1/3600 and separates this model from the known collective rate Θ(m2/ε2). It follows from a uniform single-copy Fisher-information budget and a dimension-independent comparison between trace distance and Gaussian parameters. On covariance matrices of operator norm at most 1−c, we prove a Frobenius-to-trace-norm continuity bound with constant [2c(2−c)]−1/2; matchgate shadows then attain O(m3/(cε2)) copies. This also gives explicit error certificates for thermal free-fermion states. For a class of mixed passive bosonic Gaussian states with total mean photon number at most one, a reduction to bounded-block qudit tomography gives a single-copy lower bound Ω(m3/(ε2log(m/ε))), versus collective complexity Θ(m2/ε2). These separations answer the mixed-state measurement-resource question posed by Chen et al. A two-mode example has optimal two-copy Fisher trace 5, versus the separable ceiling 4. An IBM replication gave a pre-registered witness lower bound 4.12 at one-sided 95% shot-noise confidence; its interpretation assumes the prescribed preparations and a common measurement channel and does not bound preparation systematics.