Strategies for the preparation of large cluster states using non-deterministic gates

Abstract

The cluster state model for quantum computation has paved the way for schemes that allow scalable quantum computing, even when using non-deterministic quantum gates. Here the initial step is to prepare a large entangled state using non-deterministic gates. A key question in this context is the relative efficiencies of different `strategies', i.e. in what order should the non-deterministic gates be applied, in order to maximize the size of the resulting cluster states? In this paper we consider this issue in the context of `large' cluster states. Specifically, we assume an unlimited resource of qubits and ask what the steady state rate at which `large' clusters are prepared from this resource is, given an entangling gate with particular characteristics. We measure this rate in terms of the number of entangling gate operations that are applied. Our approach works for a variety of different entangling gate types, with arbitrary failure probability. Our results indicate that strategies whereby one preferentially bonds together identical qubits are considerably more efficient than those in which one does not. Additionally, compared to earlier analytic results, our numerical study offers substantially improved resource scaling.

9 pages, 7 figures

References in corpus (13)

• Measurement-based quantum computation with cluster states
• Resource-efficient linear optical quantum computation
• Efficient high-fidelity quantum computation using matter qubits and linear optics
• Optical quantum computation using cluster states
• Cluster-state quantum computation
• Efficient quantum computation with probabilistic quantum gates
• Loss Tolerant Optical Qubits
• Repeat-Until-Success quantum computing using stationary and flying qubits
• Deterministic linear optics quantum computation utilizing linked photon circuits
• Potential and limits to cluster state quantum computing using probabilistic gates
• Efficient Graph State Construction Under the Barrett and Kok Scheme
• Cluster state preparation using gates operating at arbitrary success probabilities
• Efficient growth of complex graph states via imperfect path erasure

Cited by in corpus (10)

• Fully fault tolerant quantum computation with non-deterministic gates
• A simple scheme for universal linear optics quantum computing with constant experimental complexity using fiber-loops
• Growth of graph states in quantum networks
• Efficient recycling strategies for preparing large Fock states from single-photon sources --- Applications to quantum metrology
• Effect of frequency mismatched photons in quantum information processing
• Probabilistic growth of large entangled states with low error accumulation
• Strong entanglement causes low gate fidelity in inaccurate one-way quantum computation
• Cluster state preparation using gates operating at arbitrary success probabilities
• Distributed quantum computation with arbitrarily poor photon detection
• Fusing Imperfect Photonic Cluster States