Abstract We numerically emulate noisy intermediate-scale quantum (NISQ) devices and determine the minimal hardware requirements for two-site hybrid quantum–classical dynamical mean-field theory (DMFT). We develop a circuit recompilation algorithm which significantly reduces the number of quantum gates of the DMFT algorithm and find that the quantum–classical algorithm converges if the two-qubit gate fidelities are larger than 99%. The converged results agree with the exact solution within 10%, and perfect agreement within noise-induced error margins can be obtained for two-qubit gate fidelities exceeding 99.9%. By comparison, the quantum–classical algorithm without circuit recompilation requires a two-qubit gate fidelity of at least 99.999% to achieve perfect agreement with the exact solution. We thus find quantum–classical DMFT calculations can be run on the next generation of NISQ devices if combined with the recompilation techniques developed in this work.
Abstract We numerically emulate noisy intermediate-scale quantum (NISQ) devices and determine the minimal hardware requirements for two-site hybrid quantum–classical dynamical mean-field theory (DMFT). We develop a circuit recompilation algorithm which significantly reduces the number of quantum gates of the DMFT algorithm and find that the quantum–classical algorithm converges if the two-qubit gate fidelities are larger than 99%. The converged results agree with the exact solution within 10%, and perfect agreement within noise-induced error margins can be obtained for two-qubit gate fidelities exceeding 99.9%. By comparison, the quantum–classical algorithm without circuit recompilation requires a two-qubit gate fidelity of at least 99.999% to achieve perfect agreement with the exact solution. We thus find quantum–classical DMFT calculations can be run on the next generation of NISQ devices if combined with the recompilation techniques developed in this work.
Abstract We report on a quantum–classical simulation of the single-band Hubbard model using two-site dynamical mean-field theory (DMFT). Our approach uses IBM’s superconducting qubit chip to compute the zero-temperature impurity Green’s function in the time domain and a classical computer to fit the measured Green’s functions and extract their frequency domain parameters. We find that the quantum circuit synthesis (Trotter) and hardware errors lead to incorrect frequency estimates, and subsequently to an inaccurate quasiparticle weight when calculated from the frequency derivative of the self-energy. These errors produce incorrect hybridization parameters that prevent the DMFT algorithm from converging to the correct self-consistent solution. To avoid this pitfall, we compute the quasiparticle weight by integrating the quasiparticle peaks in the spectral function. This method is much less sensitive to Trotter errors and allows the algorithm to converge to self-consistency for a half-filled Mott insulating system after applying quantum error mitigation techniques to the quantum simulation data.
The developments of quantum computing algorithms and experiments for atomic scale simulations have largely focused on quantum chemistry for molecules, while their application in condensed matter systems is scarcely explored. Here we present a quantum algorithm to perform dynamical mean field theory (DMFT) calculations for condensed matter systems on currently available quantum computers, and demonstrate it on two quantum hardware platforms. DMFT is required to properly describe the large class of materials with strongly correlated electrons. The computationally challenging part arises from solving the effective problem of an interacting impurity coupled to a bath, which scales exponentially with system size on conventional computers. An exponential speedup is expected on quantum computers, but the algorithms proposed so far are based on real time evolution of the wavefunction, which requires high-depth circuits and hence very low noise levels in the quantum hardware. Here we propose an alternative approach, which uses the variational quantum eigensolver (VQE) method for ground and excited states to obtain the needed quantities as part of an exact diagonalization impurity solver. We present the algorithm for a two site DMFT system, which we benchmark using simulations on conventional computers as well as experiments on superconducting and trapped ion qubits, demonstrating that this method is suitable for running DMFT calculations on currently available quantum hardware.
Quantum computers (QC) could harbor the potential to significantly advance materials simulations, particularly at the atomistic scale involving strongly correlated fermionic systems, where an accurate description of quantum many-body effects scales unfavorably with size. While a full-scale treatment of condensed matter systems with currently available noisy quantum computers remains elusive, quantum embedding schemes like dynamical mean-field theory (DMFT) allow the mapping of an effective, reduced subspace Hamiltonian to available devices to improve the accuracy of ab initio calculations such as density functional theory (DFT). Here, we report on the development of a hybrid quantum-classical DFT + DMFT simulation framework which relies on a quantum impurity solver based on the Lehmann representation of the impurity Green’s function. Hardware experiments with up to 14 qubits on the IBM Quantum system are conducted, using advanced error mitigation methods and a novel calibration scheme for an improved zero-noise extrapolation to effectively reduce adverse effects from inherent noise on current quantum devices. We showcase the utility of our quantum DFT + DMFT workflow by assessing the correlation effects on the electronic structure of a real material, Ca 2 CuO 2 Cl 2 , which is mapped to an effective single-band Hubbard Hamiltonian and the subsequently derived Anderson impurity model solved with up to 6 bath sites on available quantum hardware. Further, we carefully benchmark our quantum results with respect to exact reference solutions and experimental spectroscopy measurements. While challenges remain to scale our approach to larger, multi-orbital and multi-site systems with more bath sites, the present work marks an important milestone towards achieving utility-scale quantum computation in materials simulation.
We explore a method for automatically recompiling a quantum circuit A into a target circuit B , with the goal that both circuits have the same action on a specific input i.e. B ∣ i n ⟩ = A ∣ i n ⟩ . This is of particular relevance to hybrid, NISQ-era algorithms for dynamical simulation or eigensolving. The user initially specifies B as a blank template: a layout of parameterised unitary gates configured to the identity. The compilation then proceeds using quantum hardware to perform an isomorphic energy-minimisation task, and an optional gate elimination phase to compress the circuit. If B is insufficient for perfect recompilation then the method will result in an approximate solution. We optimise using imaginary time evolution, and a recent extension of quantum natural gradient for noisy settings. We successfully recompile a 7 -qubit circuit involving 186 gates of multiple types into an alternative form with a different topology, far fewer two-qubit gates, and a smaller family of gate types. Moreover we verify that the process is r o b u s t , finding that per-gate noise of up to 1 % can still yield near-perfect recompilation. We test the scaling of our algorithm on up to 20 qubits, recompiling into circuits with up to 400 parameterized gates, and incorporate a custom adaptive timestep technique. We note that a classical simulation of the process can be useful to optimise circuits for today's prototypes, and more generally the method may enable `blind' compilation i.e. harnessing a device whose response to control parameters is deterministic but unknown.The code and resources used to generate our results are openly available online \cite{githubLink} \cite{mmaGithubLink}. A simple Mathematica demonstration of our algorithm can be found at questlink.qtechtheory.org.
The developments of quantum computing algorithms and experiments for atomic scale simulations have largely focused on quantum chemistry for molecules, while their application in condensed matter systems is scarcely explored. Here we present a quantum algorithm to perform dynamical mean field theory (DMFT) calculations for condensed matter systems on currently available quantum computers, and demonstrate it on two quantum hardware platforms. DMFT is required to properly describe the large class of materials with strongly correlated electrons. The computation-ally challenging part arises from solving the effective problem of an interacting impurity coupled to a bath, which scales exponentially with system size on conventional computers. An exponential speedup is expected on quantum computers, but the algorithms proposed so far are based on real time evolution of the wavefunction, which requires high-depth circuits and hence very low noise levels in the quantum hardware. Here we propose an alternative approach, which uses the variational quantum eigensolver (VQE) method for ground and excited states to obtain the needed quantities as part of an exact diagonalization impurity solver. We present the algorithm for a two site DMFT system, which we benchmark using simulations on conventional computers as well as experiments on superconducting and trapped ion qubits, demonstrating that this method is suitable for running DMFT calculations on currently available quantum hardware.
Quantum algorithms offer an exponential speedup over classical algorithms for a range of computational problems. The fundamental mechanisms underlying quantum computation required the development and construction of quantum computers. These devices are referred to as NISQ (Noisy Intermediate-Scale Quantum) devices. Not only are NISQ devices extremely limited in their qubit count but they also suffer from noise during computation and this problem only gets worse as the size of the circuit increases which limits the practical use of quantum computers for modern day applications. This paper will focus on utilizing quantum circuit partitioning to overcome the inherent issues of NISQ devices. Partitioning a quantum circuit into smaller subcircuits has allowed for the execution of quantum circuits that are too large to fit on one quantum device. There have been many previous approaches to quantum circuit partitioning and each of these approaches differ in how they work with some focusing on hardware-aware partitioning, optimal graph-based partitioning, multi-processor architectures and many more. These approaches achieve success in their objective but they often fail to scale well which impacts cost and noise. The ultimate goal of this paper is to mitigate these issues by minimizing 3 important metrics; noise, time and cost. To achieve this we use dynamic partitioning for practical circuit cutting and we take advantage of the benefits of hybrid execution where classical computation will be used alongside quantum hardware. This approach has proved to be beneficial with respect to noise with classical execution enabling a 42.30% reduction in noise and a 40% reduction in the number of qubits required in cases where a mixture of classical and quantum computation were required.