Related papers: Distributing Arbitrary Quantum Graph States by Gra…

Two schemes for sharing an arbitrary two-qubit state based on entanglement swapping are proposed with Bell-state measurements and local unitary operations. One is based on the quantum channel with four Einstein-Podolsky-Rosen (EPR) pairs…

Fathoming out quantum state space is a challenging endeavor due to its exponentially growing dimensionality. At the expense of being bound in its expressiveness, the discrete and finite subspace of graph states is easier to investigate via…

In a recent work, Markham and Sanders have proposed a framework to study quantum secret sharing (QSS) schemes using graph states. This framework unified three classes of QSS protocols, namely, sharing classical secrets over private and…

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…

Random quantum circuits take an input quantum state and randomize it. This is a task with a growing number of identified uses in quantum information processing. We suggest a scheme to implement random circuits in a weighted graph state. The…

We consider entanglement swapping, a key component of quantum network operations and entanglement distribution. Pure entangled states, which are the desired input to the swapping protocol, are typically mixed by environmental interactions…

Hypergraph states, a generalization of graph states, constitute a large class of quantum states with intriguing non-local properties and have promising applications in quantum information science and technology. In this paper, we generalize…

Graph states and their entanglement properties are pivotal for the development of quantum computing and technologies. For qubits, local complementation, a graphical rule that connects all the equivalent states under Local Clifford (LC)…

Image-based data is a popular arena for testing quantum machine learning algorithms. A crucial factor in realizing quantum advantage for these applications is the ability to efficiently represent images as quantum states. Here we present a…

We present protocols to generate arbitrary photonic graph states from quantum emitters that are in principle deterministic. We focus primarily on two-dimensional cluster states of arbitrary size due to their importance for measurement-based…

Quantum networks are of great interest of late which apply quantum mechanics to transfer information securely. One of the key properties which are exploited is entanglement to transfer information from one network node to another.…

Using the signed laplacian matrix, and weighted and hybrid graphs, we present additional ways to interpret graphs as grid states. Hybrid graphs offer the most general interpretation. Existing graphical methods that characterize entanglement…

We show that non-maximally entangled states can be used to build a quantum key distribution (QKD) scheme whose security and key rate transmission is nearly equivalent to those of standard QKD protocols. These aspects can be controlled by…

By encoding logical qubits into specific types of photonic graph states, one can realize quantum repeaters that enable fast entanglement distribution rates approaching classical communication. However, the generation of these photonic graph…

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…

Quantum entanglement assisted with measurements provides various pathways to communicate information to parties within a network. In this work, we generalize a previous broadcasting protocol and present schemes to broadcast product and…

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…

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…

Distributed quantum computing relies on coordinated operations between remote quantum processing units (QPUs), yet most existing work either assumes full connectivity, unrealistic for large networks, or relies on entanglement swapping. To…

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.…