Abstract
Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However by viewing their EO as a graph fusion event, one perceives that each successful event introduces an ideal redundant graph edge, which growth strategies should exploit. For example, if each EO succeeds with probability p=0.4 then a highly connected graph can be formed with an overhead of only about ten EO attempts per graph edge. The BK scheme then becomes competitive with the more elaborate entanglement procedures designed to permit p to approach unity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
