相关论文: Construction and Rigorous Analysis of Quantum-Like…
We use complex network theory to study a class of continuous-variable quantum states that present both multipartite entanglement and non-Gaussian statistics. We consider the intermediate scale of several dozens of components at which such…
This work is at the interface of graph theory and quantum mechanics. Quantum correlations epitomize the usefulness of quantum mechanics. Quantum discord is an interesting facet of bipartite quantum correlations. Earlier, it was shown that…
The hypergraph states are pure multipartite quantum states corresponding to a hypergraph. It is an equal superposition of the states belonging to the computational basis. Given any hypergraph, we can construct a hypergraph state determined…
A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ…
We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: Path erasure…
There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture…
The study of quantum cryptography and quantum entanglement has traditionally been based on two-level quantum systems (qubits) and more recently on three-level systems (qutrits). We investigate several classes of state-dependent quantum…
In previous work we have proposed a construction of quantum-like bits that could endow a large synchronizing classical system, for example of oscillators, with quantum-like function that is not compromised by decoherence. In the present…
We generalize the class of hypergraph states to multipartite systems of qudits, by means of constructions based on the d-dimensional Pauli group and its normalizer. For simple hypergraphs, the different equivalence classes under local…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
The Symmetric group $S_{n}$ manifests itself in large classes of quantum systems as the invariance of certain characteristics of a quantum state with respect to permuting the qubits. The subgroups of $S_{n}$ arise, among many other…
A common approach for analyzing hypergraphs is to consider the projected adjacency or Laplacian matrices for each order of interactions (e.g., dyadic, triadic, etc.). However, this method can lose information about the hypergraph structure…
We study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and…
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled…
In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a…
Recently, a novel GHZ/W graphical calculus has been established to study and reason more intuitively about interacting quantum systems. The compositional structure of this calculus was shown to be well-equipped to sufficiently express…