scholarly journals Uncertainty Quantification for Matrix Compressed Sensing and Quantum Tomography Problems

Author(s):  
Alexandra Carpentier ◽  
Jens Eisert ◽  
David Gross ◽  
Richard Nickl
2012 ◽  
Vol 14 (9) ◽  
pp. 095022 ◽  
Author(s):  
Steven T Flammia ◽  
David Gross ◽  
Yi-Kai Liu ◽  
Jens Eisert

2017 ◽  
Vol 154 ◽  
pp. 296-321 ◽  
Author(s):  
Saeed Salehi ◽  
Mehrdad Raisee ◽  
Michel J. Cervantes ◽  
Ahmad Nourbakhsh

2017 ◽  
Vol 2 (2) ◽  
pp. 025005 ◽  
Author(s):  
A Steffens ◽  
C A Riofrío ◽  
W McCutcheon ◽  
I Roth ◽  
B A Bell ◽  
...  

2015 ◽  
Vol 1 (1) ◽  
Author(s):  
Amir Kalev ◽  
Robert L Kosut ◽  
Ivan H Deutsch

AbstractCharacterising complex quantum systems is a vital task in quantum information science. Quantum tomography, the standard tool used for this purpose, uses a well-designed measurement record to reconstruct quantum states and processes. It is, however, notoriously inefficient. Recently, the classical signal reconstruction technique known as ‘compressed sensing’ has been ported to quantum information science to overcome this challenge: accurate tomography can be achieved with substantially fewer measurement settings, thereby greatly enhancing the efficiency of quantum tomography. Here we show that compressed sensing tomography of quantum systems is essentially guaranteed by a special property of quantum mechanics itself—that the mathematical objects that describe the system in quantum mechanics are matrices with non-negative eigenvalues. This result has an impact on the way quantum tomography is understood and implemented. In particular, it implies that the information obtained about a quantum system through compressed sensing methods exhibits a new sense of ‘informational completeness.’ This has important consequences on the efficiency of the data taking for quantum tomography, and enables us to construct informationally complete measurements that are robust to noise and modelling errors. Moreover, our result shows that one can expand the numerical tool-box used in quantum tomography and employ highly efficient algorithms developed to handle large dimensional matrices on a large dimensional Hilbert space. Although we mainly present our results in the context of quantum tomography, they apply to the general case of positive semidefinite matrix recovery.


2012 ◽  
Vol 12 (4) ◽  
pp. 919-954 ◽  
Author(s):  
L. Mathelin ◽  
K. A. Gallivan

AbstractIn this paper, a novel approach for quantifying the parametric uncertainty associated with a stochastic problem output is presented. As with Monte-Carlo and stochastic collocation methods, only point-wise evaluations of the stochastic output response surface are required allowing the use of legacy deterministic codes and precluding the need for any dedicated stochastic code to solve the uncertain problem of interest. The new approach differs from these standard methods in that it is based on ideas directly linked to the recently developed compressed sensing theory. The technique allows the retrieval of the modes that contribute most significantly to the approximation of the solution using a minimal amount of information. The generation of this information, via many solver calls, is almost always the bottle-neck of an uncertainty quantification procedure. If the stochastic model output has a reasonably compressible representation in the retained approximation basis, the proposed method makes the best use of the available information and retrieves the dominant modes. Uncertainty quantification of the solution of both a 2-D and 8-D stochastic Shallow Water problem is used to demonstrate the significant performance improvement of the new method, requiring up to several orders of magnitude fewer solver calls than the usual sparse grid-based Polynomial Chaos (Smolyak scheme) to achieve comparable approximation accuracy.


Sign in / Sign up

Export Citation Format

Share Document