Related papers: Distributing Arbitrary Quantum Graph States by Gra…
We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any…
This paper introduces an efficient quantum computing method for reducing special graphs in the context of the graph coloring problem. The special graphs considered include both symmetric and non-symmetric graphs where the axis passes…
Weighted graph states are a natural generalization of graph states, which are generated by applying controlled-phase gates, instead of controlled-Z gates, to a separable state. In this paper, we show that uniformly weighted graph states on…
In this work, we explore graph partitioning (GP) using quantum annealing on the D-Wave 2X machine. Motivated by a recently proposed graph-based electronic structure theory applied to quantum molecular dynamics (QMD) simulations, graph…
Hyperentangled states are highly efficient and resource economical. This is because they enhance the quantum information encoding capabilities due to the correlated engagement of more than one degree of freedom of the same quantum entity…
Graph states are a special kind of multiparticle entangled state with great potential for applications in quantum information technologies, especially in measurement-based quantum computers. These states cause significant reductions of the…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
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…
The graph state formalism is a useful abstraction of entanglement. It is used in some multipartite purification schemes and it adequately represents universal resources for measurement-only quantum computation. We focus in this paper on the…
We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures -- we refer to it as entanglement circulation. The procedure involves optimization…
Graph states are a fundamental class of multipartite entangled quantum states with wide-ranging applications in quantum information and computation. In this work, we develop a systematic framework for constructing and analyzing…
Multi-qubit quantum states corresponding to bipartite graphs $G(U,V,E)$ are examined. These states are constructed by applying $CNOT$ gates to an arbitrary separable multi-qubit quantum state. The entanglement distance of the resulting…
We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…
Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how…
Distributing entanglement among multiple users is a fundamental problem in quantum networks, requiring an efficient solution. In this work, a protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in…
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 study the entanglement properties of randomized mixed hypergraph states, extending the concept of randomized mixed graph states to encompass hypergraph-based quantum states. In our model, imperfect generalized multi-qubit gates are…
Measurement-Based Quantum Computing (MBQC) is inherently well-suited for Distributed Quantum Computing (DQC): once a resource state is prepared and distributed across a network of quantum nodes, computation proceeds through local…
We investigate the entanglement properties of quantum states associated with directed graphs. Using a measure derived from the Fubini-Study metric, we quantitatively relate multipartite entanglement to the local connectivity of the graph.…
We propose a method to calculate the purity of reduced states of graph states entirely within the stabilizer formalism, using only the stabilizer generators for a given state. We apply this method to find the Concentratable Entanglement of…