اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn complexity of the quantum Ising model
35
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study complexity of several problems related to the Transverse field Ising Model (TIM). First, we consider the problem of estimating the ground state energy known as the Local Hamiltonian Problem (LHP). It is shown that the LHP for TIM on degree-3 graphs is equivalent modulo polynomial reductions to the LHP for general k-local `stoquastic Hamiltonians with any constant $kge 2$. This result implies that estimating the ground state energy of TIM on degree-3 graphs is a complete problem for the complexity class StoqMA - an extension of the classical class MA. As a corollary, we complete the complexity classification of 2-local Hamiltonians with a fixed set of interactions proposed recently by Cubitt and Montanaro. Secondly, we study quantum annealing algorithms for finding ground states of classical spin Hamiltonians associated with hard optimization problems. We prove that the quantum annealing with TIM Hamiltonians is equivalent modulo polynomial reductions to the quantum annealing with a certain subclass of k-local stoquastic Hamiltonians. This subclass includes all Hamiltonians representable as a sum of a k-local diagonal Hamiltonian and a 2-local stoquastic Hamiltonian.
قيم البحث
اقرأ أيضاً
We show that Gibbs states of non-homogeneous transverse Ising chains satisfy a emph{shielding} property. Namely, whatever the fields on each spin and exchange couplings between neighboring spins are, if the field in one particular site is null, the r
educed states of the subchains to the right and to the left of this site are emph{exactly} the Gibbs states of each subchain alone. Therefore, even if there is a strong exchange coupling between the extremal sites of each subchain, the Gibbs states of the each subchain behave as if there is no interaction between them. In general, if a lattice can be divided into two disconnected regions separated by an interface of sites with zero applied field, we can guarantee a similar result only if the surface contains a single site. Already for an interface with two sites we show an example where the property does not hold. When it holds, however, we show that if a perturbation of the Hamiltonian parameters is done in one side of the lattice, the other side is completely unchanged, with regard to both its equilibrium state and dynamics.
We establish a set of nonequilibrium quantum phase transitions in the Ising model driven under monochromatic nonadiabatic modulation of the transverse field. We show that besides the Ising-like critical behavior, the system exhibits an anisotropic tr
ansition which is absent in equilibrium. The nonequilibrium quantum phases correspond to states which are synchronized with the external control in the long-time dynamics.
A rigorous proof is presented of the boundedness of the entanglement entropy of a block of spins for the ground state of the one-dimensional quantum Ising model with sufficiently strong transverse field. This is proved by a refinement of the argument
s in the earlier work by the same authors (J. Statist. Phys. 131 (2008) 305-339). The proof is geometrical, and utilises a transformation to a model of classical probability called the continuum random-cluster model. Our method of proof is fairly robust, and applies also to certain disordered systems.
There is great interest in using near-term quantum computers to simulate and study foundational problems in quantum mechanics and quantum information science, such as the scrambling measured by an out-of-time-ordered correlator (OTOC). Here we use an
IBM Q processor, quantum error mitigation, and weaved Trotter simulation to study high-resolution operator spreading in a 4-spin Ising model as a function of space, time, and integrability. Reaching 4 spins while retaining high circuit fidelity is made possible by the use of a physically motivated fixed-node variant of the OTOC, allowing scrambling to be estimated without overhead. We find clear signatures of ballistic operator spreading in a chaotic regime, as well as operator localization in an integrable regime. The techniques developed and demonstrated here open up the possibility of using cloud-based quantum computers to study and visualize scrambling phenomena, as well as quantum information dynamics more generally.
Frustration represents an essential feature in the behavior of magnetic materials when constraints on the microscopic Hamiltonian cannot be satisfied simultaneously. This gives rise to exotic phases of matter including spin liquids, spin ices, and st
ripe phases. Here we demonstrate an approach to understanding the microscopic effects of frustration by computing the phases of a 468-spin Shastry-Sutherland Ising Hamiltonian using a quantum annealer. Our approach uses mean-field boundary conditions to mitigate effects of finite size and defects alongside an iterative quantum annealing protocol to simulate statistical physics. We recover all phases of the Shastry-Sutherland Ising model -- including the well-known fractional magnetization plateau -- and the static structure factor characterizing the critical behavior at these transitions. These results establish quantum annealing as an emerging method in understanding the effects of frustration on the emergence of novel phases of matter and pave the way for future comparisons with real experiments.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
