Minimal resources for linear optical one-way computing

Abstract

We address the question of how many maximally entangled photon pairs are needed in order 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 use 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 to 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 very significant reduction in resource consumption.

5 pages, 2 figures, title changed, presentation improved, bounds improved, minor errors corrected, references updated

References in corpus (8)

• 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
• Noise thresholds for optical cluster-state quantum computation
• Potential and limits to cluster state quantum computing using probabilistic gates
• Efficient Construction of Photonic Quantum Computational Clusters
• Efficient construction of 2-D cluster states with probabilistic quantum gates

Cited by in corpus (15)

• Measurement-based quantum computation beyond the one-way model
• Percolation, renormalization, and quantum computing with non-deterministic gates
• Fusing multiple W states simultaneously with a Fredkin gate
• The efficiencies of generating cluster states with weak non-linearities
• Entangling spins by measuring charge: a parity-gate toolbox
• One-way quantum computation with four-dimensional photonic qudits
• Cluster state preparation using gates operating at arbitrary success probabilities
• Graph-theoretical optimization of fusion-based graph state generation
• Percolation in quantum computation and communication
• Constructing 2D and 3D cluster states with photonic modules
• The Influence of Experimental Imperfections on Photonic GHZ State Generation
• Strategies for measurement-based quantum computation with cluster states transformed by stochastic local operations and classical communication
• Fusing Imperfect Photonic Cluster States
• Alternate Scheme for Optical Cluster-State Generation without Number-Resolving Photon Detectors
• Many body effects and cluster state quantum computation in strongly interacting systems of photons