Abstract: Parallel tensor network contraction algorithms have emerged as the pivotal benchmarks for assessing the classical limits of computation, exemplified by Google's demonstration of quantum ...
Abstract: We propose an efficient quantum subroutine for matrix multiplication that computes a state vector encoding the entries of the product of two matrices in superposition. The subroutine ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback