Abstract
AbstractPractical quantum computing requires robust encoding of logical qubits in physical systems to protect fragile quantum information. Currently, the lack of scalability limits the logical encoding in most physical systems, and thus the high scalability of propagating light can be a game changer. However, propagating light also has difficulty in logical encoding due to weak nonlinearity. Here, we propose a synthesizer that encodes Gottesman-Kitaev-Preskill (GKP) qubits in propagating light by exploiting the nonlinearity of photon detectors. This synthesizer is based on an approach what we call Gaussian breeding, leading to the following four advantages: (i) systematic and rigorous synthesis of arbitrary GKP qubits, (ii) use of minimal resources, (iii) high fidelity and high success probability, and (iv) robustness against loss. There has been no protocol that incorporates all these advantages, and thus the proposed synthesizer excels in both performance and feasibility. By employing our method, one can generate GKP qubits using a few to several squeezed light sources, beam splitters and photon detectors.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Statistical and Nonlinear Physics,Computer Science (miscellaneous)
Reference50 articles.
1. Gottesman, D. An introduction to quantum error correction and fault-tolerant quantum computation https://arxiv.org/abs/0904.2557 (2009).
2. Gottesman, D. Fault-tolerant quantum computation with higher-dimensional systems. In Quantum Computing and Quantum Communications (eds. Williams, C. P.) 302–313 (Springer Berlin Heidelberg, 1999).
3. Fowler, A. G., Mariantoni, M., Martinis, J. M. & Cleland, A. N. Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012).
4. Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).
5. Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505–510 (2019).
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献