Pith. sign in

REVIEW 2 cited by

Low rank representations for quantum simulation of electronic structure

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1808.02625 v2 pith:7EWPDAZK submitted 2018-08-08 physics.comp-ph quant-ph

classification physics.comp-phquant-ph
keywords mathcalcomplexitygatehamiltoniantrotterquantumsimulationbasis
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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 and unitary Coupled Cluster Trotter steps makes simulation based on such primitives challenging. We substantially reduce the gate complexity of such primitives through a two-step low-rank factorization of the Hamiltonian and cluster operator, accompanied by truncation of small terms. Using truncations that incur errors below chemical accuracy, we are able to perform Trotter steps of the arbitrary basis electronic structure Hamiltonian with $\mathcal{O}(N^3)$ gate complexity in small simulations, which reduces to $\mathcal{O}(N^2 \log N)$ gate complexity in the asymptotic regime, while our unitary Coupled Cluster Trotter step has $\mathcal{O}(N^3)$ gate complexity as a function of increasing basis size for a given molecule. In the case of the Hamiltonian Trotter step, these circuits have $\mathcal{O}(N^2)$ depth on a linearly connected array, an improvement over the $\mathcal{O}(N^3)$ scaling assuming no truncation. As a practical example, we show that a chemically accurate Hamiltonian Trotter step for a 50 qubit molecular simulation can be carried out in the molecular orbital basis with as few as 4,000 layers of parallel nearest-neighbor two-qubit gates, consisting of fewer than 100,000 non-Clifford rotations. We also apply our algorithm to iron-sulfur clusters relevant for elucidating the mode of action of metalloenzymes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimal Lower Bounds for Hamiltonian Simulation

    quant-ph 2026-07 conditional novelty 7.0 of 10

    There exist simple weighted-local Hamiltonians for which quantum simulation requires Ω(min over K of (Kt + t²λ_K²/ε)) gates — exactly matching the composite qDRIFT algorithm's cost.

  2. Discontinuous Galerkin discretization for quantum simulation of chemistry

    quant-ph 2019-08 conditional novelty 7.0 of 10

    A discontinuous Galerkin basis built by blockwise SVD compression of primitive diagonal bases yields block-diagonal two-electron integrals and a predicted quantum-simulation cost crossover at 15 to 20 atoms for hydrog...

Pith tools