Related papers: Spatiotemporal graph states from a single optical …
Entangled qudits, the high-dimensional entangled states, play an important role in the study of quantum information. How to prepare entangled qudits in an efficient and easy-to-operate manner is still a challenge in quantum technology.…
Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a…
Starting from deformed quantum Heisenberg Lie algebras some realizations are given in terms of the usual creation and annihilation operators of the standard harmonic oscillator. Then the associated algebra eigenstates are computed and give…
Graph states are the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-state generation scheme using a single quantum emitter and…
Distributed quantum communication and quantum computing offer many new opportunities for quantum information processing. Here networks based on highly nonlocal quantum resources with complex entanglement structures have been proposed for…
The ability to efficiently characterize the spatial correlations of entangled states of light is critical for applications of many quantum technologies such as quantum imaging. Here, we demonstrate highly efficient theoretical and…
Cluster states are an essential component in one-way quantum computation protocols. We present two schemes to generate addressable continuous-variable cluster states from quadrature squeezed cylindrically polarized modes. By including…
We address the question of quantifying entanglement in pure graph states. Evaluation of multipartite entanglement measures is extremely hard for most pure quantum states. In this paper we demonstrate how solving one problem in graph theory,…
A stochastic simulation algorithm for the computation of multitime correlation functions which is based on the quantum state diffusion model of open systems is developed. The crucial point of the proposed scheme is a suitable extension of…
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…
We investigate the entanglement of the ground state in the quantum networks that their nodes are considered as quantum harmonic oscillators. To this aim, the Schmidt numbers and entanglement entropy between two arbitrary partitions of a…
Diagrammatic summation is a common bottleneck in modern applications of projected entangled-pair states, especially in computing low-energy excitations of a two-dimensional quantum many-body system. To solve this problem, here we extend the…
We demonstrate that a tensor product structure and optical analogy of quantum entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical analogy, we discuss…
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…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
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…
The linear optical creation of Gaussian cluster states, a potential resource for universal quantum computation, is investigated. We show that for any Gaussian cluster state, the canonical generation scheme in terms of QND-type interactions,…
The full Schmidt decomposition of spatiotemporally entangled states generated from spontaneous parametric down-conversion (SPDC) has not been carried out until now due to the immense computational complexity arising from the large…
We introduce a connection between a near-term quantum computing device, specifically a Gaussian boson sampler, and the graph isomorphism problem. We propose a scheme where graphs are encoded into quantum states of light, whose properties…
Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum…