اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAccelerated variational algorithms for digital quantum simulation of many-body ground states
73
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog sense, adiabatic evolution has been proposed to slowly evolve a simple Hamiltonian, initialized in its ground state, to the Hamiltonian of interest such that the final state becomes the desired ground state. Recently, variational methods have also been proposed and realized in quantum simulators for emulating the ground state of many-body systems. Here, we first provide a quantitative comparison between the adiabatic and variational methods with respect to required quantum resources on digital quantum simulators, namely the depth of the circuit and the number of two-qubit quantum gates. Our results show that the variational methods are less demanding with respect to these resources. However, they need to be hybridized with a classical optimization which can converge slowly. Therefore, as the second result of the paper, we provide two different approaches for speeding the convergence of the classical optimizer by taking a good initial guess for the parameters of the variational circuit. We show that these approaches are applicable to a wide range of Hamiltonian and provide significant improvement in the optimization procedure.
قيم البحث
اقرأ أيضاً
While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum states on a
lattice in real space. In particular, the present algorithm is able to prepare general pure and mixed many-particle states of any number of particles. It relies on a procedure for converting from a second-quantized state to its first-quantized counterpart. The algorithm is efficient in that it operates in time that is polynomial in all the essential descriptors of the system, such the number of particles, the resolution of the lattice, and the inverse of the maximum final error. This scaling holds under the assumption that the wavefunction to be prepared is bounded or its indefinite integral known and that the Fock operator of the system is efficiently simulatable.
We discuss classical algorithms for approximating the largest eigenvalue of quantum spin and fermionic Hamiltonians based on semidefinite programming relaxation methods. First, we consider traceless $2$-local Hamiltonians $H$ describing a system of $
n$ qubits. We give an efficient algorithm that outputs a separable state whose energy is at least $lambda_{max}/O(log n)$, where $lambda_{max}$ is the maximum eigenvalue of $H$. We also give a simplified proof of a theorem due to Lieb that establishes the existence of a separable state with energy at least $lambda_{max}/9$. Secondly, we consider a system of $n$ fermionic modes and traceless Hamiltonians composed of quadratic and quartic fermionic operators. We give an efficient algorithm that outputs a fermionic Gaussian state whose energy is at least $lambda_{max}/O(nlog n)$. Finally, we show that Gaussian states can vastly outperform Slater determinant states commonly used in the Hartree-Fock method. We give a simple family of Hamiltonians for which Gaussian states and Slater determinants approximate $lambda_{max}$ within a fraction $1-O(n^{-1})$ and $O(n^{-1})$ respectively.
We introduce reinforcement learning (RL) formulations of the problem of finding the ground state of a many-body quantum mechanical model defined on a lattice. We show that stoquastic Hamiltonians - those without a sign problem - have a natural decomp
osition into stochastic dynamics and a potential representing a reward function. The mapping to RL is developed for both continuous and discrete time, based on a generalized Feynman-Kac formula in the former case and a stochastic representation of the Schrodinger equation in the latter. We discuss the application of this mapping to the neural representation of quantum states, spelling out the advantages over approaches based on direct representation of the wavefunction of the system.
Coupling a quantum many-body system to an external environment dramatically changes its dynamics and offers novel possibilities not found in closed systems. Of special interest are the properties of the steady state of such open quantum many-body sys
tems, as well as the relaxation dynamics towards the steady state. However, new computational tools are required to simulate open quantum many-body systems, as methods developed for closed systems cannot be readily applied. We review several approaches to simulate open many-body systems and point out the advances made in recent years towards the simulation of large system sizes.
In recent years, there has been a significant progress in the development of digital quantum processors. The state-of-the-art quantum devices are imperfect, and fully-algorithmic fault-tolerant quantum computing is a matter of future. Until technolog
y develops to the state with practical error correction, computational approaches other than the standard digital one can be used to avoid execution of the most noisy quantum operations. We demonstrate how a hybrid digital-analog approach allows simulating dynamics of a transverse-field Ising model without standard two-qubit gates, which are currently one of the most problematic building blocks of quantum circuits. We use qubit-qubit crosstalks (couplings) of IBM superconducting quantum processors to simulate Trotterized dynamics of spin clusters and then we compare the obtained results with the results of conventional digital computation based on two-qubit gates from the universal set. The comparison shows that digital-analog approach significantly outperforms standard digital approach for this simulation problem, despite of the fact that crosstalks in IBM quantum processors are small. We argue that the efficiency of digital-analog quantum computing can be improved with the help of more specialized processors, so that they can be used to efficiently implement other quantum algorithms. This indicates the prospect of a digital-to-analog strategy for near-term noisy intermediate-scale quantum computers.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
