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}
}
  • Axel Dahlberg, Jonas Helsen, Stephanie Wehner
  • Published in ArXiv 2019
  • Physics, Mathematics, Computer Science
  • 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

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 31 REFERENCES

    The complexity of the vertexminor problem

    • A Dahlberg, J Helsen, S Wehner
    • 2019

    Foundations of quantum mechanics and their impact on contemporary society

    Transforming graph states using single-qubit operations

    • Axel Dahlberg, Stephanie Wehner
    • Physics, Computer Science, Mathematics, Medicine
    • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
    • 2018

    The computational complexity of linear optics