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:1005.1112 · Physical Review A

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

Qing Lin, Bing He

Published Aug 30, 2010• 47 citations
arXivHTMLPDF

Abstract

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.
DOI
10.1103/physreva.82.022331

Related papers

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

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 generation of three-dimensional cluster state with cross-phase modulation

Qing Lin

Based on the former structures in the generation of two-dimensional cluster states, we first propose a scheme to generate linear three-dimensional (3D) cluster state. After that, we develop the former structures to three-dimension, and then we could use them to generate universal 3D cluster states. In final, we provide two new structures, which could make the generation of a special type of 3D cluster state very efficient. All the proposals work with cross-phase modulation, so they are deterministic, highly efficient, fast, compared with the former schemes. It will make the requirement of quantum memory much relax, thus it is more feasible and suitable for large-scale one-way quantum computation.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Jan 1, 2011•0 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•19 citations

Robust cluster state generation using ancilla-based systems

Viv M. Kendon, Katherine Louise Brown, Clare Horsman +1 more

Efficient generation of cluster states is crucial for engineering large-scale measurement-based quantum computers. Hybrid matter-optical systems offer a robust, scalable path to this goal. Such systems have an ancilla which acts as a bus connecting the qubits. Ancilla-driven schemes are important for chip-based quantum computing architectures, where the flying ancilla mediates between static qubits. Hybrid architectures form a natural substrate for measurement-based quantum computing (MBQC) [1], one type of which (the topological model) has the best error threshold for quantum computing [2]. In this type of processing a highly-entangled cluster state is generated, and then computation performed by sequential qubit measurements. The quantum processing task is to generate the cluster state, after which it becomes a matter of measurement and classical communication. In physically-realizable implementations the cluster is prepared dynamically, a few layers at a time. As the cluster state is the fundamental quantum resource of a measurement-based computation, it becomes extremely important to make it as error-free as possible. Errors in constructing the cluster can propagate rapidly through a computation because of the highly-entangled nature of the state, leading to failure of the computation. Hybrid systems are susceptible to specific error types that other systems are not, because of the use of the mediating ancilla. In cases where the ancilla is not destroyed after each gate there is a nonzero probability of errors propagating through ancilla reuse. FIG. 1: A cluster of 4 bricks of length b = 5 qubits, each made using a different bus. We present the optimal scheme for dynamic fault-tolerant 2-D cluster state generation in hybrid systems where the mediating system can be used for more than a single gate operation without being reset. We divide the cluster state into “Lego bricks”, each of which uses a single bus. We give the optimal method for constructing the bricks, reducing the number of system-bus entanglements. We then show how to determine the block size based on the error threshold of the system being used. We find that, even when the probability of error in the system is high, this scheme can still deliver significant efficiency savings through bus reuse, enabling a larger cluster to be generated. By reducing the time required to prepare sections of the cluster, bus reuse more than doubles the size of the computational workspace that can be used before decoherence effects dominate [3]. A simple example of the bricks is shown in figure 1. They are always the same height (m direction), but have length b (n direction) determined by [3] 1 ¡1 − exp[−(6b + 4)γτ − 16bηβ2]¢ ≤ ε. (1) 2 For a given set of experimental parameters γ, τ, η and β, and desired dephasing limit to ε, this determines b. If we use one bus per CPhase gate to generate a brick, we have 1 ¡1 − exp[−16bγτ − 4ηβ2]¢ ≤ ε. (2) 2 Comparing equations (1) and (2), we find our Lego scheme produces less qubit dephasing than using one bus per CPhase gate provided ηβ2 < ∼ γτ/2. Compared with 8mn − 4(m + n) bus operations with no bus reuse, for large clusters, the Lego scheme uses less than half for b > 2. And even for b = 1, the reduction is O(5mn) compared to O(8mn), equivalent to the method of [4] for five qubits per bus. This will thus be the method of choice for any ancilla-based cluster generation that allows bus reuse. Our results are directly applicable to bus-based experimental production of cluster states, enabling the same FIG. 2: Dynamic generation using multiple ancillas. resources to produce dynamically-generated cluster states of twice the size compared to single-gate bus use, see fig. 2. For multi-bus dynamic schemes, fully scalable operation can be achieved with half the coherence time compared to single-gate buses, needing as few as 20 CPhase gates per bus. We thank Aram Harrow, Ashley Stephens and Simon Devitt for useful discussions. CH was supported by EU project QAP and the Bristol Centre for Nanoscience and Quantum Information. KLB is supported by a UK Engineering and Physical Sciences Research Council industrial CASE studentship from Hewlett-Packard, VMK is supported by a UK Royal Society University Research Fellowship and WJM acknowledges partial support from the EU project HIP and MEXT in Japan.

International Conference on Quantum Information•Jan 1, 2011•0 citations

Time-Domain Multiplexed Two-Dimensional Cluster State for Large-Scale Universal Multi-Input One-Way Quantum Computation

Warit Asavanant, Hidehiro Yonezawa, Akira Furusawa +8 more

One-way quantum computation is a promising scheme for realizing large-scale quantum computation, where computation is done via measurements on a universal multi-mode entangled resource called cluster state. The capability of this method is determined by the size and the dimension of the cluster state; the size is roughly equivalent to the number of input modes times number of operation steps, while the dimension determines universality and fault tolerance of the computation. To achieve universality, two-dimensional cluster state is required. Among many approaches, time-domain multiplexing using optical system [1, 2] is a promising method where quantum state is encoded in a temporal wave packet. Although universality is still lacking, one-million-mode one-dimensional cluster state has been demonstrated with this approach [3].

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 1, 2019•0 citations
Based on the former structures in the generation of two-dimensional cluster states, we first propose a scheme to generate linear three-dimensional (3D) cluster state. After that, we develop the former structures to three-dimension, and then we could use them to generate universal 3D cluster states. In final, we provide two new structures, which could make the generation of a special type of 3D cluster state very efficient. All the proposals work with cross-phase modulation, so they are deterministic, highly efficient, fast, compared with the former schemes. It will make the requirement of quantum memory much relax, thus it is more feasible and suitable for large-scale one-way quantum computation.
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.
Efficient generation of cluster states is crucial for engineering large-scale measurement-based quantum computers. Hybrid matter-optical systems offer a robust, scalable path to this goal. Such systems have an ancilla which acts as a bus connecting the qubits. Ancilla-driven schemes are important for chip-based quantum computing architectures, where the flying ancilla mediates between static qubits. Hybrid architectures form a natural substrate for measurement-based quantum computing (MBQC) [1], one type of which (the topological model) has the best error threshold for quantum computing [2]. In this type of processing a highly-entangled cluster state is generated, and then computation performed by sequential qubit measurements. The quantum processing task is to generate the cluster state, after which it becomes a matter of measurement and classical communication. In physically-realizable implementations the cluster is prepared dynamically, a few layers at a time. As the cluster state is the fundamental quantum resource of a measurement-based computation, it becomes extremely important to make it as error-free as possible. Errors in constructing the cluster can propagate rapidly through a computation because of the highly-entangled nature of the state, leading to failure of the computation. Hybrid systems are susceptible to specific error types that other systems are not, because of the use of the mediating ancilla. In cases where the ancilla is not destroyed after each gate there is a nonzero probability of errors propagating through ancilla reuse. FIG. 1: A cluster of 4 bricks of length b = 5 qubits, each made using a different bus. We present the optimal scheme for dynamic fault-tolerant 2-D cluster state generation in hybrid systems where the mediating system can be used for more than a single gate operation without being reset. We divide the cluster state into “Lego bricks”, each of which uses a single bus. We give the optimal method for constructing the bricks, reducing the number of system-bus entanglements. We then show how to determine the block size based on the error threshold of the system being used. We find that, even when the probability of error in the system is high, this scheme can still deliver significant efficiency savings through bus reuse, enabling a larger cluster to be generated. By reducing the time required to prepare sections of the cluster, bus reuse more than doubles the size of the computational workspace that can be used before decoherence effects dominate [3]. A simple example of the bricks is shown in figure 1. They are always the same height (m direction), but have length b (n direction) determined by [3] 1 ¡1 − exp[−(6b + 4)γτ − 16bηβ2]¢ ≤ ε. (1) 2 For a given set of experimental parameters γ, τ, η and β, and desired dephasing limit to ε, this determines b. If we use one bus per CPhase gate to generate a brick, we have 1 ¡1 − exp[−16bγτ − 4ηβ2]¢ ≤ ε. (2) 2 Comparing equations (1) and (2), we find our Lego scheme produces less qubit dephasing than using one bus per CPhase gate provided ηβ2 < ∼ γτ/2. Compared with 8mn − 4(m + n) bus operations with no bus reuse, for large clusters, the Lego scheme uses less than half for b > 2. And even for b = 1, the reduction is O(5mn) compared to O(8mn), equivalent to the method of [4] for five qubits per bus. This will thus be the method of choice for any ancilla-based cluster generation that allows bus reuse. Our results are directly applicable to bus-based experimental production of cluster states, enabling the same FIG. 2: Dynamic generation using multiple ancillas. resources to produce dynamically-generated cluster states of twice the size compared to single-gate bus use, see fig. 2. For multi-bus dynamic schemes, fully scalable operation can be achieved with half the coherence time compared to single-gate buses, needing as few as 20 CPhase gates per bus. We thank Aram Harrow, Ashley Stephens and Simon Devitt for useful discussions. CH was supported by EU project QAP and the Bristol Centre for Nanoscience and Quantum Information. KLB is supported by a UK Engineering and Physical Sciences Research Council industrial CASE studentship from Hewlett-Packard, VMK is supported by a UK Royal Society University Research Fellowship and WJM acknowledges partial support from the EU project HIP and MEXT in Japan.
One-way quantum computation is a promising scheme for realizing large-scale quantum computation, where computation is done via measurements on a universal multi-mode entangled resource called cluster state. The capability of this method is determined by the size and the dimension of the cluster state; the size is roughly equivalent to the number of input modes times number of operation steps, while the dimension determines universality and fault tolerance of the computation. To achieve universality, two-dimensional cluster state is required. Among many approaches, time-domain multiplexing using optical system [1, 2] is a promising method where quantum state is encoded in a temporal wave packet. Although universality is still lacking, one-million-mode one-dimensional cluster state has been demonstrated with this approach [3].