Related papers: Potential and limits to cluster state quantum comp…
We address the question of how many maximally entangled photon pairs are needed in order to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily…
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…
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…
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 non-deterministic quantum…
Cluster states are a useful resource in quantum computation, and can be generated by applying entangling gates between next-neighbor qubits. Heralded entangling gates offer the advantage of high post-selected fidelity, and can be used to…
We propose an efficient scheme for constructing arbitrary 2-D cluster states using probabilistic entangling quantum gates.In our scheme, the 2-D cluster state is constructed with star-like basic units generated from 1-D cluster chains.By…
The creation of complex entangled states, resources that enable quantum computation, can be achieved via simple 'probabilistic' operations which are individually likely to fail. However, typical proposals exploiting this idea carry a severe…
We report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon-photon entangling…
We propose a new measure of non-classicality of quantum gates which is particularly suitable for probabilistic devices. This measure enables to compare, e.g., deterministic devices which prepare entangled states with low amount of…
We propose and study a method for using non-maximally entangled states to implement probabilistically non-local gates. Unlike distillation-based protocols, this method does not generate a maximally entangled state at intermediate stages of…
The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86 (22), 5188-5191 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive…
Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure…
The cluster state, the highly entangled state that is the central resource for one-way quantum computing, can be efficiently generated in a variety of physical implementations via global nearest-neighbor interactions. In practice, a…
We develop the probabilistic implementation of a nonlocal gate $\exp{[i\xi{\sigma_{n_A}}\sigma_{n_B}]}$ and $\xi\in[0,\frac\pi4]$, by using a single non-maximally entangled state. We prove that, nonlocal gates can be implemented with a…
We introduce 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. We achieve a much greater degree of efficiency and a…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
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…
Protocols for distributed quantum systems commonly require the simultaneous availability of $n$ entangled states, each with a fidelity above some fixed minimum $F_{\mathrm{app}}$ relative to the target maximally-entangled state. However,…
Fault-tolerant quantum computation can be achieved by creating constant-sized, entangled resource states and performing entangling measurements on subsets of their qubits. Linear optical quantum computers can be designed based on this…
We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be…