Related papers: Perfect edge state transfer on cubelike graphs
We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon…
In this paper, we characterize perfect state transfer in Cayley graphs for abelian groups that have a cyclic Sylow-2-subgroup. This generalizes a result of Ba\v{s}i\'c from 2013 where he provides a similar characterization for Cayley graphs…
We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in…
Distributed quantum communication and quantum computing offer many new opportunities for quantum information processing. Here networks based on highly nonlocal quantum resources with complex entanglement structures have been proposed for…
The transfer of information from one part of a quantum system to another is fundamental to the understanding and design of quantum information processing devices. In the realm of discrete systems such as spin chains, inhomogeneous networks…
Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements…
We show that a perfect quantum state transmission can be realized through a spin chain possessing a commensurate structure of energy spectrum, which is matched with the corresponding parity. As an exposition of the mirror inversion symmetry…
Ballistic quantum-information transfer through spin chains is based on the idea of making the spin dynamics ruled by collective excitations with linear dispersion relation. Unlike perfect state transfer schemes, a ballistic transmission…
In 2018, Chen and Godsil proposed the concept of Laplacian perfect pair state transfer which is a brilliant generalization of Laplacian perfect state transfer. In this paper, we study the existence of Laplacian perfect pair state transfer…
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…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
In this paper, we study quantum walks on the extension of association schemes. Various state transfers can be achieved on these graphs, such as multiple state transfer among extreme points of a simplex, fractional revival on subsimplexes.…
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…
Photonic GHZ states serve as the central resource for a number of important applications in quantum information science, including secret sharing, sensing, and fusion-based quantum computing. The use of photon-emitter entangling gates is a…
Absolutely maximally entangled (AME) states are multipartite entangled states that are maximally entangled for any possible bipartition. In this paper, we study the description of AME states within the graph state formalism. The graphical…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
We propose to use ferromagnetic systems for entanglement generation and distribution together with perfect state transfer between distant parties in a qubit chain. The scheme relies on an effective 2-qubit dynamics, realized by leaving two…
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
We prove that the empirical density of states of quantum spin glasses on arbitrary graphs converges to a normal distribution as long as the maximal degree is negligible compared with the total number of edges. This extends the recent…
Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a…