An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for quantum and classical interconnects.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2representative citing papers
citing papers explorer
-
Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers
An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for quantum and classical interconnects.
- A Deficiency-Based Approach for the Operational Interpretation of Quantum Resources with Applications