6,551 research outputs found
Application of compressed sensing to the simulation of atomic systems
Compressed sensing is a method that allows a significant reduction in the
number of samples required for accurate measurements in many applications in
experimental sciences and engineering. In this work, we show that compressed
sensing can also be used to speed up numerical simulations. We apply compressed
sensing to extract information from the real-time simulation of atomic and
molecular systems, including electronic and nuclear dynamics. We find that for
the calculation of vibrational and optical spectra the total propagation time,
and hence the computational cost, can be reduced by approximately a factor of
five.Comment: 7 pages, 5 figure
Experimentally exploring compressed sensing quantum tomography
In the light of the progress in quantum technologies, the task of verifying
the correct functioning of processes and obtaining accurate tomographic
information about quantum states becomes increasingly important. Compressed
sensing, a machinery derived from the theory of signal processing, has emerged
as a feasible tool to perform robust and significantly more resource-economical
quantum state tomography for intermediate-sized quantum systems. In this work,
we provide a comprehensive analysis of compressed sensing tomography in the
regime in which tomographically complete data is available with reliable
statistics from experimental observations of a multi-mode photonic
architecture. Due to the fact that the data is known with high statistical
significance, we are in a position to systematically explore the quality of
reconstruction depending on the number of employed measurement settings,
randomly selected from the complete set of data, and on different model
assumptions. We present and test a complete prescription to perform efficient
compressed sensing and are able to reliably use notions of model selection and
cross-validation to account for experimental imperfections and finite counting
statistics. Thus, we establish compressed sensing as an effective tool for
quantum state tomography, specifically suited for photonic systems.Comment: 12 pages, 5 figure
Tensor completion in hierarchical tensor representations
Compressed sensing extends from the recovery of sparse vectors from
undersampled measurements via efficient algorithms to the recovery of matrices
of low rank from incomplete information. Here we consider a further extension
to the reconstruction of tensors of low multi-linear rank in recently
introduced hierarchical tensor formats from a small number of measurements.
Hierarchical tensors are a flexible generalization of the well-known Tucker
representation, which have the advantage that the number of degrees of freedom
of a low rank tensor does not scale exponentially with the order of the tensor.
While corresponding tensor decompositions can be computed efficiently via
successive applications of (matrix) singular value decompositions, some
important properties of the singular value decomposition do not extend from the
matrix to the tensor case. This results in major computational and theoretical
difficulties in designing and analyzing algorithms for low rank tensor
recovery. For instance, a canonical analogue of the tensor nuclear norm is
NP-hard to compute in general, which is in stark contrast to the matrix case.
In this book chapter we consider versions of iterative hard thresholding
schemes adapted to hierarchical tensor formats. A variant builds on methods
from Riemannian optimization and uses a retraction mapping from the tangent
space of the manifold of low rank tensors back to this manifold. We provide
first partial convergence results based on a tensor version of the restricted
isometry property (TRIP) of the measurement map. Moreover, an estimate of the
number of measurements is provided that ensures the TRIP of a given tensor rank
with high probability for Gaussian measurement maps.Comment: revised version, to be published in Compressed Sensing and Its
Applications (edited by H. Boche, R. Calderbank, G. Kutyniok, J. Vybiral
Improving compressed sensing with the diamond norm
In low-rank matrix recovery, one aims to reconstruct a low-rank matrix from a
minimal number of linear measurements. Within the paradigm of compressed
sensing, this is made computationally efficient by minimizing the nuclear norm
as a convex surrogate for rank.
In this work, we identify an improved regularizer based on the so-called
diamond norm, a concept imported from quantum information theory. We show that
-for a class of matrices saturating a certain norm inequality- the descent cone
of the diamond norm is contained in that of the nuclear norm. This suggests
superior reconstruction properties for these matrices. We explicitly
characterize this set of matrices. Moreover, we demonstrate numerically that
the diamond norm indeed outperforms the nuclear norm in a number of relevant
applications: These include signal analysis tasks such as blind matrix
deconvolution or the retrieval of certain unitary basis changes, as well as the
quantum information problem of process tomography with random measurements.
The diamond norm is defined for matrices that can be interpreted as order-4
tensors and it turns out that the above condition depends crucially on that
tensorial structure. In this sense, this work touches on an aspect of the
notoriously difficult tensor completion problem.Comment: 25 pages + Appendix, 7 Figures, published versio
- …