Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian

• URL: http://arxiv.org/abs/2107.07238v2
• Date: Sat, 21 May 2022 00:54:04 GMT
• Title: Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian
• Authors: Sam McArdle, Earl Campbell, Yuan Su
• Abstract summary: Previous resource analyses failed to exploit low fermionic number information in quantum chemistry simulation. We propose techniques that solve both problems by using various factorized decompositions of the electronic structure Hamiltonian.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Achieving an accurate description of fermionic systems typically requires considerably many more orbitals than fermions. Previous resource analyses of quantum chemistry simulation often failed to exploit this low fermionic number information in the implementation of Trotter-based approaches and overestimated the quantum-computer runtime as a result. They also depended on numerical procedures that are computationally too expensive to scale up to large systems of practical interest. Here we propose techniques that solve both problems by using various factorized decompositions of the electronic structure Hamiltonian. We showcase our techniques for the uniform electron gas, finding substantial (over 100x) improvements in Trotter error for low-filling fraction and pushing to much higher numbers of orbitals than is possible with existing methods. Finally, we calculate the T-count to perform phase-estimation on Jellium. In the low-filling regime, we observe improvements in gate complexity of over 10x compared to the best Trotter-based approach reported to date. We also report gate counts competitive with qubitization-based approaches for Wigner-Seitz values of physical interest.

Related papers

• Hamiltonians, groups, graphs and ans\"atze [2.4094285826152593]
  We introduce a new circuit design that combines graph-based diagonalization circuits with arbitrary single-qubit rotation gates. We test the accuracy of the proposed ansatz in estimating ground state energies of various molecules of size up to 12-qubits.
  arXiv  Detail & Related papers  (2023-12-28T17:28:23Z)
• Stochastic modeling of superconducting qudits in the dispersive regime [0.0773931605896092]
  This work focuses on modeling the dispersive quadrature measurement in an open quantum system. We verify our model with a series of experimental results on a transmon-type qutrit.
  arXiv  Detail & Related papers  (2023-10-29T00:39:47Z)
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation [0.0]
  We use fermionic and qubit algebras for the Trotterization of the electronic Hamiltonian. Use of symmetries of the electronic Hamiltonian and its fragments significantly reduces the Trotter error. Fermionic methods tend to introduce quantum circuits with a greater number of T-gates at each Trotter step.
  arXiv  Detail & Related papers  (2022-10-18T22:22:54Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  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.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• 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)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• A multiconfigurational study of the negatively charged nitrogen-vacancy center in diamond [55.58269472099399]
  Deep defects in wide band gap semiconductors have emerged as leading qubit candidates for realizing quantum sensing and information applications. Here we show that unlike single-particle treatments, the multiconfigurational quantum chemistry methods, traditionally reserved for atoms/molecules, accurately describe the many-body characteristics of the electronic states of these defect centers.
  arXiv  Detail & Related papers  (2020-08-24T01:49:54Z)
• Hartree-Fock on a superconducting qubit quantum computer [30.152226344347064]
  Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates. We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene. We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
  arXiv  Detail & Related papers  (2020-04-08T18:00:06Z)
• Term Grouping and Travelling Salesperson for Digital Quantum Simulation [6.945601123742983]
  Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian makes such an approach unsuitable for near-term devices. We propose a new term ordering strategy, max-commute-tsp, that simultaneously mitigates both algorithmic and physical errors.
  arXiv  Detail & Related papers  (2020-01-16T18:33:24Z)

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.