# Counting single-qubit Clifford equivalent graph states is #P-Complete

@article{Dahlberg2019CountingSC, title={Counting single-qubit Clifford equivalent graph states is #P-Complete}, author={Axel Dahlberg and Jonas Helsen and Stephanie Wehner}, journal={ArXiv}, year={2019}, volume={abs/1907.08024} }

Graph states, which include for example Bell states, GHZ states and cluster states, form a well-known class of quantum states with applications ranging from quantum networks to error-correction. Deciding whether two graph states are equivalent up to single-qubit Clifford operations is known to be decidable in polynomial time and have been studied both in the context of producing certain required states in a quantum network but also in relation to stabilizer codes. The reason for the latter this… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 31 REFERENCES