The Parameterized Complexity of Quantum Verification

02/16/2022
by   Srinivasan Arunachalam, et al.
0

We initiate the study of parameterized complexity of problems in terms of the number of non-Clifford gates in the problem description. We show that for the problem of parameterized quantum circuit satisfiability, there exists a classical algorithm solving the problem with a runtime scaling exponentially in the number of non-Clifford gates but only polynomially with the system size. This result follows from our main result, that for any Clifford + t T-gate quantum circuit satisfiability problem, the search space of optimal witnesses can be reduced to a stabilizer subspace isomorphic to at most t qubits (independent of the system size). Furthermore, we derive new lower bounds on the T-count of circuit satisfiability instances and the T-count of the W-state assuming the classical exponential time hypothesis (). Lastly, we explore the parameterized complexity of the quantum non-identity check problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2022

Quantum Parameterized Complexity

Parameterized complexity theory was developed in the 1990s to enrich the...
research
06/20/2019

Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits

Recently, Bravyi, Gosset, and König (Science, 2018) exhibited a search p...
research
02/13/2019

Explicit lower bounds on strong simulation of quantum circuits in terms of T-gate count

We investigate Clifford+T quantum circuits with a small number of T-gate...
research
12/14/2018

Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security

This article defines encrypted gate, which is denoted by EG[U]:|α〉→((a,b...
research
09/11/2019

Efficient template matching in quantum circuits

Given a large and a small quantum circuit, we are interested in finding ...
research
06/10/2022

Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement

Savitch's theorem states that NPSPACE computations can be simulated in P...
research
06/02/2023

Efficient Quantum State Synthesis with One Query

We present a polynomial-time quantum algorithm making a single query (in...

Please sign up or login with your details

Forgot password? Click here to reset