Related papers: The integer quantum Hall transition: an $S$-matrix…
We consider the problem of a semiclassical description of quantum chaotic transport, when a tunnel barrier is present in one of the leads. Using a semiclassical approach formulated in terms of a matrix model, we obtain transport moments as…
Neural-network quantum states (NQS) offer a versatile and expressive alternative to traditional variational ans\"atze for simulating physical systems. Energy-based frameworks, like Hopfield networks and Restricted Boltzmann Machines,…
We study numerically conductance fluctuations near the integer quantum Hall effect plateau transition. The system is presumed to be in a mesoscopic regime, with phase coherence length comparable to the system size. We focus on a…
Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which is still far from being accomplished.…
Within the mature field of Anderson transitions, the critical properties of the integer quantum Hall transition still pose a significant challenge. Numerical studies of the transition suffer from strong corrections to scaling for most…
We consider the problem of quantum and classical phase transitions in double-layer quantum Hall systems at $\nu=1/m$ (m odd integers) from a long-wavelength statistical mechanics viewpoint. We derive an explicit mapping of the…
Critical properties of quantum Hall systems are affected by the presence of extra edge channels - present, in particular, at higher plateau transitions. We study this phenomenon for the case of the spin quantum Hall transition. Using…
Large-scale quantum networks with thousands of nodes require scalable network protocols and physical hardware to realize. In this work, we introduce packet switching as a new paradigm for quantum data transmission in both future and…
We investigate the quantum-state transfer on spin-chian channels with random imperfections.Through combining the advantages of two known schemes, the dual-rail spin-chain channels[9] and the particular ihhomogenous spin-chain channel[10],…
We present a novel approach to computing transition probabilities in quantum field theory, which allows them to be written directly in terms of expectation values of nested commutators and anti-commutators of field operators, rather than…
Randomness plays a key role in the design of attacks on cryptographic systems and cyber security algorithms in general. Random walks and quantum walks are powerful tools for mastering random phenomena. In this article, I propose a…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
Quantum-inspired algorithms can deliver substantial speedups over classical state-of-the-art methods by executing quantum algorithms with tensor networks on conventional hardware. Unlike circuit models restricted to unitary gates, tensor…
The purpose of network representation is to learn a set of latent features by obtaining community information from network structures to provide knowledge for machine learning tasks. Recent research has driven significant progress in…
The integration of quantum communication protocols over Ethernet networks is proposed, showing the potential of combining classical and quantum technologies for efficient, scalable quantum networking. By leveraging the inherent strengths of…
We discuss a model for the integer quantum Hall effect which is based on a Schroedinger-Chern-Simons-action functional for a non-interacting system of electrons in an electromagnetic field on a mutiply connected manifold. In this model the…
Quantum networks provide access to exchange of quantum information. The primary task of quantum networks is to distribute entanglement between remote nodes. Although quantum repeater protocol enables long distance entanglement distribution,…
Consider a Markov chain defined on a finite state space, X, that leaves invariant the uniform distribution on X, and whose transition probabilities are integer multiples of 1/Q, for some integer Q. I show how a simulation of n transitions…
The application of Tensor Networks (TN) in quantum computing has shown promise, particularly for data loading. However, the assumption that data is readily available often renders the integration of TN techniques into Quantum Monte Carlo…
We consider single-particle quantum transport on parametrized complex networks. Based on general arguments regarding the spectrum of the corresponding Hamiltonian, we derive bounds for a measure of the global transport efficiency defined by…