Unitary Subgroup Testing

04/08/2021
βˆ™
by   Zvika Brakerski, et al.
βˆ™
0
βˆ™

We consider the problem of subgroup testing for a quantum circuit C: given access to C, determine whether it implements a unitary from a subgroup 𝒒 of the unitary group. In particular, the group 𝒒 can be the trivial subgroup (i.e., identity testing) or groups such as the Pauli or Clifford groups, or even their q-ary extensions. We also consider a promise version of the problem where C is promised to be in some subgroup of the unitaries that contains 𝒒 (e.g., identity testing for Clifford circuits). We present a novel structural property of Clifford unitaries. Namely, that their (normalized) trace is bounded by 1/√(2) in absolute value, regardless of the dimension. We show a similar property for the q-ary Cliffords. This allows us to analyze a very simple single-query identity test under the Clifford promise and show that it has (at least) constant soundness. The same test has perfect soundness under the Pauli promise. We use the test to show that identity/Pauli/Clifford testing (without promise) are all computationally equivalent, thus establishing computational hardness for Pauli and Clifford testing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 05/17/2018

A Note on Polynomial Identity Testing for Depth-3 Circuits

Let C be a depth-3 arithmetic circuit of size at most s, computing a pol...
research
βˆ™ 05/05/2021

Identity testing under label mismatch

Testing whether the observed data conforms to a purported model (probabi...
research
βˆ™ 05/21/2020

Algebraic Hardness versus Randomness in Low Characteristic

We show that lower bounds for explicit constant-variate polynomials over...
research
βˆ™ 08/09/2023

Space-bounded quantum state testing via space-efficient quantum singular value transformation

Driven by exploring the power of quantum computation with a limited numb...
research
βˆ™ 02/16/2022

Identity Testing for Radical Expressions

We study the Radical Identity Testing problem (RIT): Given an algebraic ...
research
βˆ™ 11/05/2019

Discrete logarithm and Diffie-Hellman problems in identity black-box groups

We investigate the computational complexity of the discrete logarithm, t...
research
βˆ™ 07/19/2021

Test-optional Policies: Overcoming Strategic Behavior and Informational Gaps

Due to the Covid-19 pandemic, more than 500 US-based colleges and univer...

Please sign up or login with your details

Forgot password? Click here to reset