Quantum Information

A Criterion for Post-Selected Quantum AdvantageConfirmed

by Matthew Fox (University of Colorado Boulder)

America/Toronto
PI/4-405 - Bob Room (Perimeter Institute for Theoretical Physics)

PI/4-405 - Bob Room

Perimeter Institute for Theoretical Physics

60
Description

Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak multiplicative sense. Our criterion exploits the fact that subgroups of SL(2; C) are essentially either discrete or dense in SL(2; C). Using our criterion, we give a new proof that both instantaneous quantum polynomial (IQP) circuits and conjugated Clifford circuits (CCCs) afford a quantum advantage. We also prove that both commuting CCCs and CCCs over various fragments of the Clifford group afford a quantum advantage, which settles two questions of Bouland, Fitzsimons, and Koh. Our results imply that circuits made of just U \otimes U-conjugated CZ gates afford a quantum advantage for almost all single-qubit unitaries U.

Organised by

Beni Yoshida