Quantum Indistinguishability through Exchangeable Desirable Gambles

Two particles are identical if all their intrinsic properties, such as spin and charge, are the same, meaning that no quantum experiment can distinguish them. In addition to the well known principles of quantum mechanics, understanding systems of identical particles requires a new postulate, the so called symmetrization postulate. In this work, we show that the postulate corresponds to exchangeability assessments for sets of observables (gambles) in a quantum experiment, when quantum mechanics is seen as a normative and algorithmic theory guiding an agent to assess her subjective beliefs represented as (coherent) sets of gambles. Finally, we show how sets of exchangeable observables (gambles) may be updated after a measurement and discuss the issue of defining entanglement for indistinguishable particle systems.

[1]  Roberto Floreanini,et al.  Entanglement of Identical Particles , 2014, Open Syst. Inf. Dyn..

[2]  Marco Zaffalon,et al.  A Gleason-Type Theorem for Any Dimension Based on a Gambling Formulation of Quantum Mechanics , 2016, Foundations of Physics.

[3]  W. Vogel,et al.  Entanglement witnesses for indistinguishable particles , 2015, 1501.02595.

[4]  Marco Zaffalon,et al.  Bernstein's Socks, Polynomial-Time Provable Coherence and Entanglement , 2019, ISIPTA.

[5]  Marco Zaffalon,et al.  Sum-of-squares for bounded rationality , 2019, Int. J. Approx. Reason..

[6]  L. M. M.-T. Theory of Probability , 1929, Nature.

[7]  P. Walley Statistical Reasoning with Imprecise Probabilities , 1990 .

[8]  Thiago O. Maciel,et al.  Quantifying quantum correlations in fermionic systems using witness operators , 2012, Quantum Inf. Process..

[9]  Marco Zaffalon,et al.  Quantum mechanics: The Bayesian theory generalized to the space of Hermitian matrices , 2016, 1605.08177.

[10]  Gert de Cooman,et al.  Exchangeability and sets of desirable gambles , 2009, Int. J. Approx. Reason..

[11]  C. Fuchs,et al.  Unknown Quantum States: The Quantum de Finetti Representation , 2001, quant-ph/0104088.

[12]  Marco Zaffalon,et al.  Computational Complexity and the Nature of Quantum Mechanics , 2019, ArXiv.

[13]  D. Freedman,et al.  Finite Exchangeable Sequences , 1980 .

[14]  Reinaldo O. Vianna,et al.  Computable measures for the entanglement of indistinguishable particles , 2012, 1211.1886.

[15]  H. Jeffreys,et al.  Theory of probability , 1896 .

[16]  L. Ferrari Teoria delle Probabilità , 2017 .

[17]  Gert de Cooman,et al.  Accept & reject statement-based uncertainty models , 2012, Int. J. Approx. Reason..

[18]  L. Ballentine,et al.  Probabilistic and Statistical Aspects of Quantum Theory , 1982 .

[19]  Leonid Gurvits Classical deterministic complexity of Edmonds' Problem and quantum entanglement , 2003, STOC '03.