Potential and limits to cluster state quantum computing using probabilistic gates

Abstract

We establish bounds to the necessary resource consumption when building up cluster states for one-way computing using probabilistic gates. Emphasis is put on state preparation with linear optical gates, as the probabilistic character is unavoidable here. We identify rigorous general bounds to the necessary consumption of initially available maximally entangled pairs when building up one-dimensional cluster states with individually acting linear optical quantum gates, entangled pairs and vacuum modes. As the known linear optics gates have a limited maximum success probability, as we show, this amounts to finding the optimal classical strategy of fusing pieces of linear cluster states. A formal notion of classical configurations and strategies is introduced for probabilistic non-faulty gates. We study the asymptotic performance of strategies that can be simply described, and prove ultimate bounds to the performance of the globally optimal strategy. The arguments employ methods of random walks and convex optimization. This optimal strategy is also the one that requires the shortest storage time, and necessitates the fewest invocations of probabilistic gates. For two-dimensional cluster states, we find, for any elementary success probability, an essentially deterministic preparation of a cluster state with quadratic, hence optimal, asymptotic scaling in the use of entangled pairs. We also identify a percolation effect in state preparation, in that from a threshold probability on, almost all preparations will be either successful or fail. We outline the implications on linear optical architectures and fault-tolerant computations.

18 pages, 10 figures, replaced with published version

References in corpus (6)

• Multi-party entanglement in graph states
• Resource-efficient linear optical quantum computation
• Experimental Analysis of a 4-Qubit Cluster State
• Robust creation of entanglement between ions in spatially separate cavities
• Simple proof of fault tolerance in the graph-state model
• Efficient construction of 2-D cluster states with probabilistic quantum gates

Cited by in corpus (17)

• Novel schemes for measurement-based quantum computation
• Measurement-based quantum computation beyond the one-way model
• Percolation, renormalization, and quantum computing with non-deterministic gates
• Prospects for measurement-based quantum computing with solid state spins
• Fundamentals of universality in one-way quantum computation
• The efficiencies of generating cluster states with weak non-linearities
• Weak non-linearities and cluster states
• Experimental Demonstration of Decoherence-Free One-Way Information Transfer
• Parameters of Pseudo-Random Quantum Circuits
• Adaptive strategies for graph state growth in the presence of monitored errors
• Compact Toffoli gate using weighted graph states
• Cluster state preparation using gates operating at arbitrary success probabilities
• Strategies for the preparation of large cluster states using non-deterministic gates
• Multipartite purification protocols: upper and optimal bounds
• Atomic cluster state build up with macroscopic heralding
• Percolation in quantum computation and communication
• Alternate Scheme for Optical Cluster-State Generation without Number-Resolving Photon Detectors