Related papers: Approximate quantum fractional revival in paths an…
The main purpose of thispaper is to show that composite quantum-like (QL) systems can closely mimic the separable states of quantum systems, and that suitable physical systems exhibiting these states exist. It is shown that QL graphs can…
We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (i, j), if i is connected to j then there is a path from j to i. We show that reversibility is a necessary and…
Recently it has been shown that interparticle interactions\emph ongenerically\emph default destroy dynamical localization in periodically driven systems, resulting in diffusive transport and heating. In this work we rigorously construct a…
We consider a one-parameter family of piecewise isometries of a rhombus. The rotational component is fixed, and its coefficients belong to the quadratic number field $K=\mathbb{Q}(\sqrt{2})$. The translations depend on a parameter $s$ which…
This work deals with quantum transport in open quantum graphs. We consider the case of complete graphs on $n$ vertices with an edge removed and attached to two leads, to represent the entrance and exit channels, from where we calculate the…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
In this Letter we make progress on a longstanding open problem of Aaronson and Ambainis [Theory of Computing 1, 47 (2005)]: we show that if A is the adjacency matrix of a sufficiently sparse low-dimensional graph then the unitary operator…
Quantum data re-uploading has proved powerful for classical inputs, where repeatedly encoding features into a small circuit yields universal function approximation. Extending this idea to quantum inputs remains underexplored, as the…
Continuous-time signals are well known for not being perfectly localized in both time and frequency domains. Conversely, a signal defined over the vertices of a graph can be perfectly localized in both vertex and frequency domains. We…
The phase shift rules enable the estimation of the derivative of a quantum state with respect to phase parameters, providing valuable insights into the behavior and dynamics of quantum systems. This capability is essential in quantum…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
In this paper we complete the analysis begun by two of the authors in a previous work on the discrete quantum walk on the line [J. Phys. A 36:8775-8795 (2003) quant-ph/0303105 ]. We obtain uniformly convergent asymptotics for the…
A blow-up of $n$ copies of a graph $G$ is the graph $\overset{n}\uplus~G$ obtained by replacing every vertex of $G$ by an independent set of size $n$, where the copies of vertices in $G$ are adjacent in the blow-up if and only if the…
We consider the problem of improving kernel approximation via randomized feature maps. These maps arise as Monte Carlo approximation to integral representations of kernel functions and scale up kernel methods for larger datasets. Based on…
We study the time it takes for all states of a finite quantum system to return simultaneously to their original configuration. In particular, we define the recurrence time for a quantum system to be the time at which all time-evolved states…
We study the dynamics of microscopic quantum correlations, viz., bipartite entanglement and quantum discord between nearest neighbor sites, in Ising spin chain with a periodically varying external magnetic field along the transverse…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
We make use of matrix representations of completely positive maps in order to study open quantum dynamics on graphs, with emphasis on quantum walks and the associated trajectories obtained via a monitoring of the position. We discuss the…
The exponential family of random graphs has been a topic of continued research interest. Despite the relative simplicity, these models capture a variety of interesting features displayed by large-scale networks and allow us to better…
Algebro-geometric methods have proven to be very successful in the study of graphical models in statistics. In this paper we introduce the foundations to carry out a similar study of their quantum counterparts. These quantum graphical…