7 problems
Low et al.'s conjecture. The optimal query complexity for block encoding should scale as
Working conjecture. There exists a basis or representation of in which the preprocessing steps required by —basis construction and s…
Conjecture on decorated-mixture-index sampling. In future work, sampling of the decorated mixture index will be useful in parallelized algorithms which themselves might provide cru…
Consider quantum-chemistry Hamiltonians containing Coulomb potentials, and input states for which the Trotter error exhibits slower-than-standard scaling. Generic Coulomb-scaling c…
Optimal recursive relation conjecture. There is no -copy recursive formula.
Universality conjecture. Given the simplicity of the Ising system, this scaling behavior may be a universal feature of quantum advantage in the simulation of extended physical syst…
Consider simulation of a sparse Hamiltonian using splitting formulae, with spectral norm and evolution time . Higher-order splitting formulae reduce the compl…