Single-copy stabilizer testing

We consider the problem of testing whether an unknown \(n\)-qubit quantum state \(|\psi\rangle\) is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using \(O(n)\) copies, and conversely prove that \(\Omega(\sqrt{n})\) copies are required for any algorithm....

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2024-10
Main Authors: Hinsche, Marcel, Helsen, Jonas
Format: Article
Language:English
Subjects:
Algorithms
Lower bounds
Qubits (quantum computing)
Tensors
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the problem of testing whether an unknown \(n\)-qubit quantum state \(|\psi\rangle\) is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using \(O(n)\) copies, and conversely prove that \(\Omega(\sqrt{n})\) copies are required for any algorithm. The main observation behind our algorithm is that when repeatedly measuring in a randomly chosen stabilizer basis, stabilizer states are the most likely among the set of all pure states to exhibit linear dependencies in measurement outcomes. Our algorithm is designed to probe deviations from this extremal behavior. For the lower bound, we first reduce stabilizer testing to the task of distinguishing random stabilizer states from the maximally mixed state. We then argue that, without loss of generality, it is sufficient to consider measurement strategies that a) lie in the commutant of the tensor action of the Clifford group and b) satisfy a Positive Partial Transpose (PPT) condition. By leveraging these constraints, together with novel results on the partial transposes of the generators of the Clifford commutant, we derive the lower bound on the sample complexity.
ISSN:2331-8422