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

Nature

Particle distinguishability

Bernard H. Lavenda

Published Jan 1, 1988• 3 citations
Publisher
DOI
10.1038/331308b0

Related papers

Noninteracting multiparticle quantum random walks applied to the graph isomorphism problem for strongly regular graphs

Kenneth Rudinger, John King Gamble, M. Wellons +4 more

We investigate the quantum dynamics of particles on graphs (``quantum random walks''), with the aim of developing quantum algorithms for determining if two graphs are isomorphic (related to each other by a relabeling of vertices). We focus on quantum random walks of multiple noninteracting particles on strongly regular graphs (SRGs), a class of graphs with high symmetry that is known to have pairs of graphs that are hard to distinguish. Previous work has already demonstrated analytically that two-particle noninteracting quantum walks cannot distinguish nonisomorphic SRGs of the same family. Here, we demonstrate numerically that three-particle noninteracting quantum walks have significant, but not universal, distinguishing power for pairs of SRGs, proving a fundamental difference between the distinguishing power of two-particle and three-particle noninteracting walks. We show analytically why this distinguishing power is possible, whereas it is forbidden for two-particle noninteracting walks. Based on sampling of SRGs with up to 64 vertices, we find no difference in the distinguishing power of bosonic and fermionic walks. In addition, we find that the four-fermion noninteracting walk has greater distinguishing power than the three-particle walk on SRGs, showing that increasing the particle number increases the distinguishing power. However, we also show analytically that no noninteracting walk with a fixed number of particles can distinguish all SRGs, thus demonstrating a potential fundamental difference in the distinguishing power of interacting versus noninteracting walks.

arXiv:1206.2999•Physical Review A•Aug 27, 2012•42 citations

The Transient Distinguishability of Identical Particles

Claudio Zamitti Mammana

Physics Essays•Dec 1, 1997•1 citation

Quantum Statistics for Distinguishable Particles

J. Tersoff, David Bayer

Quantum statistics can be reconciled with such classical ideas as distinguishable particles. Bose-Einstein and Fermi-Dirac statistics are derived for distinguishable particles by making an assumption regarding probabilities which is different from the traditional assumption but equally reasonable.

Physical Review Letters•Feb 21, 1983•68 citations

Single-Particle Properties

Springer eBooks•Jan 1, 2007•0 citations

Distinguishable- and indistinguishable-particle descriptions of systems of identical particles

Willem M. de Muynck

International Journal of Theoretical Physics•Dec 1, 1975•44 citations

Statistics of Distinguishable Particles and Resolution of the Gibbs Paradox of the First Kind

Hjalmar Peters

In physics, there are two distinct paradoxes, which are both known as the “Gibbs paradox”. This article is concerned with only one of them: the false increase in entropy, which is calculated from the process of combining two gases of the same kind consisting of distinguishable particles. In the following, this paradox will be referred to as the Gibbs paradox of the first kind (GP1). (Two particles are said to be distinguishable if they are either non-identical, that is, if they have different properties, or if they are identical and there are microstates which change under transposition of the two particles.) The GP1 is demonstrated and subsequently analyzed. The analysis shows that, for (quantum or classical) systems of distinguishable particles, it is generally uncertain of which particles they consist. The neglect of this uncertainty is the root of the GP1. For the statistical description of a system of distinguishable particles, an underlying set of particles, containing all particles that in principle qualify for being part of the system, is assumed to be known. Of which elements of this underlying particle set the system is composed, differs from microstate to microstate. Thus, the system is described by an ensemble of possible particle compositions. The uncertainty about the particle composition contributes to the entropy of the system. Systems for which all possible particle compositions are equiprobable will be called harmonic . Classical systems of distinguishable identical particles are harmonic as a matter of principle; quantum or classical systems of non-identical particles are not necessarily harmonic, since for them the composition probabilities depend individually on the preparation of the system. Harmonic systems with the same underlying particle set are always correlated; hence, for harmonic systems, the entropy is no longer additive and loses its thermodynamic meaning. A quantity derived from entropy is introduced, the reduced entropy , which, for harmonic systems, replaces the entropy as thermodynamic potential. For identical classical particles, the equivalence (in particular with respect to the second law of thermodynamics) between distinguishability and indistinguishability is proved. The resolution of the GP1 is demonstrated applying the previously found results.

Journal of Statistical Physics•Oct 26, 2010•9 citations
We investigate the quantum dynamics of particles on graphs (``quantum random walks''), with the aim of developing quantum algorithms for determining if two graphs are isomorphic (related to each other by a relabeling of vertices). We focus on quantum random walks of multiple noninteracting particles on strongly regular graphs (SRGs), a class of graphs with high symmetry that is known to have pairs of graphs that are hard to distinguish. Previous work has already demonstrated analytically that two-particle noninteracting quantum walks cannot distinguish nonisomorphic SRGs of the same family. Here, we demonstrate numerically that three-particle noninteracting quantum walks have significant, but not universal, distinguishing power for pairs of SRGs, proving a fundamental difference between the distinguishing power of two-particle and three-particle noninteracting walks. We show analytically why this distinguishing power is possible, whereas it is forbidden for two-particle noninteracting walks. Based on sampling of SRGs with up to 64 vertices, we find no difference in the distinguishing power of bosonic and fermionic walks. In addition, we find that the four-fermion noninteracting walk has greater distinguishing power than the three-particle walk on SRGs, showing that increasing the particle number increases the distinguishing power. However, we also show analytically that no noninteracting walk with a fixed number of particles can distinguish all SRGs, thus demonstrating a potential fundamental difference in the distinguishing power of interacting versus noninteracting walks.
In physics, there are two distinct paradoxes, which are both known as the “Gibbs paradox”. This article is concerned with only one of them: the false increase in entropy, which is calculated from the process of combining two gases of the same kind consisting of distinguishable particles. In the following, this paradox will be referred to as the Gibbs paradox of the first kind (GP1). (Two particles are said to be distinguishable if they are either non-identical, that is, if they have different properties, or if they are identical and there are microstates which change under transposition of the two particles.) The GP1 is demonstrated and subsequently analyzed. The analysis shows that, for (quantum or classical) systems of distinguishable particles, it is generally uncertain of which particles they consist. The neglect of this uncertainty is the root of the GP1. For the statistical description of a system of distinguishable particles, an underlying set of particles, containing all particles that in principle qualify for being part of the system, is assumed to be known. Of which elements of this underlying particle set the system is composed, differs from microstate to microstate. Thus, the system is described by an ensemble of possible particle compositions. The uncertainty about the particle composition contributes to the entropy of the system. Systems for which all possible particle compositions are equiprobable will be called harmonic . Classical systems of distinguishable identical particles are harmonic as a matter of principle; quantum or classical systems of non-identical particles are not necessarily harmonic, since for them the composition probabilities depend individually on the preparation of the system. Harmonic systems with the same underlying particle set are always correlated; hence, for harmonic systems, the entropy is no longer additive and loses its thermodynamic meaning. A quantity derived from entropy is introduced, the reduced entropy , which, for harmonic systems, replaces the entropy as thermodynamic potential. For identical classical particles, the equivalence (in particular with respect to the second law of thermodynamics) between distinguishability and indistinguishability is proved. The resolution of the GP1 is demonstrated applying the previously found results.