Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry

• URL: http://arxiv.org/abs/2112.15540v2
• Date: Thu, 5 May 2022 22:07:08 GMT
• Title: Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry
• Authors: Jerimiah Wright, Meenambika Gowrishankar, Daniel Claudino, Phillip C. Lotshaw, Thien Nguyen, Alexander J. McCaskey, and Travis S. Humble
• Abstract summary: Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
• Score: 51.827942608832025
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The opportunities afforded by near-term quantum computers to calculate the ground-state properties of small molecules depend on the structure of the computational ansatz as well as the errors induced by device noise. Here we investigate the behavior of these noisy quantum circuits using numerical simulations to estimate the accuracy and fidelity of the prepared quantum states relative to the ground truth obtained by conventional means. We implement several different types of ansatz circuits derived from unitary coupled cluster theory for the purposes of estimating the ground-state energy of Sodium Hydride using the variational quantum eigensolver algorithm. We show how relative error in the energy and the fidelity scale with the levels of gate-based noise, the inter-molecular configuration, the ansatz circuit depth, and the parameter optimization methods.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Refining resource estimation for the quantum computation of vibrational molecular spectra through Trotter error analysis [0.0]
  We accurately estimate quantum resources, such as number of qubits and quantum gates, required for vibrational structure calculations on a programmable quantum computer. This work serves as a guide for analyzing the potential quantum advantage within vibrational structure simulations.
  arXiv  Detail & Related papers  (2023-11-07T04:52:27Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Calculation of the moscovium ground-state energy by quantum algorithms [0.0]
  We investigate the possibility to calculate the ground-state energy of the atomic systems on a quantum computer. We evaluate the lowest binding energy of the moscovium atom with the use of the iterative phase estimation and variational quantum eigensolver.
  arXiv  Detail & Related papers  (2022-07-17T18:41:19Z)
• Orders of magnitude reduction in the computational overhead for quantum many-body problems on quantum computers via an exact transcorrelated method [0.0]
  We show that the Hamiltonian becomes non-Hermitian, posing problems for quantum algorithms based on the variational principle. We overcome these limitations with the ansatz-based quantum imaginary time evolution algorithm. Our work paves the way for the use of exact transcorrelated methods for the simulations of ab initio systems on quantum computers.
  arXiv  Detail & Related papers  (2022-01-09T16:37:32Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Digital quantum simulation of strong correlation effects with iterative quantum phase estimation over the variational quantum eigensolver algorithm: $\mathrm{H_4}$ on a circle as a case study [0.0]
  We generate the initial state by using the classical-quantum hybrid variational quantum eigensolver algorithm with unitary coupled cluster ansatz. We demonstrate that a carefully and appropriately prepared initial state can greatly reduce the effects of noise due to sampling in the estimation of the desired eigenphase.
  arXiv  Detail & Related papers  (2021-10-06T15:48:53Z)
• 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)
• Hardware Efficient Quantum Algorithms for Vibrational Structure Calculations [0.0]
  We introduce a framework for the calculation of ground and excited state energies of bosonic systems suitable for near-term quantum devices. We test different parametrizations of the vibrational wave function, which can be encoded in quantum hardware. We evaluate the requirements, number of qubits and circuit depth, for the calculation of vibrational energies on quantum hardware.
  arXiv  Detail & Related papers  (2020-03-27T18:00:23Z)

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.