Related papers: Cluster states, algorithms and graphs
The bipartite graph structure has shown its promising ability in facilitating the subspace clustering and spectral clustering algorithms for large-scale datasets. To avoid the post-processing via k-means during the bipartite graph…
We propose models of quantum neural networks through Clifford algebras, which are capable of capturing geometric features of systems and to produce entanglement. Due to their representations in terms of Pauli matrices, the Clifford algebras…
We describe a procedure for graph state quantum computing that is tailored to fully exploit the physics of optically active multi-level systems. Leveraging ideas from the literature on distributed computation together with the recent work…
Transformers are increasingly employed for graph data, demonstrating competitive performance in diverse tasks. To incorporate graph information into these models, it is essential to enhance node and edge features with positional encodings.…
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…
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…
Following on our previous work arXiv:2204.07593 and arXiv:2306.01043 studying the orbits of quantum states under Clifford circuits via `reachability graphs', we introduce `contracted graphs' whose vertices represent classes of quantum…
The measurement based, or one-way, model of quantum computation for continuous variables uses a highly entangled state called a cluster state to accomplish the task of computing. Cluster states that are universal for computation are a…
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum…
Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all local-Clifford equivalent graph states---allows us to…
The stabilizer formalism for quantum error-correcting codes has been, without doubt, the most successful at producing examples of quantum codes with strong error-correcting properties. In this paper, we discuss strong automorphism groups of…
A set of necessary and sufficient conditions are derived for the equivalence of an arbitrary pure state and a graph state on n qubits under stochastic local operations and classical communication (SLOCC), using the stabilizer formalism.…
We investigate a novel class of quantum error correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum…
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…
Many protocols of quantum information processing, like quantum key distribution or measurement-based quantum computation, "consume" entangled quantum states during their execution. When participants are located at distant sites, these…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…
The quantum stabilizer formalism became foundational for understanding error correction soon after the realization of the first useful quantum error correction codes. Stabilizers provide a way to describe sets of quantum states which are…
We report an experimental realization of one-way quantum computing on a two-photon four-qubit cluster state. This is accomplished by developing a two-photon cluster state source entangled both in polarization and spatial modes. With this…