اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHamiltonian complexity
182
0
0.0
(
0
)
تأليف
Tobias J. Osborne
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In recent years weve seen the birth of a new field known as hamiltonian complexity lying at the crossroads between computer science and theoretical physics. Hamiltonian complexity is directly concerned with the question: how hard is it to simulate a physical system? Here I review the foundational results, guiding problems, and future directions of this emergent field.
قيم البحث
اقرأ أيضاً
The efficient validation of quantum devices is critical for emerging technological applications. In a wide class of use-cases the precise engineering of a Hamiltonian is required both for the implementation of gate-based quantum information processin
g as well as for reliable quantum memories. Inferring the experimentally realized Hamiltonian through a scalable number of measurements constitutes the challenging task of Hamiltonian learning. In particular, assessing the quality of the implementation of topological codes is essential for quantum error correction. Here, we introduce a neural net based approach to this challenge. We capitalize on a family of exactly solvable models to train our algorithm and generalize to a broad class of experimentally relevant sources of errors. We discuss how our algorithm scales with system size and analyze its resilience towards various noise sources.
We use Nielsens geometric approach to quantify the circuit complexity in a one-dimensional Kitaev chain across a topological phase transition. We find that the circuit complexities of both the ground states and non-equilibrium steady states of the Ki
taev model exhibit non-analytical behaviors at the critical points, and thus can be used to detect both {it equilibrium} and {it dynamical} topological phase transitions. Moreover, we show that the locality property of the real-space optimal Hamiltonian connecting two different ground states depends crucially on whether the two states belong to the same or different phases. This provides a concrete example of classifying different gapped phases using Nielsens circuit complexity. We further generalize our results to a Kitaev chain with long-range pairing, and discuss generalizations to higher dimensions. Our result opens up a new avenue for using circuit complexity as a novel tool to understand quantum many-body systems.
We revisit quantum phase estimation algorithms for the purpose of obtaining the energy levels of many-body Hamiltonians and pay particular attention to the statistical analysis of their outputs. We introduce the mean phase direction of the parent dis
tribution associated with eigenstate inputs as a new post-processing tool. By connecting it with the unknown phase, we find that if used as its direct estimator, it exceeds the accuracy of the standard majority rule using one less bit of resolution, making evident that it can also be inverted to provide unbiased estimation. Moreover, we show how to directly use this quantity to accurately find the energy levels when the initialized state is an eigenstate of the simulated propagator during the whole time evolution, which allows for shallower algorithms. We then use IBM Q hardware to carry out the digital quantum simulation of three toy models: a two-level system, a two-spin Ising model and a two-site Hubbard model at half-filling. Methodologies are provided to implement Trotterization and reduce the variability of results in noisy intermediate scale quantum computers.
In this work we present a detailed analysis of variational quantum phase estimation (VQPE), a method based on real-time evolution for ground and excited state estimation on near-term hardware. We derive the theoretical ground on which the approach st
ands, and demonstrate that it provides one of the most compact variational expansions to date for solving strongly correlated Hamiltonians. At the center of VQPE lies a set of equations, with a simple geometrical interpretation, which provides conditions for the time evolution grid in order to decouple eigenstates out of the set of time evolved expansion states, and connects the method to the classical filter diagonalization algorithm. Further, we introduce what we call the unitary formulation of VQPE, in which the number of matrix elements that need to be measured scales linearly with the number of expansion states, and we provide an analysis of the effects of noise which substantially improves previous considerations. The unitary formulation allows for a direct comparison to iterative phase estimation. Our results mark VQPE as both a natural and highly efficient quantum algorithm for ground and excited state calculations of general many-body systems. We demonstrate a hardware implementation of VQPE for the transverse field Ising model. Further, we illustrate its power on a paradigmatic example of strong correlation (Cr2 in the SVP basis set), and show that it is possible to reach chemical accuracy with as few as ~50 timesteps.
The Hamiltonian operator plays a central role in quantum theory being a generator of unitary quantum dynamics. Its expectation value describes the energy of a quantum system. Typically being a non-unitary operator, the action of the Hamiltonian is ei
ther encoded using complex ancilla-based circuits, or implemented effectively as a sum of Pauli string terms. Here, we show how to approximate the Hamiltonian operator as a sum of propagators using a differential representation. The proposed approach, named Hamiltonian operator approximation (HOA), is designed to benefit analog quantum simulators, where one has direct access to simulation of quantum dynamics, but measuring separate circuits is not possible. We describe how to use this strategy in the hybrid quantum-classical workflow for performing energy measurements. Benchmarking the measurement scheme, we discuss the relevance of the discretization step size, stencil order, number of shots, and noise. We also use HOA to prepare ground states of complex material science models with direct iteration and quantum filter diagonalization, finding the lowest energy for the 12-qubit Hamiltonian of hydrogen chain H$_6$ with $10^{-5}$ Hartree precision using $11$ time-evolved reference states. The approach is compared to the variational quantum eigensolver, proving HOA beneficial for systems at increasing size corresponding to noisy large scale quantum devices. We find that for Heisenberg model with twelve or more spins our approach may outperform variational methods, both in terms of the gate depth and the total number of measurements.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
