Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2003.09197 · Laser Physics Letters

Finding the optimal cluster state configuration. Minimization of one-way quantum computation errors

S. B. Korolev, T. Yu. Golubeva, Yu. M. Golubev

Published Apr 24, 2020• 5 citations
arXivHTMLPDF

Abstract

Abstract In this paper, we estimate the errors of Gaussian transformations implemented using one-way quantum computations on cluster states of various configurations. From all possible cluster state configurations, we choose those that give the smallest computation error. Furthermore, we evaluate errors in hybrid computational schemes, in which Gaussian operations are performed using one-way computations with additional linear transformations. As a result, we find the optimal strategy for the implementation of universal Gaussian computations with minimal errors.

DOI
10.1088/1612-202x/ab83ff

Related papers

Finding the optimal cluster state configuration. Cluster states classification by type of computations

S. B. Korolev, T. Yu. Golubeva, Yu. M. Golubev

Abstract In this paper, we study the transformations that are obtained in one-way quantum computation on continuous-variable cluster states of various configurations. Of all possible cluster configurations, we choose those that are suitable for universal Gaussian operations.

Laser Physics Letters•Feb 14, 2020•4 citations

Finding the optimal cluster state configuration. Cluster states classification by type of computations

S. B. Korolev, Golubeva T. Yu., Golubev Yu. M

In this paper, we study the transformations that are obtained in one-way quantum computation on continuous-variable cluster states of various configurations. Of all possible cluster configurations, we choose those that are suitable for universal Gaussian operations.

arXiv:1911.11511•Nov 26, 2019•0 citations

Error of an arbitrary single-mode Gaussian transformation on a weighted cluster state using a cubic phase gate

E. R. Zinatullin, S. B. Korolev, A. D. Manukhova +1 more

In this paper we propose two strategies for decreasing the error of arbitrary single-mode Gaussian transformations implemented using one-way quantum computation on a four-node linear cluster state. We show that it is possible to minimize the error of the arbitrary single-mode Gaussian transformation by a proper choice of the weight coefficients of the cluster state. We modify the computation scheme by adding a non-Gaussian state obtained using a cubic phase gate as one of the nodes of the cluster. This further decreases the computation error. We evaluate the efficiencies of the proposed optimization schemes comparing the probabilities of the error correction of the quantum computations with and without optimizations. We show that for some transformations, the error probability can be reduced by up to 900 times.

arXiv:2207.09548•Physical Review A•Sep 12, 2022•8 citations

Error correction of the continuous-variable quantum hybrid computation on two-node cluster states: limit of squeezing

S. B. Korolev, Golubeva T. Yu.

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.

arXiv:2201.07554•Jan 19, 2022•0 citations

Examples of Gaussian cluster computation

Peter van Loock

Simple examples that illustrate the principles of one-way quantum computation using Gaussian continuous-variable cluster states are given. In these examples, only single-mode evolutions, realizable via linear clusters, are considered. In particular, one can focus on Gaussian single-mode transformations performed through the cluster state. These examples highlight the differences between cluster-based schemes and protocols in which special quantum states are prepared off-line and then used as a resource for the on-line computation.

arXiv:quant-ph/0606212•Journal of the Optical Society of America B•Jan 26, 2007•43 citations

Universal Quantum Computation with Continuous-Variable Cluster States

Nicolas C. Menicucci, Peter van Loock, Mile Gu +3 more

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.

arXiv:quant-ph/0605198•Physical Review Letters•Sep 13, 2006•884 citations
Abstract In this paper, we estimate the errors of Gaussian transformations implemented using one-way quantum computations on cluster states of various configurations. From all possible cluster state configurations, we choose those that give the smallest computation error. Furthermore, we evaluate errors in hybrid computational schemes, in which Gaussian operations are performed using one-way computations with additional linear transformations. As a result, we find the optimal strategy for the implementation of universal Gaussian computations with minimal errors.
In this paper we propose two strategies for decreasing the error of arbitrary single-mode Gaussian transformations implemented using one-way quantum computation on a four-node linear cluster state. We show that it is possible to minimize the error of the arbitrary single-mode Gaussian transformation by a proper choice of the weight coefficients of the cluster state. We modify the computation scheme by adding a non-Gaussian state obtained using a cubic phase gate as one of the nodes of the cluster. This further decreases the computation error. We evaluate the efficiencies of the proposed optimization schemes comparing the probabilities of the error correction of the quantum computations with and without optimizations. We show that for some transformations, the error probability can be reduced by up to 900 times.
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.
Simple examples that illustrate the principles of one-way quantum computation using Gaussian continuous-variable cluster states are given. In these examples, only single-mode evolutions, realizable via linear clusters, are considered. In particular, one can focus on Gaussian single-mode transformations performed through the cluster state. These examples highlight the differences between cluster-based schemes and protocols in which special quantum states are prepared off-line and then used as a resource for the on-line computation.
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.