Related papers: How to transform graph states using single-qubit o…
Fault-tolerant measurement-based quantum computation (MBQC) with recent progress on quantum technologies leads to a promising scalable platform for realizing quantum computation, conducted by preparing a large-scale graph state over 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…
Measurement-based quantum computing offers a promising route towards scalable, universal photonic quantum computation. This approach relies on the deterministic and efficient generation of photonic graph states in which many photons are…
Photonic GHZ states serve as the central resource for a number of important applications in quantum information science, including secret sharing, sensing, and fusion-based quantum computing. The use of photon-emitter entangling gates is a…
We study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and…
We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider…
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,…
Random circuit models often describe local dynamics using generic two-qubit gates, which have proven successful in capturing entanglement growth and operator spreading in many contexts. This approach naturally leads to the expectation that…
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,…
Graph states are versatile resources for quantum computation and quantum-enhanced measurement. Their generation illustrates a high level of control over entanglement. We report on the generation of continuous-variable graph states of atomic…
Quantum computing (QC) is a new computational paradigm whose foundations relate to quantum physics. Notable progress has been made, driving the birth of a series of quantum-based algorithms that take advantage of quantum computational…
We present an algorithm for efficiently simulating a quantum circuit in the graph formalism. In the graph formalism, we represent states as a linear combination of graphs with Clifford operations on their vertices. We show how a…
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…
Entanglement has evolved from an enigmatic concept of quantum physics to a key ingredient of quantum technology. It explains correlations between measurement outcomes that contradict classical physics, and has been widely explored with…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
We propose and demonstrate the scaling up of photonic graph state through path qubit fusion. Two path qubits from separate two-photon four-qubit states are fused to generate a two-dimensional seven-qubit graph state composed of polarization…
We consider the problem of transforming a given graph $G_s$ into a desired graph $G_t$ by applying a minimum number primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each…
Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…
In this work, we develop an efficient decoding method for graph codes, a class of stabilizer quantum error-correcting codes constructed from graph states. While optimal decoding is generally NP-hard, we propose a faster decoder exploiting…
We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by…