Cluster state preparation using gates operating at arbitrary success probabilities

@article{Kieling2007ClusterSP,
  title={Cluster state preparation using gates operating at arbitrary success probabilities},
  author={Konrad Kieling and David Gross and Jens Eisert},
  journal={New Journal of Physics},
  year={2007},
  volume={9},
  pages={200 - 200}
}
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… 

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

TLDR
The results indicate that strategies whereby one preferentially bonds together clusters of identical length are considerably more efficient than those in which one does not, and compared to earlier analytic results, this numerical study offers substantially improved resource scaling.

Fusing imperfect photonic cluster states

The ability to construct large photonic cluster states capable of supporting universal quantum computation relies on fusing together cluster primitives. These fusion operations are probabilistic and

Measurement-based quantum computation

Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics are harnessed and exploited. A number of models of quantum computation

Quantum Information Processing with Continuous Variables and Atomic Ensembles

This thesis presents three different results in quantum information theory. The first result addresses the theoretical foundations of quantum metrology. The Heisenberg limit considered as the

APPLICATIONS OF ATOMIC ENSEMBLES IN DISTRIBUTED QUANTUM COMPUTING

Thesis chapter. The fragility of quantum information is a fundamental constraint faced by anyone trying to build a quantum computer. A truly useful and powerful quantum computer has to be a robust

Using the qubus for quantum computing

TLDR
This thesis demonstrates that the qubus can generate cluster states deterministically, and in a relatively short time, and discusses several techniques of cluster state generation, one of which is optimal, given the physical architecture the authors are using.

Linear optics quantum computing - construction of small networks and asymptotic scaling

TLDR
In the small-scale regime various methods for constructing and analysing linear optics networks are presented and a direct construction from linear optics’ basic elements – beam splitters and phase shifters – will be considered, which can result in higher success probabilities and smaller resource consumption.

Integration of highly probabilistic sources into optical quantum architectures: perpetual quantum computation

In this paper, we introduce a design for an optical topological cluster state computer constructed exclusively from a single quantum component. Unlike previous efforts we eliminate the need for on

Growth of graph states in quantum networks

TLDR
It is shown that the fidelity of the generated graphs can be written as the partition function of a classical Ising-type Hamiltonian, and results for its decay rate in random graphs with arbitrary (uncorrelated) degree distributions.

Percolation in quantum computation and

Percolation theory is concerned with the behaviour of connected clusters in a random graph. Originally developed to mathematically describe random media, it has over the years matured to a field of

References

SHOWING 1-10 OF 27 REFERENCES

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

TLDR
The results indicate that strategies whereby one preferentially bonds together clusters of identical length are considerably more efficient than those in which one does not, and compared to earlier analytic results, this numerical study offers substantially improved resource scaling.

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

TLDR
For two-dimensional cluster states, it is shown that 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 is found.

Minimal resources for linear optical one-way computing

TLDR
It is found 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.

Probabilistic quantum logic operations using polarizing beam splitters

It has previously been shown that probabilistic quantum logic operations may be performed using linear optical elements, additional photons (ancilla), and post-selection based on the output of

Repeat-until-success quantum computing using stationary and flying qubits (14 pages)

We introduce an architecture for robust and scalable quantum computation using both stationary qubits (e.g., single photon sources made out of trapped atoms, molecules, ions, quantum dots, or defect

Efficient quantum computation with probabilistic quantum gates.

TLDR
With a combination of the quantum repeater and the cluster state approaches, it is shown that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p, where p is the number of qubits in the computation.

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

TLDR
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.

Upper bounds on success probabilities in linear optics

TLDR
An abstract way of defining linear-optics networks designed to perform quantum information tasks such as quantum gates is developed, which shows numerically and partially analytically for a wide class of states that the success probability of generating a NSS gate does not exceed 1/4, which to the authors' knowledge is the strongest bound to date.

Optimizing linear optics quantum gates.

  • J. Eisert
  • Mathematics
    Physical review letters
  • 2005
TLDR
It is shown that by exploiting this link, upper bounds for the success probability of networks realizing single-mode gates can be derived, which hold in generality for postselected networks of arbitrary size, any number of auxiliary modes, and arbitrary photon numbers.

Resource-efficient linear optical quantum computation.

TLDR
This work introduces a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons, and demonstrates the universality and usefulness of generic parity measurements.