Hi all,
Tomorrow Luca Righetti will tell us about his master thesis with IBM, entitled 'MC-PDFT Embedding scheme for electronic structure quantum algorithms'. See below for the abstract. The talk will take place at 2pm in HIT J 52 or on Zoom: https://ethz.zoom.us/j/362994444.
Best,
Ladina
%%%%%
In this work we propose a new hybrid quantum algorithm combining the Variational Quan- tum Eigensolver (VQE) algorithm with a classical embedding method. The embedding consists in employing Multiconfiguration Pair Density Functional Theory (MC-PDFT) theory as a post-processing method for calculating the final energy of the system, after obtaining the ground state wave function from the quantum computer. In this way, we are able to treat to exponentially scaling part of the problem with VQE, with the promise of a speed up in the computation. The hybrid algorithm is motivated by the need of prop- erly treating electron correlation in strongly correlated systems. In out case, VQE mainly takes care of the static part of the correlation while the MC-PDFT embedding allows to recover most of the dynamic correlation. The MC-PDFT theory combines wave function calculations with Density Functional Theory (DFT). We also propose a self-consistently optimized version of VQE, where molecular coefficient are re-optimized after every itera- tion until convergence. In this way, we are able to achieve better accuracy in the resulting energy.
By comparing the performance of our algorithm with classical methods having similar computational costs, we observe an improvement in the accuracy of dissociation energies and ground state energies of different molecules. We test our embedding method with H2, H2O and N2. Our aim is not only to enhance the precision of VQE in predicting molecular energies, but also to reduce the depth and the width of the quantum circuit. The classical embedding allows us to alleviate quantum resources by treating part of the dynamical correlation. Since MC-PDFT consists in an active space (AS) calculation, the number of orbitals required is lower and so is the number of qubits. We also achieve a significant reduction in the gate count by combining the MC-PDFT embedding and the ADAPT-VQE algorithm. Results show a reduction in the number of CNOTs by more than half compared to the initial count in some cases. Overall, this algorithm is able to achieve, in most cases, an accuracy comparable to more computationally expensive clas- sical methods and to reduce quantum resources while maintaining a reasonable precision in the results. We believe that this method can pave the way toward the simulation of larger molecular systems with current quantum devices.
Hi all,
Tomorrow Kai Ott will tell us about his semester project with Mischa Woods and Joe Renes, entitled 'Understanding Quantum Clocks: Measures of Precision and Entropy Production'. See below for the abstract. The talk will take place at 2pm in HIT F 32 or on Zoom: https://ethz.zoom.us/j/362994444.
Best,
Ladina
%%%%%
Recent work on quantum clocks has shown quantum-over-classical advantage in time-keeping. In particular, in the limit of large dimensions, quantum ticking clocks can achieve arbitrary precision $R_1$ at vanishing entropy production $\Sigma_1$ per tick, while for classical clocks there is a fundamental trade-off between precision and entropy production per tick, i.e. for any desired precision, there is an associated minimal entropy production. In this work, we show that another type of precision $I_1$ defined via the relative entropy can be made arbitrarily large at vanishing entropy production even for classical ticking clocks of finite dimension. Then, we investigate optimal classical clocks, which achieve the minimum entropy production per tick for a given precision $R_1$. We give closed form solutions for their precision, discuss symmetries, and state how their parameters should be chosen to truly be optimal. Lastly, we relate the classical case to the quantum case to explain the approximate quadratic precision advantage of the latter over the former.