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

Ornstein-Zernike behavior for Ising models with infinite-range interactions

We prove Ornstein-Zernike behavior for the large-distance asymptotics of the two-point function of the Ising model above the critical temperature under essentially optimal assumptions on the interaction. The main contribution of this work is that the interactions are not assumed to be of finite range. To the best of our knowledge, this is the first proof of OZ asymptotics for a nontrivial model with infinite-range interactions. Our results actually apply to the Green function of a large class of "self-repulsive in average" models, including a natural family of self-repulsive polymer models that contains, in particular, the self-avoiding walk, the Domb-Joyce model and the killed random walk. We aimed at a pedagogical and self-contained presentation.Comment: Final version, accepted for publication in Annales de l'Institut Henri Poincar\'e, Probabilit\'es et Statistiques. Dedicated to the memory of Dima Ioff

New Concepts in Quantum Metrology: Dynamics, Machine Learning, and Bounds on Measurement Precision

Diese kumulative Promotionsarbeit befasst sich mit theoretischer Quantenmetrologie, der Theorie von Messung und Schätzung unter Zuhilfenahme von Quantenressourcen. Viele Vorschläge für quantenverbesserte Sensoren beruhen auf der Präparation von nichtklassischen Anfangszuständen und integrabler Dynamik. Allerdings sind solche nichtklassischen Zustände schwierig zu präparieren und gegen Dekohärenz zu schützen. Alternativ schlagen wir in dieser Promotionsarbeit sogenannte quantenchaotische Sensoren vor, die auf klassischen Anfangszuständen beruhen, die einfach zu präparieren sind, wobei Quantenverbesserungen an der Dynamik vorgenommen werden. Diese Herangehensweise hat ihren Ursprung darin, dass sowohl Quantenchaos als auch Quantenmetrologie über die Empfindlichkeit für kleine Änderungen in der Dynamik charakterisiert werden. Wir erforschen unterschiedliche Arten von Dynamik am Beispiel des Modells eines gestoßenen Quantenkreisels ("kicked top"), dessen Dynamik durch nichtlineare Kontrollpulse quantenchaotisch wird. Außerdem zeigen wir, dass Quantenchaos in der Lage ist, schädlichen Dekohärenzeffekte abzuschwächen. Insbesondere präsentieren wir einen Vorschlag für ein quantenchaotisches Cäsiumdampf-Magnetometer. Mit der Hilfe von Bestärkendem Lernen verbessern wir Zeitpunkt und Stärke der nichtlinearen Pulse im Modell des gestoßenen Quantenkreisels mit Superradianzdämpfung. Für diesen Fall finden wir, dass die Kontrollstrategie als eine dynamische Form der Spin-Quetschung verstanden werden kann. Ein anderer Teil dieser Promotionsarbeit beschäftigt sich mit bayesscher Quantenschätzung und insbesondere mit dem Problem der heuristischen Gestaltung von Experimenten. Wir trainieren neuronale Netze mit einer Kombination aus überwachtem und bestärkendem Lernen, um diese zu schnellen und starken Heuristiken für die Gestaltung von Experimenten zu machen. Die Vielseitigkeit unserer Methode zeigen wir anhand von Beispielen zu Einzel- und Mehrparameterschätzung, in denen die trainierten neuronalen Netze die Leistung der modernsten Heuristiken übertreffen. Außerdem beschäftigen wir uns mit einer lange unbewiesenen Vermutung aus dem Bereich der Quantenmetrologie: Wir liefern einen Beweis für diese Vermutung und finden einen Ausdruck für die maximale Quantenfischerinformation für beliebige gemischte Zustände und beliebige unitäre Dynamik, finden Bedingungen für optimale Zustandspräparation und optimale dynamische Kontrolle, und verwenden diese Ergebnisse, um zu beweisen, dass die Heisenberg-Schranke sogar mit thermischen Zuständen beliebiger (endlicher) Temperatur erreicht werden kann.This cumulative thesis is concerned with theoretical quantum metrology, the theory of measurement and estimation using quantum resources. Possible applications of quantum-enhanced sensors include the measurement of magnetic fields, gravitational wave detection, navigation, remote sensing, or the improvement of frequency standards. Many proposals for quantum-enhanced sensors rely on the preparation of non-classical initial states and integrable dynamics. However, such non-classical states are generally difficult to prepare and to protect against decoherence. As an alternative, in this thesis, we propose so-called quantum-chaotic sensors which make use of classical initial states that are easy to prepare while quantum enhancements are applied to the dynamics. This approach is motivated by the insight that quantum chaos and quantum metrology are both characterized by the sensitivity to small changes of the dynamics. At the example of the quantum kicked top model, where nonlinear control pulses render the dynamics quantum-chaotic, we explore different dynamical regimes for quantum sensors. Further, we demonstrate that quantum chaos is able to alleviate the detrimental effects of decoherence. In particular, we present a proposal for a quantum-chaotic cesium-vapor magnetometer. With the help of reinforcement learning, we further optimize timing and strength of the nonlinear control pulses for the kicked top model with superradiant damping. In this case, the optimized control policy is identified as a dynamical form of spin squeezing. Another part of this thesis deals with Bayesian quantum estimation and, in particular, with the problem of experiment design heuristics. We train neural networks with a combination of supervised and reinforcement learning to become fast and strong experiment design heuristics. We demonstrate the versatility of this method using examples of single and multi-parameter estimation where the trained neural networks surpass the performance of well-established heuristics. Finally, this thesis deals with a long-time outstanding conjecture in quantum metrology: we prove this conjecture and find an expression for the maximal quantum Fisher information for any mixed initial state and any unitary dynamics, provide conditions for optimal state preparation and optimal control of the dynamics, and utilize these results to prove that Heisenberg scaling can be achieved even with thermal states of arbitrary (finite) temperature

A walk through quantum noise: a study of error signatures and characterization methods

The construction of large scale quantum computing devices might be one of the most exciting and promising endeavors of the 21st century, but it also comes with many challenges. As quantum computers are supplemented with more registers, their error profile generally grows in complexity, rendering the enterprise of quantifying the reliability of quantum computations increasingly difficult through naive characterization techniques. In the last decade, a lot of efforts has been directed toward developing highly scalable benchmarking schemes. A leading family of characterization methods built upon scalable principles is known as randomized benchmarking (RB). In this thesis, many tools are presented with the objective of improving the scalability, and versatility of RB techniques, as well as demonstrating their reliability under various error models. The first part of this work investigates the connection between the error of individual circuit components and the error of their composition. Before reasoning about intricate circuit constructions, it is shown that there exists a well-motivated way to define decoherent quantum channels, and that every channel can be factorized into a unitary-decoherent composition. This dichotomy carries to the circuit evolution of important error parameters by assuming realistic error scenarios. Those results are used to improve the confidence interval of RB diagnoses and to reconcile experimentally estimated parameters with physically and operationally meaningful quantities. In the second part of this thesis, various RB schemes are either developed or more rigorously analyzed. A first result consists of the introduction of “dihedral benchmarking”, a technique which, if performed in conjunction with standard RB protocols, enables the characterization of operations that form a universal gate-set. Finally, rigorous analysis tools are provided to demonstrate the reliability of a highly scalable family of generator-based RB protocols known as direct RB

Recovery With Incomplete Knowledge: Fundamental Bounds on Real-Time Quantum Memories

The recovery of fragile quantum states from decoherence is the basis of building a quantum memory, with applications ranging from quantum communications to quantum computing. Many recovery techniques, such as quantum error correction, rely on the $apriori$ knowledge of the environment noise parameters to achieve their best performance. However, such parameters are likely to drift in time in the context of implementing long-time quantum memories. This necessitates using a "spectator" system, which estimates the noise parameter in real-time, then feed-forwards the outcome to the recovery protocol as a classical side-information. The memory qubits and the spectator system hence comprise the building blocks for a real-time (i.e. drift-adapting) quantum memory. In this article, I consider spectator-based (incomplete knowledge) recovery protocols as a real-time parameter estimation problem (generally with nuisance parameters present), followed by the application of the "best-guess" recovery map to the memory qubits, as informed by the estimation outcome. I present information-theoretic and metrological bounds on the performance of this protocol, quantified by the diamond distance between the "best-guess" recovery and optimal recovery outcomes, thereby identifying the cost of adaptation in real-time quantum memories. Finally, I provide fundamental bounds for multi-cycle recovery in the form of recurrence inequalities. The latter suggests that incomplete knowledge of the noise could be an advantage, as errors from various cycles can cohere. These results are illustrated for the approximate [4,1] code of the amplitude-damping channel and relations to various fields are discussed