Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes

Ilan Tzitrin · J. Eli Bourassa · Nicolas C. Menicucci · Krishna Kumar Sabapathy · 2020 · Physical Review A 101, 032315

| 编号 QCV003 | 主题 连续变量与玻色子算术 | 链接 arXiv:1910.03673 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

Encoding a qubit in the continuous degrees of freedom of an oscillator is a promising path to error-corrected quantum computation. One advantageous way to achieve this is through Gottesman-Kitaev-Preskill (GKP) grid states, whose symmetries allow for the correction of any small continuous error on the oscillator. Unfortunately, ideal grid states have infinite energy, so it is important to find finite-energy approximations that are realistic, practical, and useful for applications. In the first half of this work we investigate the impact of imperfect GKP states on computational circuits independently of the physical architecture. To this end, we analyze the behaviour of the physical and logical content of normalizable GKP states through several figures of merit, employing a recently-developed modular subsystem decomposition. By tracking the errors that enter into the computational circuit due to imperfections in the GKP states, we are able to gauge the utility of these states for NISQ (Noisy Intermediate-Scale Quantum) devices. In the second half, we focus on a state preparation approach in the photonic domain wherein photon-number-resolving measurements on some modes of Gaussian states produce non-Gaussian states in others. We produce detailed numerical results for the preparation of GKP states alongside estimating the resource requirements in practical settings and probing the quality of the resulting states with the tools we develop. Our numerical experiments indicate that we can generate any state in the GKP Bloch sphere with nearly equal resources, which has implications for magic state preparation overheads.

本站词条在引用该文献时，会以 wikilink（sources/QCV003）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。