Quantum-Classical Computational Molecular Design of Deuterated High-Efficiency OLED Emitters

• URL: http://arxiv.org/abs/2110.14836v1
• Date: Thu, 28 Oct 2021 01:29:44 GMT
• Title: Quantum-Classical Computational Molecular Design of Deuterated High-Efficiency OLED Emitters
• Authors: Qi Gao, Gavin O. Jones, Michihiko Sugawara, Takao Kobayashi, Hiroki Yamashita, Hideaki Kawaguchi, Shu Tanaka, Naoki Yamamoto
• Abstract summary: This study describes a hybrid quantum-classical computational approach for designing synthesizable $Alq_3$ emitters. We show that a factorization machine-based approach can yield accurate property predictions for all 64 deuterated $Alq_3$ emitters. We observe that both VQE and QAOA calculations can predict the optimal molecule with greater than 0.95 probability on quantum simulators.
• Score: 6.478822860398177
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This study describes a hybrid quantum-classical computational approach for designing synthesizable deuterated $Alq_3$ emitters possessing desirable emission quantum efficiencies (QEs). This design process has been performed on the tris(8-hydroxyquinolinato) ligands typically bound to aluminum in $Alq_3$. It involves a multi-pronged approach which first utilizes classical quantum chemistry to predict the emission QEs of the $Alq_3$ ligands. These initial results were then used as a machine learning dataset for a factorization machine-based model which was applied to construct an Ising Hamiltonian to predict emission quantum efficiencies on a classical computer. We show that such a factorization machine-based approach can yield accurate property predictions for all 64 deuterated $Alq_3$ emitters with 13 training values. Moreover, another Ising Hamiltonian could be constructed by including synthetic constraints which could be used to perform optimizations on a quantum simulator and device using the variational quantum eigensolver (VQE) and quantum approximate optimization algorithm (QAOA) to discover a molecule possessing the optimal QE and synthetic cost. We observe that both VQE and QAOA calculations can predict the optimal molecule with greater than 0.95 probability on quantum simulators. These probabilities decrease to 0.83 and 0.075 for simulations with VQE and QAOA, respectively, on a quantum device, but these can be improved to 0.90 and 0.084 by mitigating readout error. Application of a binary search routine on quantum devices improves these results to a probability of 0.97 for simulations involving VQE and QAOA.

Related papers

• Leveraging Analog Quantum Computing with Neutral Atoms for Solvent Configuration Prediction in Drug Discovery [0.0]
  We introduce quantum algorithms able to sample equilibrium water solvent molecules configurations within proteins. We combine a quantum placement strategy to the 3D Reference Interaction Site Model (3D-RISM), an approach capable of predicting continuous solvent distributions. These algorithms open a new route towards the application of analog quantum computing in molecular modelling and drug design.
  arXiv  Detail & Related papers  (2023-09-21T14:50:45Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Potential energy surfaces inference of both ground and excited state using hybrid quantum-classical neural network [0.0]
  A hybrid quantum-classical neural network has been proposed for surrogate modeling of the variational quantum eigensolver. We extend the model by using the subspace-search variational quantum eigensolver procedure so that the PESs of the both ground and excited state can be inferred with chemical accuracy.
  arXiv  Detail & Related papers  (2022-12-06T14:28:44Z)
• Differentiable matrix product states for simulating variational quantum computational chemistry [6.954927515599816]
  We propose a parallelizable classical simulator for variational quantum eigensolver(VQE) Our simulator seamlessly integrates the quantum circuit evolution into the classical auto-differentiation framework. As applications, we use our simulator to study commonly used small molecules such as HF, LiH and H$$O, as well as larger molecules CO$$, BeH$ and H$_4$ with up to $40$ qubits.
  arXiv  Detail & Related papers  (2022-11-15T08:36:26Z)
• Comparative study of adaptive variational quantum eigensolvers for multi-orbital impurity models [0.31317409221921144]
  We compare the performance of different variational quantum eigensolvers in ground state preparation for interacting multi-orbital embedding impurity models. We show that state preparation with fidelities better than $99.9%$ can be achieved using about $214$ shots per measurement circuit.
  arXiv  Detail & Related papers  (2022-03-13T19:49:33Z)
• Estimating Phosphorescent Emission Energies in Ir(III) Complexes using Large-Scale Quantum Computing Simulations [0.0]
  We apply the iterative qubit coupled cluster (iQCC) method on classical hardware to the calculation of the transition energies in nine phosphorescent iridium complexes. Our simulations would require a gate-based quantum computer with a minimum of 72 fully-connected and error-corrected logical qubits. The iQCC quantum method is found to match the accuracy of the fine-tuned DFT functionals, has a better Pearson correlation coefficient, and still has considerable potential for systematic improvement.
  arXiv  Detail & Related papers  (2021-11-07T20:02:10Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.