Approximate Quantum Markov Chains


Book Description

This book is an introduction to quantum Markov chains and explains how this concept is connected to the question of how well a lost quantum mechanical system can be recovered from a correlated subsystem. To achieve this goal, we strengthen the data-processing inequality such that it reveals a statement about the reconstruction of lost information. The main difficulty in order to understand the behavior of quantum Markov chains arises from the fact that quantum mechanical operators do not commute in general. As a result we start by explaining two techniques of how to deal with non-commuting matrices: the spectral pinching method and complex interpolation theory. Once the reader is familiar with these techniques a novel inequality is presented that extends the celebrated Golden-Thompson inequality to arbitrarily many matrices. This inequality is the key ingredient in understanding approximate quantum Markov chains and it answers a question from matrix analysis that was open since 1973, i.e., if Lieb's triple matrix inequality can be extended to more than three matrices. Finally, we carefully discuss the properties of approximate quantum Markov chains and their implications. The book is aimed to graduate students who want to learn about approximate quantum Markov chains as well as more experienced scientists who want to enter this field. Mathematical majority is necessary, but no prior knowledge of quantum mechanics is required.




Approximating Countable Markov Chains


Book Description

A long time ago I started writing a book about Markov chains, Brownian motion, and diffusion. I soon had two hundred pages of manuscript and my publisher was enthusiastic. Some years and several drafts later, I had a thousand pages of manuscript, and my publisher was less enthusiastic. So we made it a trilogy: Markov Chains Brownian Motion and Diffusion Approximating Countable Markov Chains familiarly - MC, B & D, and ACM. I wrote the first two books for beginning graduate students with some knowledge of probability; if you can follow Sections 10.4 to 10.9 of Markov Chains, you're in. The first two books are quite independent of one another, and completely independent of this one, which is a monograph explaining one way to think about chains with instantaneous states. The results here are supposed to be new, except when there are specific disclaimers. It's written in the framework of Markov chains; we wanted to reprint in this volume the MC chapters needed for reference. but this proved impossible. Most of the proofs in the trilogy are new, and I tried hard to make them explicit. The old ones were often elegant, but I seldom saw what made them go. With my own, I can sometimes show you why things work. And, as I will argue in a minute, my demonstrations are easier technically. If I wrote them down well enough, you may come to agree.







Markov Chain Monte Carlo Methods in Quantum Field Theories


Book Description

This primer is a comprehensive collection of analytical and numerical techniques that can be used to extract the non-perturbative physics of quantum field theories. The intriguing connection between Euclidean Quantum Field Theories (QFTs) and statistical mechanics can be used to apply Markov Chain Monte Carlo (MCMC) methods to investigate strongly coupled QFTs. The overwhelming amount of reliable results coming from the field of lattice quantum chromodynamics stands out as an excellent example of MCMC methods in QFTs in action. MCMC methods have revealed the non-perturbative phase structures, symmetry breaking, and bound states of particles in QFTs. The applications also resulted in new outcomes due to cross-fertilization with research areas such as AdS/CFT correspondence in string theory and condensed matter physics. The book is aimed at advanced undergraduate students and graduate students in physics and applied mathematics, and researchers in MCMC simulations and QFTs. At the end of this book the reader will be able to apply the techniques learned to produce more independent and novel research in the field.




Computer Aided Verification


Book Description







Reinforcement Learning with Hybrid Quantum Approximation in the NISQ Context


Book Description

This book explores the combination of Reinforcement Learning and Quantum Computing in the light of complex attacker-defender scenarios. Reinforcement Learning has proven its capabilities in different challenging optimization problems and is now an established method in Operations Research. However, complex attacker-defender scenarios have several characteristics that challenge Reinforcement Learning algorithms, requiring enormous computational power to obtain the optimal solution. The upcoming field of Quantum Computing is a promising path for solving computationally complex problems. Therefore, this work explores a hybrid quantum approach to policy gradient methods in Reinforcement Learning. It proposes a novel quantum REINFORCE algorithm that enhances its classical counterpart by Quantum Variational Circuits. The new algorithm is compared to classical algorithms regarding the convergence speed and memory usage on several attacker-defender scenarios with increasing complexity. In addition, to study its applicability on today's NISQ hardware, the algorithm is evaluated on IBM's quantum computers, which is accompanied by an in-depth analysis of the advantages of Quantum Reinforcement Learning.




Markov Chains


Book Description

A long time ago I started writing a book about Markov chains, Brownian motion, and diffusion. I soon had two hundred pages of manuscript and my publisher was enthusiastic. Some years and several drafts later, I had a thousand pages of manuscript, and my publisher was less enthusiastic. So we made it a trilogy: Markov Chains Brownian Motion and Diffusion Approximating Countable Markov Chains familiarly - MC, B & D, and ACM. I wrote the first two books for beginning graduate students with some knowledge of probability; if you can follow Sections 10.4 to 10.9 of Markov Chains you're in. The first two books are quite independent of one another, and completely independent of the third. This last book is a monograph which explains one way to think about chains with instantaneous states. The results in it are supposed to be new, except where there are specific disclaim ers; it's written in the framework of Markov Chains. Most of the proofs in the trilogy are new, and I tried hard to make them explicit. The old ones were often elegant, but I seldom saw what made them go. With my own, I can sometimes show you why things work. And, as I will VB1 PREFACE argue in a minute, my demonstrations are easier technically. If I wrote them down well enough, you may come to agree.




Quantum Robotics


Book Description

Quantum robotics is an emerging engineering and scientific research discipline that explores the application of quantum mechanics, quantum computing, quantum algorithms, and related fields to robotics. This work broadly surveys advances in our scientific understanding and engineering of quantum mechanisms and how these developments are expected to impact the technical capability for robots to sense, plan, learn, and act in a dynamic environment. It also discusses the new technological potential that quantum approaches may unlock for sensing and control, especially for exploring and manipulating quantum-scale environments. Finally, the work surveys the state of the art in current implementations, along with their benefits and limitations, and provides a roadmap for the future.




Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques


Book Description

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.