
Coherent parallelization of universal classical computation
Author(s) -
Carlos A. Pérez-Delgado,
Sai Vinjanampathy
Publication year - 2021
Publication title -
new journal of physics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.584
H-Index - 190
ISSN - 1367-2630
DOI - 10.1088/1367-2630/ac3a17
Subject(s) - computation , axiom , quantum computer , physics , quadratic equation , axiomatic system , quantum , theoretical computer science , algorithm , computational science , theoretical physics , computer science , quantum mechanics , mathematics , geometry
Previously, higher-order Hamiltonians (HoH) had been shown to offer an advantage in both metrology and quantum energy storage. Here, we axiomatize a model of computation that allows us to consider such Hamiltonians for the purposes of computation. From this axiomatic model, we formally prove that an HoH-based algorithm can gain up to a quadratic speed-up over classical sequential algorithms—for any possible classical computation. We show how our axiomatic model is grounded in the same physics as that used in HoH-based quantum advantage for metrology and battery charging. Thus we argue that any advance in implementing HoH-based quantum advantage in those scenarios can be co-opted for the purpose of speeding up computation.