REVIEW 2 cited by
Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
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
abstract
We present a quantum algorithm for simulating quantum chemistry with gate complexity $\tilde{O}(N^{1/3} \eta^{8/3})$ where $\eta$ is the number of electrons and $N$ is the number of plane wave orbitals. In comparison, the most efficient prior algorithms for simulating electronic structure using plane waves (which are at least as efficient as algorithms using any other basis) have complexity $\tilde{O}(N^{8/3} /\eta^{2/3})$. We achieve our scaling in first quantization by performing simulation in the rotating frame of the kinetic operator using interaction picture techniques. Our algorithm is far more efficient than all prior approaches when $N \gg \eta$, as is needed to suppress discretization error when representing molecules in the plane wave basis, or when simulating without the Born-Oppenheimer approximation.
Forward citations
Cited by 2 Pith papers
-
Discontinuous Galerkin discretization for quantum simulation of chemistry
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...
-
Engineering and harnessing long-range interactions for atomic quantum simulators
A review of experimental methods for engineering long-range interactions among atoms in optical lattices and their proposed applications to quantum simulation, without new results.
Discussion (0). Continue with ORCID to comment.