Related papers: Generation of graph-state streams
An experimental scheme is proposed for building massively multipartite entangled states using both the spatial and the frequency modes of an optical parametric oscillator. We provide analytical forms of the entangled states using the…
Generating entanglement between distant quantum systems is at the core of quantum networking. In recent years, numerous theoretical protocols for remote entanglement generation have been proposed, of which many have been experimentally…
Quantum networks with bipartite resources and shared randomness present the simplest infrastructure for implementing a future quantum internet. Here, we shall investigate which kinds of entanglement can or cannot be generated from this kind…
Implementing large instances of quantum algorithms requires the processing of many quantum information carriers in a hardware platform that supports the integration of different components. While established semiconductor fabrication…
A blow-up of $n$ copies of a graph $G$ is the graph $\overset{n}\uplus~G$ obtained by replacing every vertex of $G$ by an independent set of size $n$, where the copies of vertices in $G$ are adjacent in the blow-up if and only if the…
Multipartite entangled states are great resources for quantum networks. In this work we study the distribution, or routing, of entangled states over fixed, but arbitrary, physical networks. Our simplified model represents each use of a…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…
How to generate photonic cluster state or graph state efficiently is the main problem in optical measurement-based quantum computation. Assisted by the cross phase modulation technique, we propose an efficient scheme to realize the cascade…
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with…
We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
The graph state formalism is a useful abstraction of entanglement. It is used in some multipartite purification schemes and it adequately represents universal resources for measurement-only quantum computation. We focus in this paper on the…
We propose a robust deterministic scheme to generate entanglement at high fidelity without the need of photodetectors even for quantum bits, qubits, with extremely poor optically active states. Our protocol employs stimulated Raman…
We have investigated the heralded generation of two-qubit dual-rail-encoded states by programmable linear optics. Two types of schemes generating the states from four single photons, which is the minimal possible to accomplish the task,…
Quantum phase estimation is at the heart of most quantum algorithms with exponential speedup. In this letter we demonstrate how to utilize it to compute the dynamical response functions of many-body quantum systems. Specifically, we design…
Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing. Here we consider the question whether one graph (source) state can be transformed…
We investigate the implementation of photonic cluster state generation protocols using quantum metasurfaces comprising sub-wavelength atomic arrays which enables quantum-controlled reflectivity. These cluster states are generated using…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT). Our quantum algorithm delivers a super-quadratic speedup over the state-of-the-art quantum algorithm for…
The all-photonic quantum repeater scheme, utilizing a type of graph state called the repeater graph state (RGS), promises resilience to photon losses and operational errors, offering a fast Bell pair generation rate limited only by the RGS…