Parallelizing quantum circuits

@article{Broadbent2009ParallelizingQC,
  title={Parallelizing quantum circuits},
  author={Anne Broadbent and Elham Kashefi},
  journal={Theor. Comput. Sci.},
  year={2009},
  volume={410},
  pages={2489-2510}
}
We present a novel automated technique for parallelizing quantum circuits via forward and backward translation to measurement-based quantum computing patterns and analyze the trade o in terms of depth and space complexity. As a result we distinguish a class of polynomial depth circuits that can be parallelized to logarithmic depth while adding only polynomial many auxiliary qubits. In particular, we provide for the rst time a full characterization of patterns with ow of arbitrary depth, based… CONTINUE READING
Highly Cited
This paper has 58 citations. REVIEW CITATIONS
38 Citations
32 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 38 extracted citations

59 Citations

051015'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 59 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Generalized ow and determinism in measurement-based quantum computation

  • D. E. Browne, E. Kashe, M. Mhalla, S. Perdrix
  • Available as http://arxiv.org/abs/quant-ph…
  • 2007
2 Excerpts

E cient high- delity quantum computation using matter qubits and linear optics

  • S. D. Barrett, P. Kok
  • Physical Review A, 71:060310(R),
  • 2005
1 Excerpt

Graph Theory

  • R. Diestel
  • Springer-Verlag,
  • 2005
2 Excerpts

Parsimonious and robust realizations of unitary maps in the one-way model

  • V. Danos, E. Kashe, P. Panangaden
  • Physical Review A,
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…