Related papers: Efficient graph state generation and artificial er…
A photonic cluster state with a tree-type entanglement structure constitutes an efficient resource for quantum error correction of photon loss. But the generation of a tree cluster state with an arbitrary size is notoriously difficult.…
The ability to create large highly entangled `cluster' states is crucial for measurement-based quantum computing. We show that deterministic multi-photon entanglement can be created from coupled solid state quantum emitters without the need…
Continuous-variable Gaussian cluster states are a potential resource for universal quantum computation. They can be efficiently and unconditionally built from sources of squeezed light using beam splitters. Here we report on the generation…
We propose a practical scheme for one-way quantum computing based on efficient generation of 2D cluster state in thermal cavities. We achieve a controlled-phase gate that is neither sensitive to cavity decay nor to thermal field by adding a…
We present results illustrating the construction of 3D topological cluster states with coherent state logic. Such a construction would be ideally suited to wave-guide implementations of quantum optical processing. We investigate the use of…
We present a novel way to manipulate ultra-cold atoms where four atomic levels are trapped by appropriately tuned optical lattices. When employed to perform quantum computation via global control, this unique structure dramatically reduces…
We propose a protocol to generate a stream of mobile qubits in a graph state through a single stationary parent qubit and discuss two types of its physical implementation, namely, the generation of photonic graph states through an atom-like…
While the advantages of photonic quantum computing, including direct compatibility with communication, are apparent, several imperfections such as loss and distinguishability presently limit actual implementations. These imperfections are…
The algorithm-specific graph and circuit etching are two strategies for compiling a graph state to implement quantum computation. Benchmark testing exposed limitations to the proto-compiler, Jabalizer giving rise to Etch…
In the one-way model of quantum computing, quantum algorithms are implemented using only measurements on an entangled initial state. Much of the hard work is done up-front when creating this universal resource, known as a cluster state, on…
Cluster states are key resources for measurement-based quantum information processing. Photonic cluster and graph states, in particular, play indispensable roles in quantum network and quantum metrology. We demonstrate a semiconductor…
We propose two schemes for the generation of the cluster states. One is based on cavity quantum electrodynamics (QED) techniques. The scheme only requires resonant interactions between two atoms and a single-mode cavity. The interaction…
As information carriers in quantum computing, photonic qubits have the advantage of undergoing negligible decoherence. However, the absence of any significant photon-photon interaction is problematic for the realization of non-trivial…
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 can be made robust…
A scheme for generating the cluster states via atomic ensembles is proposed. The scheme has inherent fault tolerance function and is robust to realistic noise and imperfections. All the facilities used in our scheme are well within the…
One of the critical elements in the realization of the quantum internet are deterministic two-photon gates. This $CZ$ photonic gate also completes a set of universal gates for all-optical quantum information processing. This article…
Entangled states of photons form the backbone of many quantum technologies. Due to the lack of effective photon-photon interactions, the generation of these states is typically probabilistic. In the prevailing but fundamentally limited…
Fusing small resource states into a larger, fully connected graph-state is essential for scalable photonic quantum computing. Theoretical analysis reveals that this can only be achieved when the success probability of the fusion gate…
We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for…
We present an entanglement generation scheme which allows arbitrary graph states to be efficiently created in a linear quantum register via an auxiliary entangling bus. The dynamics of the entangling bus is described by an effective…