Related papers: Strong quantum state transfer on graphs via loop e…
Quantum information is fragile and must be protected by a quantum error-correcting code for large-scale practical applications. Recently, highly efficient quantum codes have been discovered which require a high degree of spatial…
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…
The Quantum Internet is still in its infancy, yet identifying scalable and resilient quantum network resource states is an essential task for realizing it. We explore the use of graph states with flexible, non-trivial qubit-to-node…
Given a graph with Hermitian adjacency matrix $H$, perfect state transfer occurs from vertex $a$ to vertex $b$ if the $(b,a)$-entry of the unitary matrix $\exp(-iHt)$ has unit magnitude for some time $t$. This phenomenon is relevant for…
One of the strengths of quantum information theory is that it can treat quantum states without referring to their particular physical representation. In principle, quantum states can be therefore fully swapped between various quantum…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
Topological edge states are robust against symmetry-preserving perturbations and noise, making them promising for quantum information and computation, particularly in topological quantum computation through braiding operations of Majorana…
The formation of metallic nanofilaments bridging two electrodes across an insulator is a mechanism for resistive switching. Examples of such phenomena include atomic synapses, which constitute a distinct class of memristive devices whose…
We propose a quantum-state transfer protocol in a spin chain that requires only the control of the spins at the ends of the quantum wire. The protocol is to a large extent insensitive to inhomogeneity caused by local magnetic fields and…
This paper focuses on spectral graph convolutional neural networks (ConvNets), where filters are defined as elementwise multiplication in the frequency domain of a graph. In machine learning settings where the dataset consists of signals…
We consider the state transfer properties of continuous time quantum walks on trees of diameter 4. We characterize all pairs of strongly cospectral vertices in trees of diameter 4, finding that they fall into pairs of three different types.…
Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a…
Quantum networks are essential to quantum information distributed applications, and communicating over them is a key challenge. Complex networks have rich and intriguing properties, which are as yet unexplored in the quantum setting. Here,…
Scattering transforms are non-trainable deep convolutional architectures that exploit the multi-scale resolution of a wavelet filter bank to obtain an appropriate representation of data. More importantly, they are proven invariant to…
Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states…
In this paper, we propose a perturbation framework to measure the robustness of graph properties. Although there are already perturbation methods proposed to tackle this problem, they are limited by the fact that the strength of the…
Quantum network is the key to enable distributed quantum information processing. As the single-link communication rate decays exponentially with the distance, to enable reliable end-to-end quantum communication, the number of nodes needs to…
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…
We characterize perfect state transfer on real-weighted graphs of the Johnson scheme $\mathcal{J}(n,k)$. Given $\mathcal{J}(n,k)=\{A_1, A_2, \cdots, A_k\}$ and $A(X) = w_0A_0 + \cdots + w_m A_m$, we show, using classical number theory…
We consider pretty good state transfer in coined quantum walks between antipodal vertices on the hypercube $Q_d$. When $d$ is a prime, this was proven to occur in the arc-reversal walk with Grover coins. We extend this result by…