Efficient growth of complex graph states via imperfect path erasure

@article{Campbell2007EfficientGO,
  title={Efficient growth of complex graph states via imperfect path erasure},
  author={Earl T. Campbell and Joseph Fitzsimons and Simon C. Benjamin and Pieter Kok},
  journal={New Journal of Physics},
  year={2007},
  volume={9},
  pages={196-196}
}
  • Earl T. Campbell, Joseph Fitzsimons, +1 author Pieter Kok
  • Published 2007
  • Physics
  • New Journal of Physics
  • Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: path erasure techniques allow one to entangle multiple qubits by determining only global properties of the qubits. Here, this powerful approach is extended by demonstrating that even imperfect path erasure can produce the required graph states with high efficiency. By… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-3 OF 3 REFERENCES

    Preprint quant-ph/0609149

    • D Gross, J Eisert
    • New Journal of Physics
    • 2006
    VIEW 1 EXCERPT

    Quantum Computation and Quantum Information (Cambridge

    • M ANielsen, I LChuang
    • 2000
    VIEW 2 EXCERPTS