Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Variational Quantum Algorithm for Preparing Quantum Gibbs States
86
0
0.0
(
0
)
Added by
Anirban Narayan Chowdhury
Publication date
2020
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Preparation of Gibbs distributions is an important task for quantum computation. It is a necessary first step in some types of quantum simulations and further is essential for quantum algorithms such as quantum Boltzmann training. Despite this, most methods for preparing thermal states are impractical to implement on near-term quantum computers because of the memory overheads required. Here we present a variational approach to preparing Gibbs states that is based on minimizing the free energy of a quantum system. The key insight that makes this practical is the use of Fourier series approximations to the logarithm that allows the entropy component of the free-energy to be estimated through a sequence of simpler measurements that can be combined together using classical post processing. We further show that this approach is efficient for generating high-temperature Gibbs states, within constant error, if the initial guess for the variational parameters for the programmable quantum circuit are sufficiently close to a global optima. Finally, we examine the procedure numerically and show the viability of our approach for five-qubit Hamiltonians using Trotterized adiabatic state preparation as an ansatz.
rate research
Read More
One of the most fundamental problems in quantum many-body physics is the characterization of correlations among thermal states. Of particular relevance is the thermal area law, which justifies the tensor network approximations to thermal states with a bond dimension growing polynomially with the system size. In the regime of sufficiently low temperatures, which is particularly important for practical applications, the existing techniques do not yield optimal bounds. Here, we propose a new thermal area law that holds for generic many-body systems on lattices. We improve the temperature dependence from the original $mathcal{O}(beta)$ to $tilde{mathcal{O}}(beta^{2/3})$, thereby suggesting diffusive propagation of entanglement by imaginary time evolution. This qualitatively differs from the real-time evolution which usually induces linear growth of entanglement. We also prove analogous bounds for the Renyi entanglement of purification and the entanglement of formation. Our analysis is based on a polynomial approximation to the exponential function which provides a relationship between the imaginary-time evolution and random walks. Moreover, for one-dimensional (1D) systems with $n$ spins, we prove that the Gibbs state is well-approximated by a matrix product operator with a sublinear bond dimension of $e^{sqrt{tilde{mathcal{O}}(beta log(n))}}$. This proof allows us to rigorously establish, for the first time, a quasi-linear time classical algorithm for constructing an MPS representation of 1D quantum Gibbs states at arbitrary temperatures of $beta = o(log(n))$. Our new technical ingredient is a block decomposition of the Gibbs state, that bears resemblance to the decomposition of real-time evolution given by Haah et al., FOCS18.
We propose a protocol for coherently transferring non-Gaussian quantum states from optical field to a mechanical oscillator. The open quantum dynamics and continuous-measurement process, which can not be treated by the stochastic-master-equation formalism, are studied by a new path-integral-based approach. We obtain an elegant relation between the quantum state of the mechanical oscillator and that of the optical field, which is valid for general linear quantum dynamics. We demonstrate the experimental feasibility of such protocol by considering the cases of both large-scale gravitational-wave detectors and small-scale cavity-assisted optomechanical devices.
We propose an algorithm based on variational quantum imaginary time evolution for solving the Feynman-Kac partial differential equation resulting from a multidimensional system of stochastic differential equations. We utilize the correspondence between the Feynman-Kac partial differential equation (PDE) and the Wick-rotated Schr{o}dinger equation for this purpose. The results for a $(2+1)$ dimensional Feynman-Kac system, obtained through the variational quantum algorithm are then compared against classical ODE solvers and Monte Carlo simulation. We see a remarkable agreement between the classical methods and the quantum variational method for an illustrative example on six qubits. In the non-trivial case of PDEs which are preserving probability distributions -- rather than preserving the $ell_2$-norm -- we introduce a proxy norm which is efficient in keeping the solution approximately normalized throughout the evolution. The algorithmic complexity and costs associated to this methodology, in particular for the extraction of properties of the solution, are investigated. Future research topics in the areas of quantitative finance and other types of PDEs are also discussed.
We propose a neural-network variational quantum algorithm to simulate the time evolution of quantum many-body systems. Based on a modified restricted Boltzmann machine (RBM) wavefunction ansatz, the proposed algorithm can be efficiently implemented in near-term quantum computers with low measurement cost. Using a qubit recycling strategy, only one ancilla qubit is required to represent all the hidden spins in an RBM architecture. The variational algorithm is extended to open quantum systems by employing a stochastic Schrodinger equation approach. Numerical simulations of spin-lattice models demonstrate that our algorithm is capable of capturing the dynamics of closed and open quantum many-body systems with high accuracy without suffering from the vanishing gradient (or barren plateau) issue for the considered system sizes.
Rapid developments of quantum information technology show promising opportunities for simulating quantum field theory in near-term quantum devices. In this work, we formulate the theory of (time-dependent) variational quantum simulation, explicitly designed for quantum simulation of quantum field theory. We develop hybrid quantum-classical algorithms for crucial ingredients in particle scattering experiments, including encoding, state preparation, and time evolution, with several numerical simulations to demonstrate our algorithms in the 1+1 dimensional $lambda phi^4$ quantum field theory. These algorithms could be understood as near-term analogs of the Jordan-Lee-Preskill algorithm, the basic algorithm for simulating quantum field theory using universal quantum devices. Our contribution also includes a bosonic version of the Unitary Coupled Cluster ansatz with physical interpretation in quantum field theory, a discussion about the subspace fidelity, a comparison among different bases in the 1+1 dimensional $lambda phi^4$ theory, and the spectral crowding in the quantum field theory simulation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
