Quick search Find article
Quick search
Find article
Deutsche Physikalische Gessellschaft IOP Institute of Physics

Efficient growth of complex graph states via imperfect path erasure

Focus on Measurement-Based Quantum Information Processing

Earl T Campbell1, Joseph Fitzsimons, Simon C Benjamin and Pieter Kok

Show affiliations


Part of Focus on Measurement-Based Quantum Information Processing

Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: path erasure techniques allow one to entangle multiple qubits by determining only global properties of the qubits. Here, this powerful approach is extended by demonstrating that even imperfect path erasure can produce the required graph states with high efficiency. By characterizing the degree of error in each path erasure attempt, one can subsume the resulting imperfect entanglement into an extended graph state formalism. The subsequent growth of the improper graph state can be guided, through a series of strategic decisions, in such a way as to bound the growth of the error and eventually yield a high-fidelity graph state. As an implementation of these techniques, we develop an analytic model for atom (or atom-like) qubits in mismatched cavities, under the double-heralding entanglement procedure of Barrett and Kok (2005 Phys. Rev. A 71 060310). Compared to straightforward post-selection techniques our protocol offers a dramatic improvement in growing complex high-fidelity graph states.


PACS

03.67.Lx Quantum computation architectures and implementations

02.10.Ox Combinatorics; graph theory

03.67.Pp Quantum error correction and other methods for protection against decoherence

03.65.Ta Foundations of quantum mechanics; measurement theory

03.67.Mn Entanglement measures, witnesses, and other characterizations

03.65.Ud Entanglement and quantum nonlocality (e.g. EPR paradox, Bell's inequalities, GHZ states, etc.)

Subjects

Mathematical physics

Computational physics

Quantum information and quantum mechanics

Dates

Issue 6 (June 2007)

Received 6 February 2007

Published 29 June 2007



View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.