Related papers: A fault-tolerant continuous-variable measurement-b…
Continuous-variable measurement-based quantum computation, which requires deterministically generated large-scale cluster state, is a promising candidate for practical, scalable, universal, and fault-tolerant quantum computation. In this…
The integration of diverse quantum resources and the exploitation of more degrees of freedom provide key operational flexibility for universal fault-tolerant quantum computation. In this work, we propose a flexible…
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…
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 [K. Fukui…
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…
To implement fault-tolerant quantum computation with continuous variables, the Gottesman-Kitaev-Preskill (GKP) qubit has been recognized as an important technological element. However,it is still challenging to experimentally generate the…
The scalability of photonic implementations of fault-tolerant quantum computing based on Gottesman-Kitaev-Preskill (GKP) qubits is injured by the requirements of inline squeezing and reconfigurability of the linear optical network. In this…
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge…
The immense scalability of continuous-variable cluster states motivates their study as a platform for quantum computing, with fault tolerance possible given sufficient squeezing and appropriately encoded qubits [Menicucci, PRL 112, 120504…
We describe a fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions. Topologically protected quantum gates are realized by choosing appropriate boundary conditions on the cluster. We…
We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite…
Continuous-variable (CV) systems have shown remarkable potential for quantum computation, particularly excelling in scalability and error correction through bosonic encoding. Within this framework, the foundational notion of computational…
Due to its unique scalability potential, continuous variable quantum optics is a promising platform for large scale quantum computing. In particular, very large cluster states with a two-dimensional topology that are suitable for universal…
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…
We investigate a scheme of fault-tolerant quantum computation based on the cluster model. Logical qubits are encoded by a suitable code such as the Steane's 7-qubit code. Cluster states of logical qubits are prepared by post-selection…
Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds. As quantum hardware advances toward modular and networked architectures,…
A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery…
This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\eta$, is smaller than a constant threshold, $\eta_c$. The result holds for a very…
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…
Optical continuous-variable cluster states (CVCSs) in combination with Gottesman-Kitaev-Preskill~(GKP) qubits enable fault-tolerant quantum computation so long as these resources are of high enough quality. Previous studies concluded that a…