Freely scalable quantum technologies using cells of 5-to-50 qubits with very lossy and noisy photonic links

Physical Review X

Volumn 4, Issue 4, 2014, Pages

  Nickerson, Naomi H ^a   Fitzsimons, Joseph F ^b,c   Benjamin, Simon C ^d  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b SINGAPORE UNIVERSITY OF TECHNOLOGY AND DESIGN   (Singapore)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^d UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Quantum physics

Indexed keywords

CELLS; CLOCKS; CYTOLOGY; QUANTUM COMPUTERS; QUANTUM OPTICS;

COMPUTER CLOCKS; ENTANGLEMENT PURIFICATION; LARGE-SCALE COMPUTING; NITROGEN-VACANCY CENTER; QUANTUM COMPUTING; QUANTUM PHYSICS; QUANTUM TECHNOLOGIES; SUPERCONDUCTING QUBITS;

QUANTUM ENTANGLEMENT;

EID: 84921452625     PISSN: None     EISSN: 21603308     Source Type: Journal    
DOI: 10.1103/PhysRevX.4.041041     Document Type: Article

References (36)

1. T. P. Harty, D. T. C. Allcock, C. J. Ballance, L. Guidoni, H. A. Janacek, N. M. Linke, D. N. Stacey, and D. M. Lucas, High-Fidelity Preparation, Gates, Memory, and Readout of a Trapped-Ion Quantum Bit, Phys. Rev. Lett. 113, 220501 (2014).
2. C. J. Ballance, T. P. Harty, N.M. Linke, and D. M. Lucas, High-Fidelity Two-Qubit Quantum Logic Gates Using Trapped Calcium-43 Ions, arXiv:1406.5473.
3. R. Barends et al., Logic Gates at the Surface Code Threshold: Superconducting Qubits Poised for Fault-Tolerant Quantum Computing, arXiv:1402.4848.
4. F. Dolde, V. Bergholm, Y. Wang, I. Jakobi, B. Naydenov, S. Pezzagna, J. Meijer, F. Jelezko, P. Neumann, T. Schulte- Herbrüggen, J. Biamonte, and J. Wrachtrup, High-Fidelity Spin Entanglement Using Optimal Control, Nat. Commun. 5, 3371 (2014).
5. T. H. Taminiau, J. Cramer, T. van der Sar, V. V. Dobrovitski, and R. Hanson, Universal Control and Error Correction in Multi-Qubit Spin Registers in Diamond, Nat. Nanotechnol. 9, 171 (2014).
6. C. Monroe, R. Raussendorf, A. Ruthven, K. R. Brown, P. Maunz, L.-M. Duan, and J. Kim, Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects, Phys. Rev. A 89, 022317 (2014).
7. D. Hucul, I. V. Inlek, G. Vittorini, C. Crocker, S. Debnath, S. M. Clark, and C. l. Monroe, Modular Entanglement of Atomic Qubits Using Both Photons and Phonons, arXiv:1403.3696.
8. L. DiCarlo, J. M. Chow, J. M. Gambetta, L. S. Bishop, B. R. Johnson, D. I. Schuster, J. Majer, A. Blais, L. Frunzio, S. M. Girvin, and R. J. Schoelkopf, Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor, Nature (London) 460, 240 (2009).
9. N. Roch, M. E. Schwartz, F. Motzoi, C. Macklin, R. Vijay, A.W. Eddins, A. N. Korotkov, K. B. Whaley, M. Sarovar, and I. Siddiqi, Observation of Measurement-Induced Entanglement and Quantum Trajectories of Remote Superconducting Qubits, Phys. Rev. Lett. 112, 170501 (2014).
10. H. Bernien, B. Hensen, W. Pfaff, G. Koolstra, M. S. Blok, L. Robledo, T. H. Taminiau, M. Markham, D. J. Twitchen, L. Childress, and R. Hanson, Heralded Entanglement between Solid-State Qubits Separated by 3 Meters, Nature (London) 497, 86 (2013).
11. W. Pfaff et al., Unconditional Quantum Teleportation between Distant Solid-State Quantum Bits, Science 345, 532 (2014).
12. D. Yang, A Simple Proof of Monogamy of Entanglement, Phys. Lett. A 360, 249 (2006).
13. W. Dür and H.-J. Briegel, Entanglement Purification for Quantum Computation, Phys. Rev. Lett. 90, 067901 (2003).
14. E. T. Campbell, Distributed Quantum-Information Processing with Minimal Local Resources, Phys. Rev. A 76, 040302 (2007).
15. K. Fujii and K. Yamamoto, Entanglement Purification with Double Selection, Phys. Rev. A 80, 042308 (2009).
16. K. Fujii, T. Yamamoto, M. Koashi, and N. Imoto, A Distributed Architecture for Scalable Quantum Computation with Realistically Noisy Devices, arXiv:1202.6588v1.
17. M. Zwerger, H. J. Briegel, and W. Dür, Hybrid Architecture for Encoded Measurement-Based Quantum Computation, Sci. Rep. 4, 5364 (2014).
18. N. H. Nickerson, Y. Li, and S. C. Benjamin, Topological Quantum Computing with a Very Noisy Network and Error Rates Approaching One Percent, Nat. Commun. 4, 1756 (2013).
19. A. Kitaev, in Proceedings of the Third International Conference on Quantum Communication and Measurement (Plenum Press, New York, 1997).
20. A. Y. Kitaev, Fault-Tolerant Quantum Computation by Anyons, Ann. Phys. (Amsterdam) 303, 2 (2003).
21. E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological Quantum Memory, J. Math. Phys. (N.Y.) 43, 4452 (2002).
22. C. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, Surface Code Quantum Computing by Lattice Surgery, New J. Phys. 14, 123011 (2012).
23. S. Bravyi and A. Kitaev, Universal Quantum Computation with Ideal Clifford Gates and Noisy Ancillas, Phys. Rev. A 71, 022316 (2005).
24. A. G. Fowler, A.M. Stephens, and P. Groszkowski, High- Threshold Universal Quantum Computation on the Surface Code, Phys. Rev. A 80, 052312 (2009).
25. D. S. Wang, A. G. Fowler, and L. C. L. Hollenberg, Quantum Computing with Nearest Neighbor Interactions and Error Rates over 1%, Phys. Rev. A 83, 020302(R) (2011).
26. E. T. Campbell and S. C. Benjamin, Measurement-Based Entanglement under Conditions of Extreme Photon Loss, Phys. Rev. Lett. 101, 130502 (2008).
27. S. D. Barrett and P. Kok, Efficient High-Fidelity Quantum Computation Using Matter Qubits and Linear Optics, Phys. Rev. A 71, 060310 (2005).
28. A. Reiserer, N. Kalb, G. Rempe, and S. Ritter, A Quantum Gate between a Flying Optical Photon and a Single Trapped Atom, Nature (London) 508, 237 (2014).
29. M. M. Steiner, H.M. Meyer, J. Reichel, and M. Köhl, Photon Emission and Absorption of a Single Ion coupled to an Optical Fiber-Cavity, arXiv:1407.6036.
30. S. C. Benjamin, D. E. Browne, J. Fitzsimons, and J. J. L. Morton, Brokered Graph-State Quantum Computation, New J. Phys. 8, 141 (2006).
31. S. Bravyi and A. Vargo, Simulation of Rare Events in Quantum Error Correction, Phys. Rev. A 88, 062308 (2013).
32. F. H. E. Watson and S. D. Barrett, Logical Error Rate Scaling of the Toric Code, arXiv:1312.5213v2.
33. A. Jamiolkowski, Linear Transformations which Preserve Trace and Positive Semidefiniteness of Operators, Rep. Math. Phys. 3, 275 (1972).
34. J. Edmonds, Paths, Trees, and Flowers, Can. J. Math. 17, 449 (1965).
35. V. Kolmogorov, Blossom V: A New Implementation of a Minimum Cost Perfect Matching Algorithm, Math. Program. Comput. 1, 43 (2009).
36. D. S. Wang, A. G. Fowler, A.M. Stephens, and L. C. L. Hollenberg, Threshold Error Rates for the Toric and Planar Codes, Quantum Inf. Comput. 10, 456 (2010).