Related papers: Schrieffer-Wolff Transformation on IBM Quantum Com…
Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is…
Quantum algorithms based on classical processing of individual samples have recently emerged as the most effective and robust methods to approximate ground-state wave functions of many-body quantum systems on pre-fault-tolerant and…
Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer…
Relativistic spin effects drive subtle molecular phenomena ranging from intersystem crossing in photodynamic therapy to spin-mediated catalysis and high-resolution spectroscopy. These effects are described by the Pauli-Breit Hamiltonian,…
The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…
Accurate quantum chemistry simulations remain challenging on classical computers for problems of industrially relevant sizes and there is reason for hope that quantum computing may help push the boundaries of what is technically feasible.…
One of the central difficulties in the quantization of the gravitational interactions is that they are described by a set of constraints. The standard strategy for dealing with the problem is the Dirac quantization procedure, which leads to…
Classical data analysis requires computational efforts that become intractable in the age of Big Data. An essential task in time series analysis is the extraction of physically meaningful information from a noisy time series. One algorithm…
Simulating quantum many-body dynamics is important both for fundamental understanding of physics and practical applications for quantum information processing. Therefore, classical simulation methods have been developed so far.…
Exploiting permutation invariance to reduce the exponential scaling of semidefinite programs in quantum information has emerged as a powerful computational technique. In this work, we develop a systematic framework for using this reduction…
This thesis presents an efficient quantum algorithm and explicit circuits for generating eigenstates of arbitrary SU(2) and SU(3) representations. These include a wide variety of highly entangled states. The algorithm uses Schur transform…
In this paper we develop a quantum algorithm to realize finite temperature simulation on a quantum computer. As quantum computers use real-time evolution we did not use the imaginary time methods popular on classical algorithms. Instead, we…
Quasiparticle (QP) excitations are extremely important for understanding and predicting charge transfer and transport in molecules, nanostructures and extended systems. Since density functional theory (DFT) within the Kohn-Sham (KS)…
We discuss the low-energy physics of the three-orbital Anderson impurity model with the Coulomb interaction term of the Kanamori form which has orbital SO(3) and spin SU(2) symmetry and describes systems with partially occupied $t_{2g}$…
While many classical algorithms rely on Laplace transforms, it has remained an open question whether these operations could be implemented efficiently on quantum computers. In this work, we introduce the Quantum Laplace Transform (QLT),…
We investigate a quantum dot (Anderson impurity) coupled to metallic leads, with a time-periodic voltage bias across the device. Using a time-dependent Schrieffer-Wolff transformation, we show that the Floquet Hamiltonian of the model can…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
Hamiltonian learning is crucial to the certification of quantum devices and quantum simulators. In this paper, we propose a hybrid quantum-classical Hamiltonian learning algorithm to find the coefficients of the Pauli operator components of…
Certain aspects of some unitary quantum systems are well-described by evolution via a non-Hermitian effective Hamiltonian, as in the Wigner-Weisskopf theory for spontaneous decay. Conversely, any non-Hermitian Hamiltonian evolution can be…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…