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

Cluster-state generation with aging qubits

Joshua M. Waddington, Joshua A. Kettlewell, Pieter Kok

Published Jul 29, 2013• 5 citations
arXivHTMLPDF

Abstract

Cluster states for measurement-based quantum computing can be created with entangling operations of arbitrary low success probability. This will place a lower bound on the minimum lifetime of the qubits used in the implementation. Here, we present a simple scaling argument for the ${T}_{2}$ time of the qubits for various cluster-state geometries, and we estimate the size of the qubit reservoir that is needed for the creation of miniclusters.

DOI
10.1103/physreva.88.012330

Related papers

Cluster state generation with ageing qubits

Pieter Kok

Cluster states for measurement-based quantum computing can be created with entangling operations of arbitrary low success probability. This will place a lower bound on the minimum lifetime of the qubits used in the implementation. Here, we present a simple scaling argument for the T2time of the qubits for various cluster state geometries. The results suggest that the required T2times are not unrealistic for the practical implementation of universal quantum computing with cluster states.

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Jun 1, 2013•0 citations

Layer-by-layer generation of cluster states

Katherine L. Brown, Dominic C. Horsman, Viv M. Kendon +1 more

Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and measurements are needed to perform universal quantum computation. In this paper, we explore techniques for quickly and deterministically building a cluster state. In particular, we consider generating cluster states on a qubus quantum computer, a computational architecture which uses a continuous variable ancilla to generate interactions between qubits. We explore several techniques for building the cluster, with the number of operations required depending on whether we allow the ability to destroy previously created controlled-phase links between qubits. In the case where we cannot destroy these links, we show how to create an $n\ifmmode\times\else\texttimes\fi{}m$ cluster using just $3nm\ensuremath{-}2n\ensuremath{-}\ensuremath{\lceil}3m/2\ensuremath{\rceil}+3$ operations. This gives more than a factor of 2 savings over a naive method. Further savings can be obtained if we include the ability to destroy links, in which case we only need $\ensuremath{\lceil}\frac{1}{3}(8nm\ensuremath{-}4n\ensuremath{-}4m\ensuremath{-}8)\ensuremath{\rceil}$ operations. Unfortunately, the latter scheme is more complicated so choosing the correct order to interact the qubits is considerably more difficult. A halfway scheme, that keeps a modular generation but saves additional operations over never destroying links requires only $3nm\ensuremath{-}2n\ensuremath{-}2m+4$ operations. The first scheme and the last scheme are the most practical for building a cluster state because they split up the generation into the repetition of simple sections.

arXiv:1111.1774•Physical Review A•May 7, 2012•14 citations

Weak nonlinearities and cluster states

Sebastien G. R. Louis, Kae Nemoto, William J. Munro +1 more

We propose a scalable approach to building cluster states of matter qubits using coherent states of light. Recent work on the subject relies on the use of single-photonic qubits in the measurement process. These schemes have a low initial success probability and low detector efficiencies cause a serious blowup in resources. In contrast, our approach uses continuous variables and highly efficient measurements. We present a two-qubit scheme, with a simple homodyne measurement system yielding an entangling operation with success probability 1/2. Then we extend this to a three-qubit interaction, increasing this probability to 3/4. We discuss the important issues of the overhead cost and the time scaling, showing how these can be vastly improved with access to this new probability range.

arXiv:0704.1931•Physical Review A•Apr 20, 2007•39 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

1D Cluster State Generation On Superconducting Hardware

Sharma, Rahul Dev

Measurement-based Quantum Computation(MBQC) utilize entanglement as resource for performing quantum computation. Generating cluster state using entanglement as resource is a key bottleneck for the adoption of MBQC. To generate cluster state with charge-qubit arrrays, we provide analytical derivations and numerical validations for 4-qubit cluster state. We compare our fidelities under ideal (noise-free) Hamiltonian evolution and due to effect of decoherence. We show incorporating energy relaxation ($T_1$) yields $>$90\% fidelity while pure dephasing $T_2$ show $70\%$ decays at fourth harmonics. We further show under noise $T_2$ decays to 50\% within 15 time units, versus $>$70\% under relaxation time units ($T_1$)--only. This decay quantify degradation effect of $T_2$ on preparing cluster--state preparation is more than $T_1$. We highlight the critical need for targeted error-mitigation strategies in near-term MBQC implementations.

arXiv:2508.21798•Aug 29, 2025•0 citations

Generation of topologically useful entangled states

Neil B. Lovett, Benjamin T. H. Varcoe

Measurement based quantum computation requires the generation of a cluster state (quantum resource) prior to starting a computation. Generation of this entangled state can be difficult with many schemes already proposed. We present an abstract scheme which can create 2D cluster states as a universal resource for quantum computing. We find a linear scaling of grid size with cluster depth. The scheme is also capable of creating more exotic topologies including 3D structures and the unit cell for topological error correction. We note its relevance to the cavity QED scheme in [30] although it could be applied to various architectures.

arXiv:1101.1220•International journal of unconventional computing•Jan 6, 2011•0 citations
Cluster states for measurement-based quantum computing can be created with entangling operations of arbitrary low success probability. This will place a lower bound on the minimum lifetime of the qubits used in the implementation. Here, we present a simple scaling argument for the T2{T}_{2}T2​ time of the qubits for various cluster-state geometries, and we estimate the size of the qubit reservoir that is needed for the creation of miniclusters.
Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and measurements are needed to perform universal quantum computation. In this paper, we explore techniques for quickly and deterministically building a cluster state. In particular, we consider generating cluster states on a qubus quantum computer, a computational architecture which uses a continuous variable ancilla to generate interactions between qubits. We explore several techniques for building the cluster, with the number of operations required depending on whether we allow the ability to destroy previously created controlled-phase links between qubits. In the case where we cannot destroy these links, we show how to create an $n\ifmmode\times\else\texttimes\fi{}m$ cluster using just $3nm\ensuremath{-}2n\ensuremath{-}\ensuremath{\lceil}3m/2\ensuremath{\rceil}+3$ operations. This gives more than a factor of 2 savings over a naive method. Further savings can be obtained if we include the ability to destroy links, in which case we only need $\ensuremath{\lceil}\frac{1}{3}(8nm\ensuremath{-}4n\ensuremath{-}4m\ensuremath{-}8)\ensuremath{\rceil}$ operations. Unfortunately, the latter scheme is more complicated so choosing the correct order to interact the qubits is considerably more difficult. A halfway scheme, that keeps a modular generation but saves additional operations over never destroying links requires only $3nm\ensuremath{-}2n\ensuremath{-}2m+4$ operations. The first scheme and the last scheme are the most practical for building a cluster state because they split up the generation into the repetition of simple sections.
We propose a scalable approach to building cluster states of matter qubits using coherent states of light. Recent work on the subject relies on the use of single-photonic qubits in the measurement process. These schemes have a low initial success probability and low detector efficiencies cause a serious blowup in resources. In contrast, our approach uses continuous variables and highly efficient measurements. We present a two-qubit scheme, with a simple homodyne measurement system yielding an entangling operation with success probability 1/2. Then we extend this to a three-qubit interaction, increasing this probability to 3/4. We discuss the important issues of the overhead cost and the time scaling, showing how these can be vastly improved with access to this new probability range.
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.
Measurement-based Quantum Computation(MBQC) utilize entanglement as resource for performing quantum computation. Generating cluster state using entanglement as resource is a key bottleneck for the adoption of MBQC. To generate cluster state with charge-qubit arrrays, we provide analytical derivations and numerical validations for 4-qubit cluster state. We compare our fidelities under ideal (noise-free) Hamiltonian evolution and due to effect of decoherence. We show incorporating energy relaxation (T1T_1T1​) yields $>$90\% fidelity while pure dephasing T2T_2T2​ show 70%70\%70% decays at fourth harmonics. We further show under noise T2T_2T2​ decays to 50\% within 15 time units, versus $>70%underrelaxationtimeunits(70\% under relaxation time units (70%underrelaxationtimeunits(T_1$)--only. This decay quantify degradation effect of T2T_2T2​ on preparing cluster--state preparation is more than T1T_1T1​. We highlight the critical need for targeted error-mitigation strategies in near-term MBQC implementations.
Measurement based quantum computation requires the generation of a cluster state (quantum resource) prior to starting a computation. Generation of this entangled state can be difficult with many schemes already proposed. We present an abstract scheme which can create 2D cluster states as a universal resource for quantum computing. We find a linear scaling of grid size with cluster depth. The scheme is also capable of creating more exotic topologies including 3D structures and the unit cell for topological error correction. We note its relevance to the cavity QED scheme in [30] although it could be applied to various architectures.