Cluster state preparation using gates operating at arbitrary success probabilities

Abstract

Several physical architectures allow for measurement-based quantum computing using sequential preparation of cluster states by means of probabilistic quantum gates. In such an approach, the order in which partial resources are combined to form the final cluster state turns out to be crucially important. We determine the influence of this classical decision process on the expected size of the final cluster. Extending earlier work, we consider different quantum gates operating at various probabilites of success. For finite resources, we employ a computer algebra system to obtain the provably optimal classical control strategy and derive symbolic results for the expected final size of the cluster. We identify two regimes: When the success probability of the elementary gates is high, the influence of the classical control strategy is found to be negligible. In that case, other figures of merit become more relevant. In contrast, for small probabilities of success, the choice of an appropriate strategy is crucial.

7 pages, 9 figures, contribution to special issue of New J. Phys. on "Measurement-Based Quantum Information Processing". Replaced with published version

References in corpus (23)

• Experimental One-Way Quantum Computing
• Multi-party entanglement in graph states
• Resource-efficient linear optical quantum computation
• Entanglement of atoms via cold controlled collisions
• Controlled Collisions for Multiparticle Entanglement of Optically Trapped Atoms
• Creation of entangled states of distant atoms by interference
• Probabilistic Quantum Logic Operations Using Polarizing Beam Splitters
• Efficient engineering of multi-atom entanglement through single-photon detections
• Linear Optical CNOT Gate in the Coincidence Basis
• Graphical description of the action of local Clifford transformations on graph states
• Robust creation of entanglement between ions in spatially separate cavities
• Loss tolerance in one-way quantum computation via counterfactual error correction
• Quantum phase gate for photonic qubits using only beam splitters and post-selection
• Efficient quantum computation with probabilistic quantum gates
• Repeat-Until-Success quantum computing using stationary and flying qubits
• Noise thresholds for optical quantum computers
• Potential and limits to cluster state quantum computing using probabilistic gates
• Optimizing linear optics quantum gates
• Upper bounds on success probabilities in linear optics
• Efficient Construction of Photonic Quantum Computational Clusters
• Efficient construction of 2-D cluster states with probabilistic quantum gates
• Minimal resources for linear optical one-way computing
• Strategies for the preparation of large cluster states using non-deterministic gates

Cited by in corpus (15)

• Measurement-based quantum computation
• Enhancing the W State Quantum Network Fusion Process with A Single Fredkin Gate
• Fusing multiple W states simultaneously with a Fredkin gate
• Efficient quantum circuits for one-way quantum computing
• Growth of graph states in quantum networks
• High-efficiency cluster-state generation with atomic ensembles via the dipole-blockade mechanism
• Cluster state generation with atomic ensembles via the dipole blockade mechanism
• Strong entanglement causes low gate fidelity in inaccurate one-way quantum computation
• Strategies for the preparation of large cluster states using non-deterministic gates
• Layer by layer generation of cluster states
• Integration of highly probabilistic sources into optical quantum architectures: perpetual quantum computation
• Percolation in quantum computation and communication
• Fusing Imperfect Photonic Cluster States
• Strategies for measurement-based quantum computation with cluster states transformed by stochastic local operations and classical communication
• Quantum Information Processing with Continuous Variables and Atomic Ensembles