Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

NATO ASI series. Series B : Physics

Classical and Quantum, Lattice and Continuum Percolation

James L. Skinner, Jeffery G. Saven, J. R. Wright, Leslie J. Root

Published Jan 1, 1991• 0 citations
Publisher
DOI
10.1007/978-1-4684-5940-1_8

Related papers

Percolation of interacting classical dimers on the square lattice

Yang Li, WU Da-yan, Xianshan Huang +1 more

Physica A Statistical Mechanics and its Applications•Mar 6, 2014•2 citations

Quantum k-core Percolation on the Bethe Lattice

Lushuai Cao, Jennifer M. Schwarz

Bulletin of the American Physical Society•Mar 18, 2010•0 citations

Quantum Theory of Percolation.

K. C. Chang

•Sep 1, 1987•1 citation

Quantum percolation and transition point of a directed discrete-time quantum walk

C. M. Chandrashekar, Thomas Busch

Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson localisation. Here, we consider a directed discrete-time quantum walk as a model to study quantum percolation of a two-state particle on a two-dimensional lattice. Using numerical analysis we determine the fraction of connected edges required (transition point) in the lattice for the two-state particle to percolate with finite (non-zero) probability for three fundamental lattice geometries, finite square lattice, honeycomb lattice, and nanotube structure and show that it tends towards unity for increasing lattice sizes. To support the numerical results we also use a continuum approximation to analytically derive the expression for the percolation probability for the case of the square lattice and show that it agrees with the numerically obtained results for the discrete case. Beyond the fundamental interest to understand the dynamics of a two-state particle on a lattice (network) with disconnected vertices, our study has the potential to shed light on the transport dynamics in various quantum condensed matter systems and the construction of quantum information processing and communication protocols.

arXiv:1303.7013•Scientific Reports•Oct 10, 2014•39 citations

Classical and quantum continuum percolation with hard core interactions

Jeffery G. Saven, James L. Skinner, J. R. Wright

We study the classical and quantum percolation of spheres in a three-dimensional continuum. Each sphere has an impenetrable hard core of diameter σ, and two spheres are considered to be directly connected if the distance between their centers is less than d. We calculate the critical percolation density as a function of σ/d. In the classical problem this is the density ρc at which an infinite cluster of connected spheres first forms. In the quantum problem, we study a tight-binding model where the hopping matrix element between two spheres is nonzero only if they are directly connected. In this case the critical density ρq is the density at which the eigenstates of the Hamiltonian first become extended. Our method uses Monte Carlo simulation and finite-size scaling techniques, and for the quantum problem, the concept of quantum connectivity. We find that both ρc and ρq exhibit nonmonotonic behavior as a function of σ/d. We also find that for all values of σ/d, ρq>ρc, although the ratio of the thresholds decreases with increasing σ/d. We argue that a better understanding of this ratio is obtained by considering the average coordination number. We speculate about the nature of both classical and quantum percolation as σ/d approaches 1.

The Journal of Chemical Physics•May 1, 1991•16 citations

Quantum correlated percolation

Liang Cao, M. Jeng, Jennifer M. Schwarz

Bulletin of the American Physical Society•Mar 18, 2009•0 citations
Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson localisation. Here, we consider a directed discrete-time quantum walk as a model to study quantum percolation of a two-state particle on a two-dimensional lattice. Using numerical analysis we determine the fraction of connected edges required (transition point) in the lattice for the two-state particle to percolate with finite (non-zero) probability for three fundamental lattice geometries, finite square lattice, honeycomb lattice, and nanotube structure and show that it tends towards unity for increasing lattice sizes. To support the numerical results we also use a continuum approximation to analytically derive the expression for the percolation probability for the case of the square lattice and show that it agrees with the numerically obtained results for the discrete case. Beyond the fundamental interest to understand the dynamics of a two-state particle on a lattice (network) with disconnected vertices, our study has the potential to shed light on the transport dynamics in various quantum condensed matter systems and the construction of quantum information processing and communication protocols.
We study the classical and quantum percolation of spheres in a three-dimensional continuum. Each sphere has an impenetrable hard core of diameter σ, and two spheres are considered to be directly connected if the distance between their centers is less than d. We calculate the critical percolation density as a function of σ/d. In the classical problem this is the density ρc at which an infinite cluster of connected spheres first forms. In the quantum problem, we study a tight-binding model where the hopping matrix element between two spheres is nonzero only if they are directly connected. In this case the critical density ρq is the density at which the eigenstates of the Hamiltonian first become extended. Our method uses Monte Carlo simulation and finite-size scaling techniques, and for the quantum problem, the concept of quantum connectivity. We find that both ρc and ρq exhibit nonmonotonic behavior as a function of σ/d. We also find that for all values of σ/d, ρq>ρc, although the ratio of the thresholds decreases with increasing σ/d. We argue that a better understanding of this ratio is obtained by considering the average coordination number. We speculate about the nature of both classical and quantum percolation as σ/d approaches 1.