We examine continuous-variable gate teleportation using entangled states made from pure product states sent through a beam splitter. We show that such states are Choi states for a (typically) nonunitary gate, and we derive the associated Kraus operator for teleportation, which can be used to realize non-Gaussian, nonunitary quantum operations on an input state. With this result, we show how gate teleportation is used to perform error correction on bosonic qubits encoded using the Gottesman-Kitaev-Preskill (GKP) code. This result is presented in the context of deterministically produced macronode cluster states, generated by constant-depth linear optical networks, supplemented with a probabilistic supply of GKP states. The upshot of our technique is that state injection for both gate teleportation and error correction can be achieved without active squeezing operations---an experimental bottleneck for quantum optical implementations.
We examine continuous-variable gate teleportation using entangled states made from pure product states sent through a beam splitter. We show that such states are Choi states for a (typically) nonunitary gate, and we derive the associated Kraus operator for teleportation, which can be used to realize non-Gaussian, nonunitary quantum operations on an input state. With this result, we show how gate teleportation is used to perform error correction on bosonic qubits encoded using the Gottesman-Kitaev-Preskill (GKP) code. This result is presented in the context of deterministically produced macronode cluster states, generated by constant-depth linear optical networks, supplemented with a probabilistic supply of GKP states. The upshot of our technique is that state injection for both gate teleportation and error correction can be achieved without active squeezing operations---an experimental bottleneck for quantum optical implementations.
Continuous-variable cluster states allow for fault-tolerant measurement-based quantum computing when used in tandem with the Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode. For quad-rail-lattice macronode cluster states, whose construction is defined by a fixed, low-depth beam splitter network, we show that a Clifford gate and GKP error correction can be simultaneously implemented in a single teleportation step. We give explicit recipes to realize the Clifford generating set, and we calculate the logical gate-error rates given finite squeezing in the cluster-state and GKP resources. We find that logical error rates of ${10}^{\ensuremath{-}2}$--${10}^{\ensuremath{-}3}$, compatible with the thresholds of topological codes, can be achieved with squeezing of 11.9--13.7 dB. The protocol presented eliminates noise present in prior schemes and puts the required squeezing for fault tolerance in the range of current state-of-the-art optical experiments. Finally, we show how to produce distillable GKP magic states directly within the cluster state.
To be useful, quantum computers will be required to successfully correct errors occurring at the hardware level. Bosonic codes provide a hardware-efficient option for error correction, but fault-tolerance further requires that the available gate interactions be compatible with the code. A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code, for which a linear beamsplitter-like coupling between two bosonic modes is fault-tolerant, making this a key primitive for building larger systems. Here, using two motional modes of a trapped ion, we demonstrate the generation of entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter. We generate all four Bell states with an average fidelity of 69%, and subsequently demonstrate an extension of the entangled state lifetime through the use of quantum error correction. These results complete the set of Gaussian operations required for quantum computing with GKP codes and enable explorations of multi-mode bosonic encodings as well as fundamental tests of information channels.
Continuous-variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction.However, no complete fault-tolerant architecture exists that includes everything from cluster-state generation with finite squeezing to gate implementations with realistic noise and error correction.In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates can be efficiently implemented by gate teleportation.To accommodate scalability, we propose architectures that allow both spatial and temporal multiplexing, with the temporally encoded version requiring as little as two squeezed light sources.Because of its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation.To validate fault tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP states as well as gate noise caused by finite squeezing in the cluster state.We find a fault-tolerant squeezing threshold of 12.7 dB, with room for further improvement.
Gate teleportation, together with magic state distillation, is a promising route towards fault-tolerant, universal computation. In the context of bosonic quantum computation, Baragiola et al. PRL 123(20).200502 (2019) showed that within the framework of Gottesman--Kitaev--Preskill codes, encoded magic states suitable for distillation can be produced by error correcting Gaussian states, such as the vacuum. Here, we show that applying the same framework to simple non-Gaussian input states can significantly improve the quality of the magic states obtained, reducing the overall resources for the complete distillation procedure. We focus on superpositions of coherent states or Fock states, showing that many can lead to improvements in the generation of high-quality encoded magic states, which in some cases reduces the resources required for magic state distillation by about a factor 3. We also investigate the primary source of these improvements and find that, unlike what was previously conjectured, the suitability of input states is not fully explained by symmetry arguments. Instead, the best states seem to avoid projection near stabilizer states as a result of the error correction procedure.
Quantum error correction is essential for achieving fault-tolerant quantum computing. Gottesman-Kitaev-Preskill (GKP) codes are particularly effective at correcting continuous noise, such as Gaussian noise and loss, and can significantly reduce overhead when concatenated with qubit error-correcting codes like surface codes. GKP error correction can be implemented using either a teleportation-based method, known as Knill error correction, or a quantum non-demolition-based approach, known as Steane error correction. In this work, we conduct a comprehensive performance analysis of these established GKP error correction schemes, deriving an analytical expression for the post-correction GKP squeezing and displacement errors. Our results show that there is flexibility in choosing the entangling gate used with the teleportation-based Knill approach. Furthermore, when implemented using the recently introduced qunaught states, the Knill approach not only achieves superior GKP squeezing compared to other variants but is also the simplest to realize experimentally in the optical domain.
Continuous-variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction. However, no complete fault-tolerant architecture exists that includes everything from cluster-state generation with finite squeezing to gate implementations with realistic noise and error correction. In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates can be efficiently implemented by gate teleportation. To accommodate scalability, we propose architectures that allow both spatial and temporal multiplexing, with the temporally encoded version requiring as little as two squeezed light sources. Because of its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation. To validate fault tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP states as well as gate noise caused by finite squeezing in the cluster state. We find a fault-tolerant squeezing threshold of 12.7 dB, with room for further improvement.Received 11 January 2021Revised 18 May 2021Accepted 23 July 2021DOI:https://doi.org/10.1103/PRXQuantum.2.030325Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.Published by the American Physical SocietyPhysics Subject Headings (PhySH)Research AreasMeasurement-based quantum computingOptical quantum information processingQuantum information processing with continuous variablesQuantum InformationAtomic, Molecular & Optical