اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA product formula and combinatorial field theory
126
0
0.0
(
0
)
تأليف
A. Horzela
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We treat the problem of normally ordering expressions involving the standard boson operators a, a* where [a,a*]=1. We show that a simple product formula for formal power series - essentially an extension of the Taylor expansion - leads to a double exponential formula which enables a powerful graphical description of the generating functions of the combinatorial sequences associated with such functions - in essence, a combinatorial field theory. We apply these techniques to some examples related to specific physical Hamiltonians.
قيم البحث
اقرأ أيضاً
The derivation of the Feynman path integral based on the Trotter product formula is extended to the case where the system is in a magnetic field.
Although symmetry methods and analysis are a necessary ingredient in every physicists toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the partition functi
on, for example, is essentially a combinatorial problem. In this talk we shall show that one approach is via the normal ordering of the second quantized operators appearing in the partition function. This in turn leads to a combinatorial graphical description, giving essentially Feynman-type graphs associated with the theory. We illustrate this methodology by the explicit calculation of two model examples, the free boson gas and a superfluid boson model. We show how the calculation of partition functions can be facilitated by knowledge of the combinatorics of the boson normal ordering problem; this naturally gives rise to the Bell numbers of combinatorics. The associated graphical representation of these numbers gives a perturbation expansion in terms of a sequence of graphs analogous to zero - dimensional Feynman diagrams.
A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon which we to
uch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fermions, commute, we subsequently restrict ourselves to consideration of a single species, single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, specifically Bell and Stirling numbers. We explicitly give the generating functions for some classes of these numbers. In this note we concentrate on the combinatorial graph approach, showing how some important classical results of graph theory lead to transparent representations of the combinatorial numbers associated with the boson normal ordering problem.
The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as Bell and S
tirling numbers. We explicitly give the generating functions for some classes of these numbers. Finally we show that a graphical representation of these combinatorial numbers leads to sets of model field theories, for which the graphs may be interpreted as Feynman diagrams corresponding to the bosons of the theory. The generating functions are the generators of the classes of Feynman diagrams.
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems using a universal quantum computer. However, existing algorithms generally approximate the entire time evolution operators, which may ne
ed a deep quantum circuit that are beyond the capability of near-term noisy quantum devices. Here, focusing on the time evolution of a fixed input quantum state, we propose an adaptive approach to construct a low-depth time evolution circuit. By introducing a measurable quantifier that describes the simulation error, we use an adaptive strategy to learn the shallow quantum circuit that minimizes the simulation error. We numerically test the adaptive method with the electronic Hamiltonians of $mathrm{H_2O}$ and $mathrm{H_4}$ molecules, and the transverse field ising model with random coefficients. Compared to the first-order Suzuki-Trotter product formula, our method can significantly reduce the circuit depth (specifically the number of two-qubit gates) by around two orders while maintaining the simulation accuracy. We show applications of the method in simulating many-body dynamics and solving energy spectra with the quantum Krylov algorithm. Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
