360搜索

bound for f i nding Pauli f l ow. We also introduce a f i rst lower bound for the Paulif l ow-f i nding problem, by linking it to the matrix invertibility and multiplication problems over F 2 .1 IntroductionQuantum computing of f ers not only computational capabilities that go beyond those of classical com-puters, it also gives rise to entirely non-classical mode...

内容提示:GALIC: Hybrid Multi-Qubitwise Pauli Grouping forQuantum Computing MeasurementMatthew X. Burns 12 , Chenxu Liu 1 , Samuel Stein 1 , Bo Peng 1 ,Karol Kowalski 1 , and Ang Li 11Physical and Computational Sciences, Pacif i c Northwest National Laboratory,Richland, WA, 99354, USA2Department of Electrical and Computer Engin...