We address the characterization of qubit chains and assess the performances of local measurements compared to those provided by Feynman probes, i.e. nonlocal measurements realized by coupling a single qubit regis- ter to the chain. We show that local
measurements are suitable to estimate small values of the coupling and that a Bayesian strategy may be successfully exploited to achieve optimal precision. For larger values of the coupling Bayesian local strategies do not lead to a consistent estimate. In this regime, Feynman probes may be exploited to build a consistent Bayesian estimator that saturates the Cramer-Rao bound, thus providing an effective characterization of the chain. Finally, we show that ultimate bounds to precision, i.e. saturation of the quantum Cramer-Rao bound, may be achieved by a two-step scheme employing Feynman probes followed by local measurements.
When the amount of entanglement in a quantum system is limited, the relevant dynamics of the system is restricted to a very small part of the state space. When restricted to this subspace the description of the system becomes efficient in the system
size. A class of algorithms, exemplified by the Time-Evolving Block-Decimation (TEBD) algorithm, make use of this observation by selecting the relevant subspace through a decimation technique relying on the Singular Value Decomposition (SVD). In these algorithms, the complexity of each time-evolution step is dominated by the SVD. Here we show that, by applying a randomized version of the SVD routine (RRSVD), the power law governing the computational complexity of TEBD is lowered by one degree, resulting in a considerable speed-up. We exemplify the potential gains in efficiency at the hand of some real world examples to which TEBD can be successfully applied to and demonstrate that for those system RRSVD delivers results as accurate as state-of-the-art deterministic SVD routines.
