相关论文: Construction and Rigorous Analysis of Quantum-Like…
Hypergraph states are a special kind of multipartite states encoded by hypergraphs. They play a significant role in quantum error correction, measurement--based quantum computation, quantum non locality and entanglement. In a series of two…
Connectedness and bipartiteness are basic properties of classical graphs, and the purpose of this paper is to investigate the case of quantum graphs. We introduce the notion of connectedness and bipartiteness of quantum graphs in terms of…
Circle graph states are a structurally important family of graph states. The family's entanglement is a priori high enough to allow for universal measurement-based quantum computation (MBQC); however, MBQC on circle graph states is actually…
We develop two approaches to Quantum (or Non-commutative) Graphs based on arbitrary von Neumann algebras $M\subseteq\mathcal B(H)$: one looking at operator bimodules of Hilbert--Schmidt (instead of bounded) operators, and the second looking…
We study wave function structure for quantum graphs in the chaotic and disordered regime, using measures such as the wave function intensity distribution and the inverse participation ratio. The result is much less ergodicity than expected…
We present a protocol for generating multiqubit quantum states with translationally invariant pairwise entanglement. Our approach is tailored for digital quantum computers with restricted qubit connectivity, a common limitation in…
Entanglement is a crucial resource for quantum information processing, and so protocols to generate high fidelity entangled states on various hardware platforms are in demand. While spin chains have been extensively studied to generate…
We present an efficient algorithm for generating unitary maps on a $d$-dimensional Hilbert space from a time-dependent Hamiltonian through a combination of stochastic searches and geometric construction. The protocol is based on the…
A $k$-pairable $n$-qubit state is a resource state that allows Local Operations and Classical Communication (LOCC) protocols to generate EPR-pairs among any $k$-disjoint pairs of the $n$ qubits. Bravyi et al. introduced a family of…
We develop a theory of quantum sufficiency on real *-subalgebras and real Jordan algebras. In contrast to the conventional formulation, which is based on families of states, complex completely positive coarse-grainings, and Radon-Nikodym…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over…
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states and their applications in computing, networking, and sensing.…
The multiphoton algebras for one-dimensional Hamiltonians with infinite discrete spectrum, and for their associated kth-order SUSY partners are studied. In both cases, such an algebra is generated by the multiphoton annihilation and…
Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing. Here we consider the question whether one graph (source) state can be transformed…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…
Given a finite group G with a bilocal representation, we investigate the bipartite entanglement in the state constructed from the group algebra of G acting on a separable reference state. We find an upper bound for the von Neumann entropy…
Quantum communication between distant parties is based on suitable instances of shared entanglement. For efficiency reasons, in an anticipated quantum network beyond point-to-point communication, it is preferable that many parties can…
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…