Related papers: Persistent Quantum Memory in Iterated Lifts
Decoherence phenomenon has been widely studied in different types of quantum walks. In this work we show how to model decoherence inspired by percolation on staggered quantum walks. Two models of unitary noise are described: breaking…
We present Quantum Graph Hash (QGH-256), a novel quantum spectral hashing algorithm that generates high-entropy fingerprints from message-induced graphs. Each input message is mapped to a weighted graph via a discrete random walk on an n X…
We demonstrate the coherent transport of two-dimensional (2D) arrays of small ensembles of neutral atoms in a shift register architecture based on 2D arrays of microlenses. We show the scalability of the transport process by presenting the…
We establish a direct connection between the power of a unitary map in $d$-dimensions ($d<\infty$) to generate quantum coherence and the geometry of the set ${\cal M}_d$ of maximally abelian subalgebras (of the quantum system full operator…
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 study the coherent transport modeled by continuous-time quantum walks, focussing on hierarchical structures. For these we use Husimi cacti, lattices dual to the dendrimers. We find that the transport depends strongly on the initial site…
Quantum mechanics features a variety of distinct properties such as coherence and entanglement, which could be explored to showcase potential advantages over classical counterparts in information processing. In general, legitimate quantum…
Financial markets are noisy yet contain a latent graph-theoretic structure that can be exploited for superior risk-adjusted returns. We propose a quantum stochastic walk (QSW) optimizer that embeds assets in a weighted graph: nodes…
In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from…
We show that quantum measures and integrals appear naturally in any $L_2$-Hilbert space $H$. We begin by defining a decoherence operator $D(A,B)$ and it's associated $q$-measure operator $\mu (A)=D(A,A)$ on $H$. We show that these operators…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
This paper encompasses a super helical memory system's design, 'Boolean logic & image-logic' as a theoretical concept of an invention-model to 'store time-data' in terms of anticipating the best memory location ever for data/time. A…
Irreversibility is introduced to quantum graphs by coupling the graphs to a bath of harmonic oscillators. The interaction which is linear in the harmonic oscillator amplitudes is localized at the vertices. It is shown that for sufficiently…
This is the second paper in a series of two. Using a multi-particle continuous-time quantum walk with two internal states, which has been formulated in the first paper (arXiv:2112.08119), we physically implement a quantum random access…
In holonomic quantum computation, quantum logic gates are realized by cyclic parallel transport of the computational space. The resulting quantum gate corresponds to the holonomy associated with the closed path traced by the computational…
This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing $\sigma$, the complete graph $K^\sigma_n$ has probabilistic uniform mixing. In contrast, Ahmadi \etal (2003) proved that no complete…
We define a modification of LQG in which graphs are required to consist in piecewise linear edges, which we call piecewise linear LQG (plLQG). At the diffeomorphism invariant level, we prove that plLQG is equivalent to standard LQG, as long…
A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distribution after N steps is determined by reshuffling the first N distributions that arise in a classical random walk with the same initial…
We study when block-coupled regular graphs can realize prescribed complex quantum-like bit states as exact synchronized eigenstates. Two regular subgraphs $G_A$ and $G_B$ supply normalized all-ones eigenvectors $V_A$ and $V_B$, and…
As an analogy of fully entangled fraction in the framework of entanglement theory, we have introduced the notion of quantum coherence fraction $C_{\mathcal{F}}$, which quantifies the closeness between a given state and the set of maximally…