Related papers: Which graph states are useful for quantum informat…
Quantum graph state is a special class of nonlocal state among multiple quantum particles, underpinning several nonclassical and promising applications such as quantum computing and quantum secret sharing. Recently, establishing quantum…
Photonics offers a promising platform for implementations of measurement-based quantum computing. Recently proposed fusion-based architectures aim to achieve universality and fault-tolerance. In these approaches, computation is carried out…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
Graph states have been used to construct quantum error correction codes for independent errors. Hypergraph states generalize graph states, and symmetric hypergraph states have been shown to allow for the correction of correlated errors. In…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
One-way quantum computation, or measurement-based quantum computation, is a universal model of quantum computation alternative to the circuit model. The computation progresses by measurements of a pre-prepared resource state together with…
Recent work has exposed the idea that interesting quantum-like probability laws, including interference effects, can be manifest in classical systems. Here we propose a model for quantum-like (QL) states and QL bits. We suggest a way that…
Quantum random walks have been shown to be powerful quantum algorithms for certain tasks on graphs like database searching, quantum simulations etc. In this work we focus on its applications for the graph isomorphism problem. In particular…
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by…
The measurement-based architecture is a paradigm of quantum computing, relying on the entanglement of a cluster of qubits and the measurements of a subset of it, conditioning the state of the unmeasured output qubits. While methods to map…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
We present "Diagrams of States", a way to graphically represent and analyze how quantum information is elaborated during the execution of quantum circuits. This introductory tutorial illustrates the basics, providing useful examples of…
Among the models of quantum computation, the One-way Quantum Computer is one of the most promising proposals of physical realization, and opens new perspectives for parallelization by taking advantage of quantum entanglement. Since a…
Quantum discord refers to an important aspect of quantum correlations for bipartite quantum systems. In our earlier works we have shown that corresponding to every graph (combinatorial) there are quantum states whose properties are…
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…
In quantum computing and quantum information processing, graph states are a specific type of quantum states which are commonly used in quantum networking and quantum error correction. A recurring problem is finding a transformation from a…
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…
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
Hypergraph states are generalizations of graph states where controlled-$Z$ gates on edges are replaced with generalized controlled-$Z$ gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain…
GraphiQ is a versatile open-source framework for designing photonic graph state generation schemes, with a particular emphasis on photon-emitter hybrid circuits. Built in Python, GraphiQ consists of a suite of design tools, including…