Related papers: Loop Charges and Fragmentation in Pairwise Differe…
Spin-charge separation (SCS) is a striking manifestation of strong correlations in low-dimensional quantum systems, whereby a fermion splits into separate spin and charge excitations that travel at different speeds. Here, we demonstrate…
Low-depth parity check (LDPC) codes are a paradigm of error correction that allow for spatially non-local interactions between (qu)bits, while still enforcing that each (qu)bit interacts only with finitely many others. On expander graphs,…
Lattice gas cellular automata (Lgca) are particular cellular automata that imitate the behavior of par- ticles moving on a lattice. We used a particular set of Lgca rules, called hpp, to mix bits in data blocks and obtain a symmetric…
We introduce a binary embedding framework, called Proximity Preserving Code (PPC), which learns similarity and dissimilarity between data points to create a compact and affinity-preserving binary code. This code can be used to apply fast…
Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds…
Photonic implementations of unitary processes on lattice structures, such as quantum walks, have been demonstrated across various architectures. However, few platforms offer the combined advantages of scalability, reconfigurability, and the…
We investigate critical properties of a class of number-conserving cellular automata (CA) which can be interpreted as deterministic models of traffic flow with anticipatory driving. These rules are among the only known CA rules for which…
This work focuses on optimizing the gates of a quantum circuit with a given topology to approximate the unitary time evolution governed by a Hamiltonian. Recognizing that unitary matrices form a mathematical manifold, we employ Riemannian…
We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasi-cyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
It has been shown that superconducting domain walls in a model with U(1) x Z2 symmetry can form long-lived loops called kinky vortons from random initial conditions in the broken field and a uniform charged background in (2+1) dimensions.…
The Hermiticity axiom of quantum mechanics guarantees that the energy spectrum is real and the time evolution is unitary (probability-preserving). Nevertheless, non-Hermitian but $\mathcal{PT}$-symmetric Hamiltonians may also have real…
The length-constrained cycle partition problem (LCCP) is a graph optimization problem in which a set of nodes must be partitioned into a minimum number of cycles. Every node is associated with a critical time and the length of every cycle…
In a recent article, we have advanced a semiclassical theory of quantum circuits with discrete charge and electrical resistance. In this work, we present a few elementary applications of this theory. For the zero resistance, inductive…
Quantum walks are more than tools for building quantum algorithms. They have been used effectively to model and simulate quantum dynamics in many complex physical processes. Particularly, a variant of discrete-time quantum walk known as…
The charge spin-separation, pseudogap formation and phase diagrams are studied in two and four site Hubbard clusters using analytical diagonalization and grand canonical ensemble method in a multidimensional parameter space of temperature,…
We report on investigations of local (and non-local) charges in bosonic and supersymmetric principal chiral models in 1+1 dimensions. In the bosonic PCM there is a classically conserved local charge for each symmetric invariant tensor of…
Interacting many-body systems with explicitly accessible spatio-temporal correlation functions are extremely rare, especially in the absence of integrability. Recently, we identified a remarkable class of such systems and termed them…
We demonstrate the existence of a universal phase diagram of quantum chains with range-$k$ interactions subject to the conservation of a total charge and its dipole moment. These systems exhibit "freezing" transitions between strongly and…
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams…