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

Chinese Physics Letters

Efficient Construction of High-Dimensional Cluster State

Diao Da-Sheng, Zhang Yong-Sheng, Xiang-Fa Zhou, Guo Guang-Can

Published Oct 1, 2008• 6 citations
Publisher

Abstract

We present a scheme for efficiently constructing high-dimensional cluster state using probabilistic entangling quantum gates. It is shown that the required computational overhead scales efficiently both with 1/p and n even if all the entangling quantum gates only succeed with an arbitrary small probability, where p is the success probability of the entangling quantum gate and n is the number of qubits in the computation.

DOI
10.1088/0256-307x/25/10/010

Related papers

One-Way Quantum Computation with Cluster State and Probabilistic Gate

Da-Sheng Diao

We present a scheme for efficiently constructing a two-dimensional cluster state, which serves as the central physical resource for one-way quantum computation. In this scheme, we successfully make the required computational overhead scale efficiently with the qubit number by using a probabilistic entangling quantum gate.

Chinese Physics Letters•Jan 1, 2013•2 citations

Efficient Quantum Computation with Probabilistic Quantum Gates

Luming Duan, Robert Raussendorf

With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p. The required computational overhead scales efficiently both with 1/p and n, where n is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability 1-p far beyond any threshold requirement.

arXiv:quant-ph/0502120•Physical Review Letters•Aug 17, 2005•185 citations

Efficient construction of two-dimensional cluster states with probabilistic quantum gates

Qing Chen, Jianhua Cheng, Ke-Lin Wang +1 more

We propose an efficient scheme for constructing arbitrary two-dimensional (2D) cluster states using probabilistic entangling quantum gates. In our scheme, the 2D cluster state is constructed with starlike basic units generated from 1D cluster chains. By applying parallel operations, the process of generating 2D (or higher-dimensional) cluster states is significantly accelerated, which provides an efficient way to implement realistic one-way quantum computers.

arXiv:quant-ph/0507066•Physical Review A•Jan 9, 2006•37 citations

Strategies for the preparation of large cluster states using non-deterministic gates

Peter P. Rohde, S. D. Barrett

The cluster state model for quantum computation has paved the way for schemes that allow scalable quantum computing, even when using non-deterministic quantum gates. Here the initial step is to prepare a large entangled state using non-deterministic gates. A key question in this context is the relative efficiencies of different 'strategies', i.e. in what order should the non-deterministic gates be applied, in order to maximize the size of the resulting cluster states? In this paper we consider this issue in the context of 'large' cluster states. Specifically, we assume an unlimited resource of qubits and ask what the steady state rate at which 'large' clusters are prepared from this resource is, given an entangling gate with particular characteristics. We measure this rate in terms of the number of entangling gate operations that are applied. Our approach works for a variety of different entangling gate types, with arbitrary failure probability. Our results indicate that strategies whereby one preferentially bonds together clusters of identical length are considerably more efficient than those in which one does not. Additionally, compared to earlier analytic results, our numerical study offers substantially improved resource scaling.

arXiv:quant-ph/0701068•New Journal of Physics•Jun 29, 2007•17 citations

Efficient generation of universal two-dimensional cluster states with hybrid systems

Qing Lin, Bing He

We present a scheme to generate any two-dimensional cluster state efficiently. The number of the basic gate (entangler) operations is on the order of the entanglement bonds of a cluster state. This deterministic scheme, which demands few ancilla resources and no quantum memory, is suitable for large-scale quantum computation.

arXiv:1005.1112•Physical Review A•Aug 30, 2010•48 citations

Potential and limits to cluster-state quantum computing using probabilistic gates

D. Gross, Konrad Kieling, Jens Eisert

We establish bounds to the necessary resource consumption when building up cluster states for one-way computing using probabilistic gates. Emphasis is put on state preparation with linear optical gates, as the probabilistic character is unavoidable here. We identify rigorous general bounds to the necessary consumption of initially available maximally entangled pairs when building up one-dimensional cluster states with individually acting linear optical quantum gates, entangled pairs, and vacuum modes. As the known linear optics gates have a limited maximum success probability, as we show, this amounts to finding the optimal classical strategy of fusing pieces of linear cluster states. A formal notion of classical configurations and strategies is introduced for probabilistic nonfaulty gates. We study the asymptotic performance of strategies that can be simply described, and prove ultimate bounds to the performance of the globally optimal strategy. The arguments employ methods of random walks and convex optimization. This optimal strategy is also the one that requires the shortest storage time, and necessitates the fewest invocations of probabilistic gates. For two-dimensional cluster states, we find, for any elementary success probability, an essentially deterministic preparation of a cluster state with quadratic, hence optimal, asymptotic scaling in the use of entangled pairs. We also identify a percolation effect in state preparation, in that from a threshold probability on, almost all preparations will be either successful or fail. We outline the implications on linear optical architectures and fault-tolerant computations.

arXiv:quant-ph/0605014•Physical Review A•Oct 31, 2006•63 citations
We present a scheme for efficiently constructing high-dimensional cluster state using probabilistic entangling quantum gates. It is shown that the required computational overhead scales efficiently both with 1/p and n even if all the entangling quantum gates only succeed with an arbitrary small probability, where p is the success probability of the entangling quantum gate and n is the number of qubits in the computation.
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p. The required computational overhead scales efficiently both with 1/p and n, where n is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability 1-p far beyond any threshold requirement.
The cluster state model for quantum computation has paved the way for schemes that allow scalable quantum computing, even when using non-deterministic quantum gates. Here the initial step is to prepare a large entangled state using non-deterministic gates. A key question in this context is the relative efficiencies of different 'strategies', i.e. in what order should the non-deterministic gates be applied, in order to maximize the size of the resulting cluster states? In this paper we consider this issue in the context of 'large' cluster states. Specifically, we assume an unlimited resource of qubits and ask what the steady state rate at which 'large' clusters are prepared from this resource is, given an entangling gate with particular characteristics. We measure this rate in terms of the number of entangling gate operations that are applied. Our approach works for a variety of different entangling gate types, with arbitrary failure probability. Our results indicate that strategies whereby one preferentially bonds together clusters of identical length are considerably more efficient than those in which one does not. Additionally, compared to earlier analytic results, our numerical study offers substantially improved resource scaling.
We establish bounds to the necessary resource consumption when building up cluster states for one-way computing using probabilistic gates. Emphasis is put on state preparation with linear optical gates, as the probabilistic character is unavoidable here. We identify rigorous general bounds to the necessary consumption of initially available maximally entangled pairs when building up one-dimensional cluster states with individually acting linear optical quantum gates, entangled pairs, and vacuum modes. As the known linear optics gates have a limited maximum success probability, as we show, this amounts to finding the optimal classical strategy of fusing pieces of linear cluster states. A formal notion of classical configurations and strategies is introduced for probabilistic nonfaulty gates. We study the asymptotic performance of strategies that can be simply described, and prove ultimate bounds to the performance of the globally optimal strategy. The arguments employ methods of random walks and convex optimization. This optimal strategy is also the one that requires the shortest storage time, and necessitates the fewest invocations of probabilistic gates. For two-dimensional cluster states, we find, for any elementary success probability, an essentially deterministic preparation of a cluster state with quadratic, hence optimal, asymptotic scaling in the use of entangled pairs. We also identify a percolation effect in state preparation, in that from a threshold probability on, almost all preparations will be either successful or fail. We outline the implications on linear optical architectures and fault-tolerant computations.