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:quant-ph/0703045 · New Journal of Physics

Cluster state preparation using gates operating at arbitrary success probabilities

Konrad Kieling, D Gross, Jens Eisert

Published Jun 29, 2007• 21 citations
arXivHTMLPDF

Abstract

Several physical architectures allow for measurement-based quantum computing using sequential preparation of cluster states by means of probabilistic quantum gates. In such an approach, the order in which partial resources are combined to form the final cluster state turns out to be crucially important. We determine the influence of this classical decision process on the expected size of the final cluster. Extending earlier work, we consider different quantum gates operating at various probabilites of success. For finite resources, we employ a computer algebra system to obtain the provably optimal classical control strategy and derive symbolic results for the expected final size of the cluster. We identify two regimes: when the success probability of the elementary gates is high, the influence of the classical control strategy is found to be negligible. In that case, other figures of merit become more relevant. In contrast, for small probabilities of success, the choice of an appropriate strategy is crucial.

DOI
10.1088/1367-2630/9/6/200

Related papers

Optimal strategies for fusing optical cluster states

Konrad Kieling, D. Groß, Jens Eisert

We systematically investigate how to optimally build up cluster states for quantum computing with linear optical means using fusion gates, entirely from the perspective of classical control. We develop a notion of classical strategies and consider the globally optimal one to prepare linear cluster states with probabilistic gates. We find that this optimal strategy - which is also the most robust with respect to decoherence processes - gives rise to an advantage of already more than an order of magnitude in the number of maximally entangled pairs when building chains with an expected length of L=40, compared to other legitimate strategies. For two-dimensional cluster states, we present a first scheme achieving the optimal quadratic asymptotic scaling in resource consumption. This analysis shows that the choice of appropriate classical control leads to a very significant reduction in resource consumption.

•Jan 30, 2006•0 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

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

Distributed Hybrid Quantum Computing

Sebastien G. R. Louis

There are numerous proposals for the physical realization of a quantum computer.However, distributed approaches, making use both of flying and stationary qubits, seem to constitute the most promising route towards a truly scalable device.Such systems guarantee extendibility, they incorporate the interface with communication applications and relax the physical realization of the device, allowing for defect tolerance.Flying qubits are included in the more general concept of a quantum bus, a mediating system which can be of higher dimension.Such a quantum bus can be used in the straightforward preparation of a standard multi-qubit resource enabling measurement based quantum computation, the cluster state.This constitutes the framework for the results presented in this thesis.We begin by investigating the effects of dissipation in the continuous variable bus scheme known as the qubus scheme.By considering loss in the bus as it mediates interactions between the stationary qubits, we obtain analytical results for the effective action of the induced quantum gate.We find that a particular two-qubit gate operates with high fidelity in the presence of moderate loss and give a simple iteration scheme to simplify the effects of loss on the qubits.We then attempt to reduce these effects by preparing the bus in more elaborate state, however no improvements are observed.We then apply the qubus scheme to the probabilistic generation of cluster states and develop an entangling gate working with high success probability.This allows us to produce cluster states far more efficiently than other proposals.Investigating new methods to analyze the performance of different generation strategies constitutes the second part of this set of results.We begin by making the large flow approximation, used in queuing theory, to obtain the optimal strategy in a regime with large resources.After what we take the other more familiar limit of single cluster growth and introduce absorbing Markov chains as a key mathematical tool.Finally we look at the transmission of composite quantum systems via a single higher dimensional bus.We provide generalized protocols and interactions guaranteeing a full transfer of the information from one composite system to another.These protocols can also serve information processing tasks, as useful logical operations can be applied to the data as it is transfered.We notice lastly that the qubus scheme constitutes a potential physical realization.

application/pdf•Sep 30, 2008•2 citations

Minimal resources for linear optical one-way computing

Konrad Kieling, David Gross, Jens Eisert

We address the question of how many maximally entangled photon pairs are needed to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily probabilistic with known optimal success probability, this question amounts to finding the optimal strategy for building up cluster states, from the perspective of classical control. We develop a notion of classical strategies and present rigorous statements on the ultimate maximal and minimal uses of resources of the globally optimal strategy. We find that this strategy--being also the most robust with respect to decoherence--gives rise to an advantage of already more than an order of magnitude in the number of maximally entangled pairs when building chains with an expected length of L=40, compared with other legitimate strategies. For two-dimensional cluster states, we present a first scheme achieving the optimal quadratic asymptotic scaling. This analysis shows that the choice of appropriate classical control leads to a significant reduction in resource consumption.

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

Percolation, Renormalization, and Quantum Computing with Nondeterministic Gates

Konrad Kieling, Terry Rudolph, Jens Eisert

We apply a notion of static renormalization to the preparation of entangled states for quantum computing, exploiting ideas from percolation theory. Such a strategy yields a novel way to cope with the randomness of nondeterministic quantum gates. This is most relevant in the context of optical architectures, where probabilistic gates are common, and cold atoms in optical lattices, where hole defects occur. We demonstrate how to efficiently construct cluster states without the need for rerouting, thereby avoiding a massive amount of conditional dynamics; we furthermore show that except for a single layer of gates during the preparation, all subsequent operations can be shifted to the final adapted single-qubit measurements. Remarkably, cluster state preparation is achieved using essentially the same scaling in resources as if deterministic gates were available.

arXiv:quant-ph/0611140•Physical Review Letters•Sep 25, 2007•121 citations
Several physical architectures allow for measurement-based quantum computing using sequential preparation of cluster states by means of probabilistic quantum gates. In such an approach, the order in which partial resources are combined to form the final cluster state turns out to be crucially important. We determine the influence of this classical decision process on the expected size of the final cluster. Extending earlier work, we consider different quantum gates operating at various probabilites of success. For finite resources, we employ a computer algebra system to obtain the provably optimal classical control strategy and derive symbolic results for the expected final size of the cluster. We identify two regimes: when the success probability of the elementary gates is high, the influence of the classical control strategy is found to be negligible. In that case, other figures of merit become more relevant. In contrast, for small probabilities of success, the choice of an appropriate strategy is crucial.
We systematically investigate how to optimally build up cluster states for quantum computing with linear optical means using fusion gates, entirely from the perspective of classical control. We develop a notion of classical strategies and consider the globally optimal one to prepare linear cluster states with probabilistic gates. We find that this optimal strategy - which is also the most robust with respect to decoherence processes - gives rise to an advantage of already more than an order of magnitude in the number of maximally entangled pairs when building chains with an expected length of L=40, compared to other legitimate strategies. For two-dimensional cluster states, we present a first scheme achieving the optimal quadratic asymptotic scaling in resource consumption. This analysis shows that the choice of appropriate classical control leads to a very significant reduction in resource consumption.
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.
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.
There are numerous proposals for the physical realization of a quantum computer.However, distributed approaches, making use both of flying and stationary qubits, seem to constitute the most promising route towards a truly scalable device.Such systems guarantee extendibility, they incorporate the interface with communication applications and relax the physical realization of the device, allowing for defect tolerance.Flying qubits are included in the more general concept of a quantum bus, a mediating system which can be of higher dimension.Such a quantum bus can be used in the straightforward preparation of a standard multi-qubit resource enabling measurement based quantum computation, the cluster state.This constitutes the framework for the results presented in this thesis.We begin by investigating the effects of dissipation in the continuous variable bus scheme known as the qubus scheme.By considering loss in the bus as it mediates interactions between the stationary qubits, we obtain analytical results for the effective action of the induced quantum gate.We find that a particular two-qubit gate operates with high fidelity in the presence of moderate loss and give a simple iteration scheme to simplify the effects of loss on the qubits.We then attempt to reduce these effects by preparing the bus in more elaborate state, however no improvements are observed.We then apply the qubus scheme to the probabilistic generation of cluster states and develop an entangling gate working with high success probability.This allows us to produce cluster states far more efficiently than other proposals.Investigating new methods to analyze the performance of different generation strategies constitutes the second part of this set of results.We begin by making the large flow approximation, used in queuing theory, to obtain the optimal strategy in a regime with large resources.After what we take the other more familiar limit of single cluster growth and introduce absorbing Markov chains as a key mathematical tool.Finally we look at the transmission of composite quantum systems via a single higher dimensional bus.We provide generalized protocols and interactions guaranteeing a full transfer of the information from one composite system to another.These protocols can also serve information processing tasks, as useful logical operations can be applied to the data as it is transfered.We notice lastly that the qubus scheme constitutes a potential physical realization.
We address the question of how many maximally entangled photon pairs are needed to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily probabilistic with known optimal success probability, this question amounts to finding the optimal strategy for building up cluster states, from the perspective of classical control. We develop a notion of classical strategies and present rigorous statements on the ultimate maximal and minimal uses of resources of the globally optimal strategy. We find that this strategy--being also the most robust with respect to decoherence--gives rise to an advantage of already more than an order of magnitude in the number of maximally entangled pairs when building chains with an expected length of L=40, compared with other legitimate strategies. For two-dimensional cluster states, we present a first scheme achieving the optimal quadratic asymptotic scaling. This analysis shows that the choice of appropriate classical control leads to a significant reduction in resource consumption.
We apply a notion of static renormalization to the preparation of entangled states for quantum computing, exploiting ideas from percolation theory. Such a strategy yields a novel way to cope with the randomness of nondeterministic quantum gates. This is most relevant in the context of optical architectures, where probabilistic gates are common, and cold atoms in optical lattices, where hole defects occur. We demonstrate how to efficiently construct cluster states without the need for rerouting, thereby avoiding a massive amount of conditional dynamics; we furthermore show that except for a single layer of gates during the preparation, all subsequent operations can be shifted to the final adapted single-qubit measurements. Remarkably, cluster state preparation is achieved using essentially the same scaling in resources as if deterministic gates were available.