اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Quantum Algorithm to Calculate Band Structure at the EOM Level of Theory
96
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Band structure is a cornerstone to understand electronic properties of materials. Accurate band structure calculations using a high-level quantum-chemistry theory can be computationally very expensive. It is promising to speed up such calculations with a quantum computer. In this study, we present a quantum algorithm for band structure calculation based on the equation-of-motion (EOM) theory. First, we introduce a new variational quantum eigensolver algorithm named ADAPT-C for ground-state quantum simulation of solids, where the wave function is built adaptively from a complete set of anti-Hermitian operators. Then, on top of the ADAPT-C ground state, quasiparticle energies and the band structure can be calculated using the EOM theory in a quantum-subspace-expansion (QSE) style, where the projected excitation operators guarantee that the killer condition is satisfied. As a proof of principle, such an EOM-ADAPT-C protocol is used to calculate the band structures of silicon and diamond using a quantum computer simulator.
قيم البحث
اقرأ أيضاً
Recent advances in qubit fidelity and hardware availability have driven efforts to simulate molecular systems of increasing complexity in a quantum computer and motivated us to to design quantum algorithms for solving the electronic structure of peri
odic crystalline solids. To this effect, we present a hybrid quantum-classical algorithm based on Variational Quantum Deflation [Higgott et al., Quantum, 2019, 3, 156] and Quantum Phase Estimation [Dobv{s}iv{c}ek et al., Phys. Rev. A, 2007, 76, 030306(R)] to solve the band structure of any periodic system described by an adequate tight-binding model. We showcase our algorithm by computing the band structure of a simple-cubic crystal with one $s$ and three $p$ orbitals per site (a simple model for Polonium) using simulators with increasingly realistic levels of noise and culminating with calculations on IBM quantum computers. Our results show that the algorithm is reliable in a low-noise device, functional with low precision on present-day noisy quantum computers, and displays a complexity that scales as $Omega(M^3)$ with the number $M$ of tight-binding orbitals per unit-cell, similarly to its classical counterparts. Our simulations offer a new insight into the quantum mindset applied to solid state systems and suggest avenues to explore the potential of quantum computing in materials science.
Development of quantum architectures during the last decade has inspired hybrid classical-quantum algorithms in physics and quantum chemistry that promise simulations of fermionic systems beyond the capability of modern classical computers, even befo
re the era of quantum computing fully arrives. Strong research efforts have been recently made to obtain minimal depth quantum circuits which could accurately represent chemical systems. Here, we show that unprecedented methods used in quantum chemistry, designed to simulate molecules on quantum processors, can be extended to calculate properties of periodic solids. In particular, we present minimal depth circuits implementing the variational quantum eigensolver algorithm and successfully use it to compute the band structure of silicon on a quantum machine for the first time. We are convinced that the presented quantum experiments performed on cloud-based platforms will stimulate more intense studies towards scalable electronic structure computation of advanced quantum materials.
Improving the efficiency and accuracy of energy calculations has been of significant and continued interest in the area of materials informatics, a field that applies machine learning techniques to computational materials data. Here, we present a heu
ristic quantum-classical algorithm to efficiently model and predict the energies of substitutionally disordered binary crystalline materials. Specifically, a quantum circuit that scales linearly in the number of lattice sites is designed and trained to predict the energies of quantum chemical simulations in an exponentially-scaling feature space. This circuit is trained by classical supervised-learning using data obtained from classically-computed quantum chemical simulations. As a part of the training process, we introduce a sub-routine that is able to detect and rectify anomalies in the input data. The algorithm is demonstrated on the complex layer-structured of Li-cobaltate system, a widely-used Li-ion battery cathode material component. Our results shows that the proposed quantum circuit model presents a suitable choice for modelling the energies obtained from such quantum mechanical systems. Furthermore, analysis of the anomalous data provides important insights into the thermodynamic properties of the systems studied.
How to calculate the exponential of matrices in an explicit manner is one of fundamental problems in almost all subjects in Science. Especially in Mathematical Physics or Quantum Optics many problems are reduced to this calculation by making use of
some approximations whether they are appropriate or not. However, it is in general not easy. In this paper we give a very useful formula which is both elementary and getting on with computer.
The conventional theory of solids is well suited to describing band structures locally near isolated points in momentum space, but struggles to capture the full, global picture necessary for understanding topological phenomena. In part of a recent pa
per [B. Bradlyn et al., Nature 547, 298 (2017)], we have introduced the way to overcome this difficulty by formulating the problem of sewing together many disconnected local k-dot-p band structures across the Brillouin zone in terms of graph theory. In the current manuscript we give the details of our full theoretical construction. We show that crystal symmetries strongly constrain the allowed connectivities of energy bands, and we employ graph-theoretic techniques such as graph connectivity to enumerate all the solutions to these constraints. The tools of graph theory allow us to identify disconnected groups of bands in these solutions, and so identify topologically distinct insulating phases.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
