Caltech framework finds quantum speedups for everyday chemistry simulations

Started by BrayWyatt_WCW, Today at 05:45 AM

Previous topic - Next topic

0 Members and 1 Guest are viewing this topic.

Topic: Caltech framework finds quantum speedups for everyday chemistry simulations   Views(Read 13 times)
Active members in this topic:
BrayWyatt_WCW(1)

BrayWyatt_WCW

Jielun Chen and Garnet Kin-Lic Chan of Caltech have published a framework for finding quantum speedups in simulating correlated electrons, Quantum Zeitgeist reports. Most work on quantum chemistry looks for problems where classical methods break down. This paper takes a different approach. It targets calculations where cheap classical methods already work quite well, such as density functional theory and extensions of Hartree Fock

The method uses an excitation basis encoding, the quantum singular value transform and block encodings of the molecule's Hamiltonian. It assumes that correlations are local, so particle and hole pairs far apart matter little. The analysis is limited to at most three excitations. That assumption reflects how many real molecules behave

The reported speedup over classical sparse techniques scales up to the 18th power of the correlation length. Qubit requirements grow only modestly with system size. The authors suggest this could allow simulations of systems with thousands of atoms using moderate fault tolerant quantum resources. These are scaling results, not benchmarks on particular molecules

Garnet Chan is one of the most respected names in quantum chemistry, and he has often been sceptical of exaggerated quantum claims. That makes this paper worth taking seriously. It is a careful theoretical argument that quantum computers could help with everyday chemistry, not just exotic edge cases. That widens the potential market considerably

This fits nicely with our discussion about real world quantum advantage. If speedups exist for common calculations, not only the hardest ones, the first useful applications could come sooner. The catch is that it still needs fault tolerant machines. But it gives hardware builders a clearer target to aim for

Does it matter more to speed up common calculations or to solve problems classical computers cannot touch? And how much do you trust scaling arguments before hardware exists?