Related papers: Type-I and Type-II Fusion Protocols for Weighted G…
This work studies how a suitably-designed classical system generates with a quantum-like (QL) state space mediated by a graph. The graph plays a special dual role by directing the topology of the classical network and defining a state space…
Cluster states and graph states in general offer a useful model of the stabilizer formalism and a path toward the development of measurement-based quantum computation. Their defining structure - the stabilizer group - encodes all possible…
Probabilistic entangling measurements are key operations in linear-optical quantum technologies, enabling the generation and manipulation of high-dimensional quantum states. While prior research has focused predominantly on specific…
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states and their applications in computing, networking, and sensing.…
By using highly entangled states, quantum metrology guarantees precision impossible with classical measurements. Unfortunately such states can be very susceptible to noise, and it is a great challenge of the field to maintain quantum…
Several entanglement measures are used to define equivalence classes in the set of hypergraph states of three qubits. Our classifications reveal that (i) under local unitary transformations, hypergraph states of three qubits are split into…
We propose schemes to extract arbitrary graph states from two-dimensional cluster states by locally manipulating the qubits solely via single-qubit measurements. We introduce graph state manipulation tools that allow one to increase the…
We use the concept of \textit{entangled graphs} with weighted edges to present a classification for four-qubit entanglement which is based neither on the LOCC nor the SLOCC. Entangled graphs, first introduced by Plesch et al. [Phys. Rev. A…
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite…
We introduce three compact graph states that can be used to perform a measurement-based Toffoli gate. Given a weighted graph of six, seven or eight qubits, we show that success probabilities of 1/4, 1/2 and 1 respectively can be achieved.…
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the…
Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However…
In recent years, the import of quantum information techniques in quantum gravity opened new perspectives in the study of the microscopic structure of spacetime. We contribute to such a program by establishing a precise correspondence…
One of the key aims of quantum networks is the efficient distribution of multipartite entangled states among end users. While various architectures have been proposed, each comes with distinct advantages and limitations. Many designs depend…
The framework of measurement-based quantum computation (MBQC) allows us to view the ground states of local Hamiltonians as potential resources for universal quantum computation. A central goal in this field is to find models with ground…
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…
As quantum computing technology slowly matures and the number of available qubits on a QPU gradually increases, interest in assessing the capabilities of quantum computing hardware in a scalable manner is growing. One of the key properties…
The construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we examine the impact of different graph structures on the…
Fault-tolerant quantum computation can be achieved by creating constant-sized, entangled resource states and performing entangling measurements on subsets of their qubits. Linear optical quantum computers can be designed based on this…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…