Corpus ID: 237572239

Low-rank decomposition for quantum simulations with complex basis functions

  title={Low-rank decomposition for quantum simulations with complex basis functions},
  author={Michael P. Kaicher},
  • M. Kaicher
  • Published 20 September 2021
  • Physics, Mathematics
Low-rank decompositions to reduce the Coulomb operator to a pairwise form suitable for its quantum simulation are well-known in quantum chemistry, where the underlying basis functions are real-valued. We generalize the result of Ref. 1 to complex basis functions ψp(r) ∈ C by means of the Schur decomposition and decomposing matrices into their symmetric and anti-symmetric components. This allows the application of low-rank decomposition strategies to general basis sets. 


Low rank representations for quantum simulation of electronic structure
The quantum simulation of quantum chemistry is a promising application of quantum computers. However, for N molecular orbitals, the $\mathcal{O}(N^4)$ gate complexity of performing Hamiltonian andExpand
Compressing Many-Body Fermion Operators Under Unitary Constraints
The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequencesExpand
Analytic Coulomb matrix elements in the lowest Landau level in disk geometry
Using Darling’s theorem on products of generalized hypergeometric series, an analytic expression is obtained for the Coulomb matrix elements in the lowest Landau level in the representation ofExpand
Highly Efficient and Scalable Compound Decomposition of Two-Electron Integral Tensor and Its Application in Coupled Cluster Calculations.
This work develops a decomposition strategy to approximately represent the two-electron integral tensor in terms of low-rank vectors and can significantly reduce the storage requirement of the atomic orbital (AO) two-Electron integral Tensor with moderate decomposition thresholds. Expand
Matrix product operators, matrix product states, and ab initio density matrix renormalization group algorithms.
This work describes how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation, and discusses two improvements of the abinitio D MRG sweep algorithm motivated by matrix product operators language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. Expand
Configuration-interaction calculations on the fractional quantum Hall effect.
With the use of Haldane's spherical model, the fractional quantum Hall effect is studied by means of large-scale configuration-interaction calculations and a wave function originally proposed by Halperin for the disk geometry is tested on the sphere. Expand
Solving strongly correlated electron models on a quantum computer
Researchers propose a step-by-step quantum recipe to find the ground state of models of strongly interacting electrons.
Universal Quantum Simulators
  • S. Lloyd
  • Computer Science, Medicine
  • Science
  • 1996
Feynman's 1982 conjecture, that quantum computers can be programmed to simulate any local quantum system, is shown to be correct.
Coulombic potential energy integrals and approximations
Theorems are derived which establish a method of approximating two‐particle Coulombic potential energy integrals, [φa(1) r12−1 |φb(2)], in terms of approximate charge densities φa′ and φb′. RigorousExpand
Diamagnetismus der Metalle
ZusammenfassungEs wird gezeigt, daß schon freie Elektronen in der Quantentheorie, außer dem Spin-Paramagnetismus, einen von den Bahnen herrührenden, von Null verschiedenen Diamagnetismus haben,Expand