Many quantum algorithms can be represented in a form of a classical circuit positioned between quantum Fourier transformations. Motivated by the search for new quantum algorithms, we turn to circuits where the latter transformation is replaced by the $textsf{SU}(2)$ quantum Schur Transform -- a global transformation which maps the computational basis to a basis defined by angular momenta. We show that the output distributions of these circuits can be approximately classically sampled in polynomial time if they are sufficiently close to being sparse, thus isolating a regime in which these Quantum $textsf{SU}(2)$ Schur Circuits could lead to algorithms with exponential computational advantage. Our work is primarily motivated by a conjecture that underpinned the hardness of Permutational Quantum Computing, a restricted quantum computational model that has the above circuit structure in one of its computationally interesting regimes. The conjecture stated that approximating transition amplitudes of Permutational Quantum Computing model to inverse polynomial precision on a classical computer is computationally hard. We disprove the extended version of this conjecture -- even in the case when the hardness of approximation originated from a difficulty of finding the large elements in the output probability distributions. Finally, we present some evidence that output of the above Permutational Quantum Computing circuits could be efficiently approximately sampled from on a classical computer.
تحميل البحث