In a neutrino-gas model, the many-body Hamiltonian yields different evolution timescales and asymptotics than the quantum kinetic approach with collisions, while quantum resources for the full case sit at the low end for HEP problems and mid-to-high for quantum chemistry.
Selinger, Quantum Information and Computation15, 159 (2015), arXiv:1212.6253 [quant-ph]
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
We give an efficient randomized algorithm for approximating an arbitrary element of $SU(2)$ by a product of Clifford+$T$ operators, up to any given error threshold $\epsilon>0$. Under a mild hypothesis on the distribution of primes, the algorithm's expected runtime is polynomial in $\log(1/\epsilon)$. If the operator to be approximated is a $z$-rotation, the resulting gate sequence has $T$-count $K+4\log_2(1/\epsilon)$, where $K$ is approximately equal to $10$. We also prove a worst-case lower bound of $K+4\log_2(1/\epsilon)$, where $K=-9$, so that our algorithm is within an additive constant of optimal for certain $z$-rotations. For an arbitrary member of $SU(2)$, we achieve approximations with $T$-count $K+12\log_2(1/\epsilon)$. By contrast, the Solovay-Kitaev algorithm achieves $T$-count $O(\log^c(1/\epsilon))$, where $c$ is approximately $3.97$.