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• 6 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.

arXiv:1911.11511•Laser Physics Letters•Feb 14, 2020•5 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

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•918 citations

Cluster States from Gaussian States: Essential Diagnostic Tools for Continuous-Variable One-Way Quantum Computing

Carlos González-Arciniegas, P. Nussenzveig, M. Martinelli +1 more

Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally outscaled qubit platforms by orders of magnitude.Room-temperature implementation of CV cluster states has been achieved with quantum optics by using multimode squeezed Gaussian states.It has also been proven that fault tolerance thresholds for CV quantum computing can be reached at realistic squeezing levels.In this paper, we show that standard approaches to design and characterize CV cluster states can miss entanglement present in the system.Such hidden entanglement may be used to increase the power of a quantum computer but it can also, if undetected, hinder the successful implementation of a quantum algorithm.By a detailed analysis of the structure of Gaussian states, we derive an algorithm that reveals hidden entanglement in an arbitrary Gaussian state and optimizes its use for one-way quantum computing.

arXiv:1912.06463•PRX Quantum•Sep 13, 2021•15 citations

Error-correcting one-way quantum computation with global entangling gates

Jaewoo Joo, David L. Feder

We present an approach to one-way quantum computation (1WQC) that can compensate for single-qubit errors by encoding the logical information residing on physical qubits into five-qubit error-correcting code states. A logical two-qubit cluster state that is the fundamental resource for encoded quantum teleportation is then described by a graph state containing ten vertices with constant degree seven. Universal 1WQC that incorporates error correction requires only multiple copies of this logical two-qubit state and a logical four-qubit linear cluster state, which are prepared only just in advance of their use in order to minimize the accumulation of errors. We suggest how to implement this approach in systems characterized by qubits in regular two-dimensional lattices for which entangling gates are generically global operations, such as atoms in optical lattices, quantum dots, or superconducting qubits.

arXiv:0908.0768•Physical Review A•Sep 11, 2009•8 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.
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.
Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally outscaled qubit platforms by orders of magnitude.Room-temperature implementation of CV cluster states has been achieved with quantum optics by using multimode squeezed Gaussian states.It has also been proven that fault tolerance thresholds for CV quantum computing can be reached at realistic squeezing levels.In this paper, we show that standard approaches to design and characterize CV cluster states can miss entanglement present in the system.Such hidden entanglement may be used to increase the power of a quantum computer but it can also, if undetected, hinder the successful implementation of a quantum algorithm.By a detailed analysis of the structure of Gaussian states, we derive an algorithm that reveals hidden entanglement in an arbitrary Gaussian state and optimizes its use for one-way quantum computing.
We present an approach to one-way quantum computation (1WQC) that can compensate for single-qubit errors by encoding the logical information residing on physical qubits into five-qubit error-correcting code states. A logical two-qubit cluster state that is the fundamental resource for encoded quantum teleportation is then described by a graph state containing ten vertices with constant degree seven. Universal 1WQC that incorporates error correction requires only multiple copies of this logical two-qubit state and a logical four-qubit linear cluster state, which are prepared only just in advance of their use in order to minimize the accumulation of errors. We suggest how to implement this approach in systems characterized by qubits in regular two-dimensional lattices for which entangling gates are generically global operations, such as atoms in optical lattices, quantum dots, or superconducting qubits.