اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum Fields in a Dielectric: Langevin and Exact Diagonalization Approaches
157
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We derive expressions for the quantum electromagnetic field in a dispersive and dissipative dielectric medium, treating the medium as a continuum. We compare the Langevin approach with the Fano diagonalization procedure for the coupled system composed of the electromagnetic field, the dielectric medium, and the reservoir. In particular, we show that the quantized electric and magnetic fields obtained in both methods have exactly the same form. More generally, in thermal equilibrium, correlation functions computed in both methods are identical.
قيم البحث
اقرأ أيضاً
Building on advanced results on permutations, we show that it is possible to construct, for each irreducible representation of SU(N), an orthonormal basis labelled by the set of {it standard Young tableaux} in which the matrix of the Heisenberg SU(N)
model (the quantum permutation of N-color objects) takes an explicit and extremely simple form. Since the relative dimension of the full Hilbert space to that of the singlet space on $n$ sites increases very fast with N, this formulation allows to extend exact diagonalizations of finite clusters to much larger values of N than accessible so far. Using this method, we show that, on the square lattice, there is long-range color order for SU(5), spontaneous dimerization for SU(8), and evidence in favor of a quantum liquid for SU(10).
Recent advances in selected CI, including the adaptive sampling configuration interaction (ASCI) algorithm and its heat bath extension, have made the ASCI approach competitive with the most accurate techniques available, and hence an increasingly pow
erful tool in solving quantum Hamiltonians. In this work, we show that a useful paradigm for generating efficient selected CI/exact diagonalization algorithms is driven by fast sorting algorithms, much in the same way iterative diagonalization is based on the paradigm of matrix vector multiplication. We present several new algorithms for all parts of performing a selected CI, which includes new ASCI search, dynamic bit masking, fast orbital rotations, fast diagonal matrix elements, and residue arrays. The algorithms presented here are fast and scalable, and we find that because they are built on fast sorting algorithms they are more efficient than all other approaches we considered. After introducing these techniques we present ASCI results applied to a large range of systems and basis sets in order to demonstrate the types of simulations that can be practically treated at the full-CI level with modern methods and hardware, presenting double- and triple-zeta benchmark data for the G1 dataset. The largest of these calculations is Si$_{2}$H$_{6}$ which is a simulation of 34 electrons in 152 orbitals. We also present some preliminary results for fast deterministic perturbation theory simulations that use hash functions to maintain high efficiency for treating large basis sets.
We study the phase diagram of the anisotropic spin-1 Heisenberg chain with single ion anisotropy (D) using a ground-state fidelity approach. The ground-state fidelity and its corresponding susceptibility are calculated within the quantum renormalizat
ion group scheme where we obtained the renormalization of fidelity preventing to calculate the ground state. Using this approach, the phase boundaries between the antiferromagnetic N{e}el, Haldane and large-D phases are obtained for the whole phase diagram, which justifies the application of quantum renormalization group to trace the symmetery protected topological phases. In addition, we present numerical exact diagonalization (Lanczos) results in, which we employ a recently introduced non-local order parameter to locate the transition from Haldane to large-D phase accurately.
We develop a quantum filter diagonalization method (QFD) that lies somewhere between the variational quantum eigensolver (VQE) and the phase estimation algorithm (PEA) in terms of required quantum circuit resources and conceptual simplicity. QFD uses
a set of of time-propagated guess states as a variational basis for approximate diagonalization of a sparse Pauli Hamiltonian. The variational coefficients of the basis functions are determined by the Rayleigh-Ritz procedure by classically solving a generalized eigenvalue problem in the space of time-propagated guess states. The matrix elements of the subspace Hamiltonian and subspace metric matrix are each determined in quantum circuits by a one-ancilla extended swap test, i.e., statistical convergence of a one-ancilla PEA circuit. These matrix elements can be determined by many parallel quantum circuit evaluations, and the final Ritz estimates for the eigenvectors can conceptually be prepared as a linear combination over separate quantum state preparation circuits. The QFD method naturally provides for the computation of ground-state, excited-state, and transition expectation values. We numerically demonstrate the potential of the method by classical simulations of the QFD algorithm for an N=8 octamer of BChl-a chromophores represented by an 8-qubit ab initio exciton model (AIEM) Hamiltonian. Using only a handful of time-displacement points and a coarse, variational Trotter expansion of the time propagation operators, the QFD method recovers an accurate prediction of the absorption spectrum.
We demonstrate a method that merges the quantum filter diagonalization (QFD) approach for hybrid quantum/classical solution of the time-independent electronic Schrodinger equation with a low-rank double factorization (DF) approach for the representat
ion of the electronic Hamiltonian. In particular, we explore the use of sparse compressed double factorization (C-DF) truncation of the Hamiltonian within the time-propagation elements of QFD, while retaining a similarly compressed but numerically converged double-factorized representation of the Hamiltonian for the operator expectation values needed in the QFD quantum matrix elements. Together with significant circuit reduction optimizations and number-preserving post-selection/echo-sequencing error mitigation strategies, the method is found to provide accurate predictions for low-lying eigenspectra in a number of representative molecular systems, while requiring reasonably short circuit depths and modest measurement costs. The method is demonstrated by experiments on noise-free simulators, decoherence- and shot-noise including simulators, and real quantum hardware.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
