Optical generation of matter qubit graph states

Abstract

We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple 3-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph state edges even as qubits elsewhere are measured, in a `just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus.

10 pages in 2 column format, includes 4 figures. Problems with figures resolved

References in corpus (28)

• Measurement-based quantum computation with cluster states
• The Quantum Jump Approach to Dissipative Dynamics in Quantum Optics
• Experimental One-Way Quantum Computing
• Multi-party entanglement in graph states
• Resource-efficient linear optical quantum computation
• Efficient high-fidelity quantum computation using matter qubits and linear optics
• Optical quantum computation using cluster states
• Creation of entangled states of distant atoms by interference
• Proposal for teleportation of an atomic state via cavity decay
• Optimal local implementation of non-local quantum gates
• Quantum error-correcting codes associated with graphs
• Efficient engineering of multi-atom entanglement through single-photon detections
• Robust long-distance entanglement and a loophole-free Bell test with ions and photons
• Quantum Beat of Two Single Photons
• Repeat-Until-Success Quantum Computing
• Entangling operations and their implementation using a small amount of entanglement
• Robust creation of entanglement between ions in spatially separate cavities
• The non-local content of quantum operations
• Deterministic linear optics quantum computation utilizing linked photon circuits
• An entangled two photon source using biexciton emission of an asymmetric quantum dot in a cavity
• Anticrossings in Foerster Coupled Quantum Dots
• Efficient generation of graph states for quantum computation
• An efficient algorithm to recognize local Clifford equivalence of graph states
• Local unitary versus local Clifford equivalence of stabilizer states
• Bounds on the Probability of Success of Postselected Non-linear Sign Shifts Implemented with Linear Optics
• Optimizing linear optics quantum gates
• Conditional quantum logic using two atomic qubits
• Upper bounds on success probabilities in linear optics

Cited by in corpus (30)

• Optical Quantum Computing
• Fault tolerant quantum computation with very high threshold for loss errors
• Determinism in the one-way model
• Repeat-Until-Success quantum computing using stationary and flying qubits
• Brokered Graph State Quantum Computing
• Prospects for measurement-based quantum computing with solid state spins
• Fusing multiple W states simultaneously with a Fredkin gate
• Fundamentals of universality in one-way quantum computation
• Measurement based entanglement under conditions of extreme photon loss
• The efficiencies of generating cluster states with weak non-linearities
• The Photonic Module: an on-demand resource for photonic entanglement
• Potential and limits to cluster state quantum computing using probabilistic gates
• Fully fault tolerant quantum computation with non-deterministic gates
• Quantum gate for Q switching in monolithic photonic bandgap cavities containing two-level atoms
• Recursive quantum repeater networks
• Entangling spins by measuring charge: a parity-gate toolbox
• High threshold distributed quantum computing with three-qubit nodes
• Efficient construction of 2-D cluster states with probabilistic quantum gates
• Natural three-qubit interactions in one-way quantum computing
• Probabilistic growth of large entangled states with low error accumulation
• Adaptive strategies for graph state growth in the presence of monitored errors
• Robust and Scalable Scheme to Generate Large-Scale Entanglement Webs
• An introduction to one-way quantum computing in distributed architectures
• Efficient growth of complex graph states via imperfect path erasure
• Decoding Schemes for Foliated Sparse Quantum Error Correcting Codes
• Generation of 3-Dimensional graph state with Josephson charge qubits
• Distributed quantum computation with arbitrarily poor photon detection
• How to exploit local information when distilling entanglement
• Entangling unstable optically active matter qubits
• Perfect Cluster States from Imperfect Global Entanglement