Related papers: Preparation and verification of tensor network sta…
We describe forms of adiabatic transport that arise for dressed-state atoms in optical lattices. Focussing on the limit of weak tunnel-coupling between nearest-neighbour lattice sites, we explain how adiabatic variation of optical dressing…
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present…
We examine the use of string diagrams and the mathematics of category theory in the description of quantum states by tensor networks. This approach lead to a unification of several ideas, as well as several results and methods that have not…
For multi-level time-dependent quantum systems one can construct superadiabatic representations in which the coupling between separated levels is exponentially small in the adiabatic limit. Based on results from [BeTe1] for special…
Quantum computing crucially relies on the ability to efficiently characterize the quantum states output by quantum hardware. Conventional methods which probe these states through direct measurements and classically computed correlations…
Automated identification of protein conformational states from simulation of an ensemble of structures is a hard problem because it requires teaching a computer to recognize shapes. We adapt the naive Bayes classifier from the machine…
While remarkable progress has been achieved in engineering nontrivial Hamiltonians across a wide range of physical platforms, preparing their corresponding nontrivial ground states remains a major experimental challenge. The commonly used…
Adiabatic methods are potentially important for quantum information protocols because of their robustness against many sources of technical and fundamental noise. They are particularly useful for quantum transport, and in some cases…
Recently, the technique of counterdiabatic driving, which provides an effective strategy for accelerating adiabatic quantum evolution, has been widely applied in the preparation of many-body quantum states. In this work, we propose a…
We introduce a new family of separability criteria that are based on the existence of extensions of a bipartite quantum state $\rho$ to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
In a quantum system with a smoothly and slowly varying Hamiltonian, which approaches a constant operator at times $t\to \pm \infty$, the transition probabilities between adiabatic states are exponentially small. They are characterized by an…
We begin with a review of a well known class of networks, Classical Bayesian (CB) nets (also called causal probabilistic nets by some). Given a situation which includes randomness, CB nets are used to calculate the probabilities of various…
We consider systems composed of an unbounded number of uniformly designed linear hybrid automata, whose dynamic behavior is determined by their relation to neighboring systems. We present a class of such systems and a class of safety…
One of the goals in quantum simulation is to adiabatically generate the ground state of a complicated Hamiltonian by starting with the ground state of a simple Hamiltonian and slowly evolving the system to the complicated one. If the…
Using the Boltzmann weights of classical Statistical Mechanics vertex models we define a new class of Tensor Product Ansatzs for 2D quantum lattice systems, characterized by a strong anisotropy, which gives rise to stripe like structures.…
We consider the problem of learning the Hamiltonian of a quantum system from estimates of Gibbs-state expectation values. Various methods for achieving this task were proposed recently, both from a practical and theoretical point of view.…
Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are…
Semidefinite programs (SDPs) -- some of the most useful and versatile optimization problems of the last few decades -- are often pathological: the optimal values of the primal and dual problems may differ and may not be attained. Such SDPs…
We revisit the adiabatic criterion in stimulated Raman adiabatic passage for the three-level $\Lambda$-system, and compare the situation with and without nonlinearity. In linear systems, the adiabatic condition is derived with the help of…