Abstract

We address the question of how many maximally entangled photon pairs are needed to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily probabilistic with known optimal success probability, this question amounts to finding the optimal strategy for building up cluster states, from the perspective of classical control. We develop a notion of classical strategies and present rigorous statements on the ultimate maximal and minimal uses of resources of the globally optimal strategy. We find that this strategy—being also the most robust with respect to decoherence—gives rise to an advantage of already more than an order of magnitude in the number of maximally entangled pairs when building chains with an expected length of $L=40$, compared with other legitimate strategies. For two-dimensional cluster states, we present a first scheme achieving the optimal quadratic asymptotic scaling. This analysis shows that the choice of appropriate classical control leads to a significant reduction in resource consumption.

© 2007 Optical Society of America

Arbitrary atomic cluster state concentration for one-way quantum computation

Lan Zhou, Yu-Bo Sheng, and Xing-Fu Wang
J. Opt. Soc. Am. B 31(3) 503-511 (2014)

Photonic entanglement as a resource in quantum computation and quantum communication

Robert Prevedel, Markus Aspelmeyer, Caslav Brukner, Anton Zeilinger, and Thomas D. Jennewein
J. Opt. Soc. Am. B 24(2) 241-248 (2007)

Cluster-state quantum computing in optical fibers

Yasaman Soudagar, Félix Bussières, Guido Berlín, Suzanne Lacroix, José M. Fernandez, and Nicolas Godbout
J. Opt. Soc. Am. B 24(2) 226-230 (2007)

Quantum networking with photons and trapped atoms (Invited)

D. L. Moehring, M. J. Madsen, K. C. Younge, R. N. Kohn, Jr., P. Maunz, L.-M. Duan, C. Monroe, and B. B. Blinov
J. Opt. Soc. Am. B 24(2) 300-315 (2007)

Examples of Gaussian cluster computation

Peter van Loock
J. Opt. Soc. Am. B 24(2) 340-346 (2007)