اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStoquastic ground states are classical thermal distributions
85
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the structure of the ground states of local stoquastic Hamiltonians and show that under mild assumptions the following distributions can efficiently approximate one another: (a) distributions arising from ground states of stoquastic Hamiltonians, (b) distributions arising from ground states of stoquastic frustration-free Hamiltonians, (c) Gibbs distributions of local classical Hamiltonian, and (d) distributions represented by real-valued Deep Boltzmann machines. In addition, we highlight regimes where it is possible to efficiently classically sample from the above distributions.
قيم البحث
اقرأ أيضاً
Ground states of local Hamiltonians can be generally highly entangled: any quantum circuit that generates them (even approximately) must be sufficiently deep to allow coupling (entanglement) between any pair of qubits. Until now this property was not
known to be robust - the marginals of such states to a subset of the qubits containing all but a small constant fraction of them may be only locally entangled, and hence approximable by shallow quantum circuits. In this work we construct a family of 16-local Hamiltonians for which any 1-10^{-9} fraction of qubits of any ground state must be highly entangled. This provides evidence that quantum entanglement is not very fragile, and perhaps our intuition about its instability is an artifact of considering local Hamiltonians which are not only local but spatially local. Formally, it provides positive evidence for two wide-open conjectures in condensed-matter physics and quantum complexity theory which are the qLDPC conjecture, positing the existence of good quantum LDPC codes, and the NLTS conjecture due to Freedman and Hastings positing the existence of local Hamiltonians in which any low-energy state is highly-entangled. Our Hamiltonian is based on applying the hypergraph product by Tillich and Zemor to a classical locally testable code. A key tool in our proof is a new lower bound on the vertex expansion of the output of low-depth quantum circuits, which may be of independent interest.
Ground state counting plays an important role in several applications in science and engineering, from estimating residual entropy in physical systems, to bounding engineering reliability and solving combinatorial counting problems. While quantum alg
orithms such as adiabatic quantum optimization (AQO) and quantum approximate optimization (QAOA) can minimize Hamiltonians, they are inadequate for counting ground states. We modify AQO and QAOA to count the ground states of arbitrary classical spin Hamiltonians, including counting ground states with arbitrary nonnegative weights attached to them. As a concrete example, we show how our method can be used to count the weighted fraction of edge covers on graphs, with user-specified confidence on the relative error of the weighted count, in the asymptotic limit of large graphs. We find the asymptotic computational time complexity of our algorithms, via analytical predictions for AQO and numerical calculations for QAOA, and compare with the classical optimal Monte Carlo algorithm (OMCS), as well as a modified Grovers algorithm. We show that for large problem instances with small weights on the ground states, AQO does not have a quantum speedup over OMCS for a fixed error and confidence, but QAOA has a sub-quadratic speedup on a broad class of numerically simulated problems. Our work is an important step in approaching general ground-state counting problems beyond those that can be solved with Grovers algorithm. It offers algorithms that can employ noisy intermediate-scale quantum devices for solving ground state counting problems on small instances, which can help in identifying more problem classes with quantum speedups.
In blind compression of quantum states, a sender Alice is given a specimen of a quantum state $rho$ drawn from a known ensemble (but without knowing what $rho$ is), and she transmits sufficient quantum data to a receiver Bob so that he can decode a n
ear perfect specimen of $rho$. For many such states drawn iid from the ensemble, the asymptotically achievable rate is the number of qubits required to be transmitted per state. The Holevo information is a lower bound for the achievable rate, and is attained for pure state ensembles, or in the related scenario of entanglement-assisted visible compression of mixed states wherein Alice knows what state is drawn. In this paper, we prove a general, robust, lower bound on the achievable rate for ensembles of classical states, which holds even in the least demanding setting when Alice and Bob share free entanglement and a constant per-copy error is allowed. We apply the bound to a specific ensemble of only two states and prove a near-maximal separation between the best achievable rate and the Holevo information for constant error. Since the states are classical, the observed incompressibility is not fundamentally quantum mechanical. We lower bound the difference between the achievable rate and the Holevo information in terms of quantitative limitations to clone the specimen or to distinguish the two classical states.
The role of non-stoquasticity in the field of quantum annealing and adiabatic quantum computing is an actively debated topic. We study a strongly-frustrated quasi-one-dimensional quantum Ising model on a two-leg ladder to elucidate how a first-order
phase transition with a topological origin is affected by interactions of the $pm XX$-type. Such interactions are sometimes known as stoquastic (negative sign) and non-stoquastic (positive sign) catalysts. Carrying out a symmetry-preserving real-space renormalization group analysis and extensive density-matrix renormalization group computations, we show that the phase diagrams obtained by these two methods are in qualitative agreement with each other and reveal that the first-order quantum phase transition of a topological nature remains stable against the introduction of both $XX$-type catalysts. This is the first study of the effects of non-stoquasticity on a first-order phase transition between topologically distinct phases. Our results indicate that non-stoquastic catalysts are generally insufficient for removing topological obstacles in quantum annealing and adiabatic quantum computing.
We construct for the first time examples of non-frustrated, two-body, infinite-range, one-dimensional classical lattice-gas models without periodic ground-state configurations. Ground-state configurations of our models are Sturmian sequences defined
by irrational rotations on the circle. We present minimal sets of forbidden patterns which define Sturmian sequences in a unique way. Our interactions assign positive energies to forbidden patterns and are equal to zero otherwise. We illustrate our construction by the well-known example of the Fibonacci sequences.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
