Papers
Topics
Authors
Recent
Search
2000 character limit reached

Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing

Published 18 Jan 2024 in quant-ph | (2401.10079v2)

Abstract: We show that universal parity quantum computing employing a recently introduced constant depth decoding procedure is equivalent to measurement-based quantum computation (MBQC) on a bipartite graph using only YZ-plane measurements. We further show that any unitary MBQC using only YZ-plane measurements must occur on a bipartite graph.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2, 79 (2018).
  2. W. Lechner, P. Hauke, and P. Zoller, A quantum annealing architecture with all-to-all connectivity from local interactions, Science advances 1, e1500838 (2015).
  3. D. Gottesman, Stabilizer codes and quantum error correction (California Institute of Technology, 1997).
  4. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010).
  5. M. Hein, J. Eisert, and H. J. Briegel, Multiparty entanglement in graph states, Phys. Rev. A 69, 062311 (2004).
  6. D. Schlingemann, Logical network implementation for cluster states and graph codes, arXiv preprint quant-ph/0202007  (2002).
  7. D. Schlingemann, Stabilizer codes can be realized as graph codes, arXiv preprint quant-ph/0111080  (2001).
  8. D. Schlingemann and R. F. Werner, Quantum error-correcting codes associated with graphs, Phys. Rev. A 65, 012308 (2001).
  9. R. Raussendorf and H. J. Briegel, A one-way quantum computer, Phys. Rev. Lett. 86, 5188 (2001a).
  10. R. Raussendorf and H. Briegel, Computational model underlying the one-way quantum computer, arXiv preprint quant-ph/0108067 https://doi.org/10.48550/arXiv.quant-ph/0108067 (2001b).
  11. R. Raussendorf, D. E. Browne, and H. J. Briegel, Measurement-based quantum computation on cluster states, Phys. Rev. A 68, 022312 (2003).
  12. H. Poulsen Nautrup and H. J. Briegel, Measurement-based quantum computation from clifford quantum cellular automata, arXiv preprint arXiv:2312.13185  (2023).
  13. A. Messinger, M. Fellner, and W. Lechner, Constant depth code deformations in the parity architecture, in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), Vol. 01 (2023) pp. 120–130.
  14. M. Van den Nest, J. Dehaene, and B. De Moor, Graphical description of the action of local clifford transformations on graph states, Phys. Rev. A 69, 022316 (2004).
  15. M. Zwerger, H. Briegel, and W. Dür, Hybrid architecture for encoded measurement-based quantum computation, Scientific reports 4, 5364 (2014).
  16. W. Dür, H. Aschauer, and H.-J. Briegel, Multiparticle entanglement purification for graph states, Phys. Rev. Lett. 91, 107903 (2003).
  17. H. Aschauer, W. Dür, and H.-J. Briegel, Multiparticle entanglement purification for two-colorable graph states, Phys. Rev. A 71, 012319 (2005).
  18. M. Zwerger, H. J. Briegel, and W. Dür, Universal and optimal error thresholds for measurement-based entanglement purification, Phys. Rev. Lett. 110, 260503 (2013).
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.