English
Related papers

Related papers: Efficiency of quantum and classical transport on g…

200 papers

Many existing transductive bounds rely on classical complexity measures that are computationally intractable and often misaligned with empirical behavior. In this work, we establish new representation-based generalization bounds in a…

Machine Learning · Computer Science 2026-03-11 MoonJeong Park , Seungbeom Lee , Kyungmin Kim , Jaeseung Heo , Seunghyuk Cho , Shouheng Li , Sangdon Park , Dongwoo Kim

Efficient entanglement distribution is the foundational challenge in realizing large-scale Quantum Networks. However, state-of-the-art solutions are frequently limited by restrictive operational assumptions, prohibitive computational…

Since the initial development of one-dimensional electron gases (1DEG) two decades ago, there has been intense interest in both the fundamental physics and the potential applications, including quantum computation, of these quantum…

Mesoscale and Nanoscale Physics · Physics 2009-10-02 Raphael Rosen

We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. As local transport rules we consider random diffusion and an…

Statistical Mechanics · Physics 2015-06-24 Bosiljka Tadic , Stefan Thurner

Quantum transport properties through some multilevel quantum dots sandwiched between two metallic contacts are investigated by the use of Green's function technique. Here we do parametric calculations, based on the tight-binding model, to…

Mesoscale and Nanoscale Physics · Physics 2009-11-06 Santanu K. Maiti

We present evidence that anomalous transport in the classical standard map results in strong enhancement of fluctuations in the localization length of quasienergy states in the corresponding quantum dynamics. This generic effect occurs even…

chao-dyn · Physics 2009-10-31 Bala Sundaram , G. M. Zaslavsky

Interfacing quantum and classical processors is an important subroutine in full-stack quantum algorithms. The so-called "classical shadow" method efficiently extracts essential classical information from quantum states, enabling the…

Quantum Physics · Physics 2025-09-11 Shuowei Ma , Junyu Liu

Transport properties of the multicomponent quantum many-body systems obeying Haldane's fractional exclusion statistics are studied in one dimension. By computing the finite-size spectrum under twisted boundary conditions, we explicitly…

Condensed Matter · Physics 2009-10-28 T. Fukui , N. Kawakami

The exponential speed-up of quantum walks on certain graphs, relative to classical particles diffusing on the same graph, is a striking observation. It has suggested the possibility of new fast quantum algorithms. We point out here that…

Quantum Physics · Physics 2017-08-02 J. P. Keating , N. Linden , J. C. F. Matthews , A. Winter

We discuss recent developments in the study of quantum wavefunctions and transport in classically ergodic systems. Surprisingly, short-time classical dynamics leaves permanent imprints on long-time and stationary quantum behavior, which are…

chao-dyn · Physics 2009-08-14 L. Kaplan

Metros (heavy rail transit systems) are integral parts of urban transportation systems. Failures in their operations can have serious impacts on urban mobility, and measuring their robustness is therefore critical. Moreover, as physical…

Physics and Society · Physics 2015-05-27 Xiangrong Wang , Yakup Koç , Sybil Derrible , Sk Nasir Ahmad , Robert E. Kooij

In a previous paper, a project of constructing quantum models of classical properties has been started. The present paper concludes the project by turning to classical mechanics. The quantum states that maximize entropy for given averages…

Quantum Physics · Physics 2015-05-13 P. Hajicek

We develop a novel method for measuring the similarity between complete weighted graphs, which are probed by means of discrete-time quantum walks. Directly probing complete graphs using discrete-time quantum walks is intractable due to the…

Data Structures and Algorithms · Computer Science 2019-05-01 Lu Bai , Luca Rossi , Lixin Cui , Jian Cheng , Edwin R. Hancock

This work studies how a suitably-designed classical system generates with a quantum-like (QL) state space mediated by a graph. The graph plays a special dual role by directing the topology of the classical network and defining a state space…

Quantum Physics · Physics 2026-03-24 Gregory D. Scholes

We address continuous-time quantum walks on graphs in the presence of time- and space-dependent noise. Noise is modeled as generalized dynamical percolation, i.e. classical time-dependent fluctuations affecting the tunneling amplitudes of…

Quantum Physics · Physics 2019-01-10 Claudia Benedetti , Matteo A. C. Rossi , Matteo G. A. Paris

Quantum dynamics can be regarded as a generalization of classical finite-state dynamics. This is a familiar viewpoint for workers in quantum computation, which encompasses classical computation as a special case. Here this viewpoint is…

Quantum Physics · Physics 2015-09-01 Norman Margolus

Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…

Quantum Physics · Physics 2023-06-27 Duarte Magano , João Moutinho , Bruno Coutinho

Due to the unitary evolution, quantum walks display different dynamical features from that of classical random walks. In contrast to this expectation, in this work, we show that extreme events can arise in unitary dynamics and its…

Quantum Physics · Physics 2025-02-27 Nisarg Vyas , M. S. Santhanam

Quantum transport is strongly influenced by interference with phase relations that depend sensitively on the scattering medium. Since even small changes in the geometry of the medium can turn constructive interference to destructive, a…

Quantum Physics · Physics 2015-03-10 Stefano Mostarda , Federico Levi , Diego Prada-Gracia , Florian Mintert , Francesco Rao

We consider network models where information items flow %are sent from a source to a sink node. We start with a model where routing is constrained by energy available on nodes in finite supply (like in Smartdust) and efficiency is related…

Discrete Mathematics · Computer Science 2024-05-24 Pietro Cenciarelli , Daniele Gorla , Ivano Salvo
‹ Prev 1 4 5 6 7 8 10 Next ›