In this paper, we investigate the error correction of universal Gaussian transformations obtained in the process of continuous-variable quantum computations. We have tried to bring our theoretical studies closer to the actual picture in the experiment. When investigating the error correction procedure, we have considered that both the resource GKP state itself and the entanglement transformation are imperfect. In reality, the GKP state has a finite width associated with the finite degree of squeezing, and the entanglement transformation is performed with error. We have considered a hybrid scheme to implement the universal Gaussian transformations. In this scheme, the transformations are realized through computations on the cluster state, supplemented by linear optical operation. This scheme gives the smallest error in the implementation of universal Gaussian transformations. The use of such a scheme made it possible to reduce the oscillator squeezing threshold required for the implementing of fault-tolerant quantum computation schemes close to reality to -19.25 dB.
In this paper, we investigate the error correction of universal Gaussian transformations obtained in the process of continuous-variable quantum computations. We have tried to bring our theoretical studies closer to the actual picture in the experiment. When investigating the error correction procedure, we have considered that both the resource GKP state itself and the entanglement transformation are imperfect. In reality, the GKP state has a finite width associated with the finite degree of squeezing, and the entanglement transformation is performed with error. We have considered a hybrid scheme to implement the universal Gaussian transformations. In this scheme, the transformations are realized through computations on the cluster state, supplemented by linear optical operation. This scheme gives the smallest error in the implementation of universal Gaussian transformations. The use of such a scheme made it possible to reduce the oscillator squeezing threshold required for the implementing of fault-tolerant quantum computation schemes close to reality to -19.25 dB.
A long-standing open question about Gaussian continuous-variable cluster states is whether they enable fault-tolerant measurement-based quantum computation. The answer is yes. Initial squeezing in the cluster above a threshold value of 20.5 dB ensures that errors from finite squeezing acting on encoded qubits are below the fault-tolerance threshold of known qubit-based error-correcting codes. By concatenating with one of these codes and using ancilla-based error correction, fault-tolerant measurement-based quantum computation of theoretically indefinite length is possible with finitely squeezed cluster states.
Hybridizing different physical systems or degrees of freedom offers significant advantages for realizing practical, universal, scalable, and fault-tolerant quantum computation (FTQC). Here, we propose optical FTQC schemes with low squeezing thresholds by leveraging the strengths of both discrete-variable (DV) and continuous-variable (CV) systems while utilizing frequency, time, and orbital angular momentum degrees of freedom. First, we design an optical entanglement generator (OEG) capable of producing various types of entangled pairs, including cluster pairs, hybrid entangled pairs, and GKP Bell pairs, which can be flexibly chosen by adjusting the measurement basis. Additionally, the OEG features extra ports for directly inputting (outputting) data (result) states via quantum teleportation, eliminating the need for optical switches. Secondly, large-scale one-dimensional, two-dimensional, and three-dimensional (3D) hybrid cluster states, composed of DV Gottesman-Kitaev-Preskill (GKP) qubits and CV squeezed states, are deterministically generated using the entangled pairs passed through a time-delay system. Moreover, we optimize the surface-GKP code to further reduce logical errors during the stabilizer measurements in the surface code. By combining the 3D cubic hybrid cluster state with the modified surface-GKP code and accounting for full circuit-level noise, FTQC is achieved with a squeezing threshold of 10 dB. Moreover, our method can also generate a 3D macronode Raussendorf-Harrington-Goyal (RHG) cluster state, facilitating an alternative FTQC scheme via the RHG-GKP code. Our work provides a viable pathway toward future optical FTQC architectures.
Continuous-variable (CV) cluster states offer a promising platform for large-scale measurement-based quantum computations (MBQC). However, finite squeezing inevitably introduces Gaussian noise during MBQC. While fault-tolerant MBQC schemes exist in principle, they require the scalable incorporation of non-Gaussian resources, such as GKP states, which remain experimentally challenging. Consequently, a central question at this stage is how finite squeezing fundamentally constrains the intrinsic computational power of CV cluster states themselves. In this work, we address this question by analyzing the classical complexity of measurement-based linear optics (MBLO) implemented with such states, motivated by its near-term feasibility and recent experimental progress. We develop an explicit MBLO framework and examine how the squeezing level governs the complexity of the classical simulation of the resulting output states. Specifically, we identify squeezing-level thresholds that delineate classically tractable and intractable regimes, thereby revealing a squeezing-driven complexity phase transition. These findings advance our understanding of the squeezing resources necessary for meaningful quantum computation in current experimental regimes. Furthermore, they underscore the critical need to either scale the squeezing level or integrate error-correction schemes to achieve reliable, large-scale quantum computation with CV cluster states.
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.
To implement fault-tolerant quantum computation (FTQC) with continuous variables, continuous variables need to be digitized using an appropriate code such as the Gottesman-Kitaev-Preskill (GKP) qubit. The scheme introduced in [Fukui et al. Phys. Rev. X 8, 021054 (2018)] has reduced the threshold of the squeezing level required for continuous-variable FTQC to less than 10 dB, assuming noise derived from the GKP qubit itself. In this paper, we propose a scheme to improve noise tolerance during the construction of a large-scale cluster state used for FTQC with the GKP qubits. In our scheme, a small-scale cluster state is prepared by employing maximum-likelihood estimation, the entanglement generation via the Bell measurement, and probabilistic reliable measurement. Then, a large-scale cluster state is constructed from the small-scale cluster states via the reliable encoded Bell measurement. In the numerical calculations, we assume errors derived from the two-mode gate and loss in the homodyne measurement in addition to noise from the GKP qubit itself. The results show that the thresholds of a squeezing level are around 8.1, 9.6, and 12.4 dB for loss in the homodyne measurement 0, 5, and 10%, respectively. Hence, this paper provides a way toward continuous-variable FTQC with a feasible squeezing level.
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quantum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multimode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.