Searcharxiv⌕ Search

arXiv subjects

Jiří Pittner

Publications and source records attributed to Jiří Pittner.

20 records · Page 2Linked to original sources

Relativistic quantum chemistry on quantum computers

Last years witnessed a remarkable interest in application of quantum computing for solving problems in quantum chemistry more efficiently than classical computers allow. Very recently, even first proof-of-principle experimental realizations have been reported. However, so far only the non-relativistic regime (i.e. Schroedinger equation) has been explored, while it is well known that relativistic effects can be very important in chemistry. In this letter we present the first quantum algorithm for relativistic computations of molecular energies. We show how to efficiently solve the eigenproblem of the Dirac-Coulomb Hamiltonian on a quantum computer and demonstrate the functionality of the proposed procedure by numerical simulations of computations of the spin-orbit splitting in the SbH molecule. Finally, we propose quantum circuits with 3 qubits and 9 or 10 CNOTs, which implement a proof-of-principle relativistic quantum chemical calculation for this molecule and might be suitable for an experimental realization.

quant-ph↗

Quantum computing applied to calculations of molecular energies: CH2 benchmark

Quantum computers are appealing for their ability to solve some tasks much faster than their classical counterparts. It was shown in [Aspuru-Guzik et al., Science 309, 1704 (2005)] that they, if available, would be able to perform the full configuration interaction (FCI) energy calculations with a polynomial scaling. This is in contrast to conventional computers where FCI scales exponentially. We have developed a code for simulation of quantum computers and implemented our version of the quantum full configuration interaction algorithm. We provide a detailed description of this algorithm and the results of the assessment of its performance on the four lowest lying electronic states of CH2 molecule. This molecule was chosen as a benchmark, since its two lowest lying 1A1 states exhibit a multireference character at the equilibrium geometry. It has been shown that with a suitably chosen initial state of the quantum register, one is able to achieve the probability amplification regime of the iterative phase estimation algorithm even in this case.

quant-ph↗