We show that prior knowledge that a state of several photons can be represented in compact form in an unknown basis enables the recovery of the quantum state from partial measurements in a single setup.
The field of quantum information has been growing fast over the past decade. Optical quantum computation, based on the concepts of KLM and cluster states, has witnessed experimental realizations of larger and more complex systems in terms of photon number. Quantum optical systems, which offer long coherence times and easy manipulation of single qubits, allow us to probe quantum properties of the light itself and of the physical systems around it. Recently, a linear scheme for quantum computing, relying on the bosonic nature of particles, has been proposed and realized experimentally with photons. The ability to efficiently measure superpositions of quantum states consisting of several photons is essential to the characterization of such systems. In fact, the entire field of quantum information completely relies on the ability to recover quantum states from measurements. However, the characterization of quantum states requires many measurements, and often necessitates complicated measurements schemes; for example, characterizing qubits requires measurements. Here, we utilize structure, inherent to physically interesting quantum states of light, in order to reduce the complexity in the recovery of a quantum state. In particular, we devise a method enabling the recovery of three-photon quantum states from only two-fold correlation measurements in a single setting. The ability to take two-fold coincidences instead of three-fold offers the recovery of the quantum states in far less measurements and in a considerably higher SNR, because detection of two-photon events is much more likely than that of three-photon ones. The concept suggested here paves the way to further ideas on structure-based super resolution in quantum state tomography, such as recovering a quantum state in an unknown basis in a single setup and recovering the state of several photons without number resolving detectors.
We present an efficient protocol for learning an unknown k-local Lindblad generator on n qubits using only product-state preparations, short-time evolution, and single-qubit Pauli measurements, without prior knowledge of the interaction structure. For fixed k and a supplied weighted interaction-strength bound αˉ, the protocol estimates all Hamiltonian and dissipative Pauli--GKSL coefficients with total coefficient error at each site at most ε with probability at least 1−δ using Ok(αˉ2n2k−2ε−2log(n/δ)) samples and polylogarithmically many distinct evolution times. This guarantee requires no degree, sparsity, or tail promise. A convex optimization converts these estimates into a valid k-local Lindblad generator with diamond-norm error at most ε using Ok(αˉ2n2kε−2log(n/δ)) samples and polynomial-time classical postprocessing. With a supplied local effective-sparsity bound r and a sufficiently small sitewise subthreshold tail Ok(ε), coefficient recovery requires only Ok(αˉ2r2ε−2log(n/δ)) samples, without a supplied threshold or coefficient locations and without a coefficient-gap assumption. In particular, exactly sparse bounded-degree models have logarithmic sample dependence on n. We also provide guard-band support recovery and complementary supplied-candidate guarantees, extend the guarantees to model misspecification, and prove complementary sample-complexity lower bounds.
We study the problem of learning a sparse quantum state, an n-qubit quantum state whose density matrix has at most s nonzero matrix entries in an unknown product basis. While such states admit compact classical descriptions, they can carry long-range entanglement that prevents reconstruction from local reduced density matrices alone. Therefore, previous learning approaches addressed such long-range-entangled states using many entangling gates to extract the necessary information. In this work, we show that sparse states can nevertheless be efficiently learned using only single-qubit measurements. Specifically, when the sparsity s is constant, our algorithm can learn sparse states from single-qubit measurements with polynomial sample complexity and classical computational complexity. When s grows polynomially with n, sparse states can still be learned from single-qubit measurements with polynomial sample complexity, although efficient classical computation is not guaranteed in general. In this regime, however, the classical computational complexity becomes quasipolynomial when the state is sparse in an unknown basis that is a product of a known fixed finite set of single-qubit bases (e.g., eigenbases of Pauli operators). These results establish efficient learning of sparse states with long-range entanglement without entangling gates, and the single-qubit measurement requirements make our algorithms compatible with current quantum devices.