Related papers: Generation of graph-state streams
Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum Networks (QNs) can help address this challenge by enabling the construction of large, robust, and more capable quantum…
Graph states are a unique resource for quantum information processing, such as measurement-based quantum computation. Here, we theoretically investigate using continuous-variable graph states for single-parameter quantum metrology,…
We propose a scheme for efficient construction of graph states using realistic linear optics, imperfect photon source and single-photon detectors. For any many-body entanglement represented by tree graph states, we prove that the overall…
All-photonic quantum repeaters are essential for establishing long-range quantum entanglement. Within repeater nodes, reliably performing entanglement swapping is a key component of scalable quantum communication. To tackle the challenge of…
Extending a previous result on the generation of two-photon generalized binomial field states, here we propose an efficient scheme to generate with high-fidelity, in a single-mode high-Q cavity, N-photon generalized binomial states with a…
According to the Gottesman-Knill theorem, a class of quantum circuits, namely the so-called stabilizer circuits, can be simulated efficiently on a classical computer. We introduce a new algorithm for this task, which is based on the…
Quantum states of light, particularly at optical frequencies, are considered necessary to realize a host of important quantum technologies and applications, spanning Heisenberg-limited metrology, continuous-variable quantum computing, and…
A novel scheme is presented for generation of a multipartite W state for arbitrary number of qubits. Based on a recent proposal of entanglement without touching, it serves to demonstrate the potential of particle indistinguishability as a…
In this paper, we propose a new way to represent graphs in quantum space. In that approach, we replace the rows of the adjacency matrix of the graph by state vectors in the occupation number representation. Unlike the traditional definition…
We present a linear-optical scheme for generation of an arbitrary state of three qubits. It requires only three independent particles in the input and post-selection of the coincidence-type at the output. The success probability of the…
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…
Graph states are special kinds of multipartite entangled states that correspond to mathematical graphs where the vertices take the role of quantum spin systems and the edges represent interactions. They not only provide an efficient model…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
We show an optical wave-mixing scheme that generates quantum light by means of a single three-level atom. The atom couples to an optical cavity and two laser fields that together drive a cycling current within the atom. Weak driving in…
We propose a scheme to implement a two-qubit controlled-phase gate for single atomic qubits, which works in principle with nearly ideal success probability and fidelity. Our scheme is based on the cavity input-output process and the single…
Distributed quantum networks will allow users to perform tasks and to interact in ways which are not possible with present-day technology. Their implementation is a key challenge for quantum science and requires the development of…
An approach for generating the entangled photonic states |F1,F2>+|F2,F1> from two arbitrary states |F1> and |F2> is proposed. The protocol is implemented by the conditionally induced beam-splitter coupling which leads to the selective…
Early but promising results in quantum computing have been enabled by the concurrent development of quantum algorithms, devices, and materials. Classical simulation of quantum programs has enabled the design and analysis of algorithms and…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…
We propose a method to generate arbitrary symmetric states of N qubits, which can be easily associated with their entanglement classes. It is particularly suited to quantum optics systems like trapped ions or superconducting circuits. We…