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.
Fullerene-encapsulated cyclic ozone for the next generation of nano-sized propellants via quantum computa- tion
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2roles
background 1polarities
support 1representative citing papers
A comprehensive review of scaling paths for superconducting quantum computers, with resource and sensitivity analyses for utility-scale applications under realistic error distributions.
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.
-
How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits
A comprehensive review of scaling paths for superconducting quantum computers, with resource and sensitivity analyses for utility-scale applications under realistic error distributions.