Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 99 tok/s
Gemini 2.5 Pro 55 tok/s Pro
GPT-5 Medium 23 tok/s
GPT-5 High 19 tok/s Pro
GPT-4o 108 tok/s
GPT OSS 120B 465 tok/s Pro
Kimi K2 179 tok/s Pro
2000 character limit reached

Spin Entropy (2111.11605v3)

Published 23 Nov 2021 in quant-ph and hep-th

Abstract: In classical physics, entropy quantifies the randomness of large systems, where the complete specification of the state, though possible in theory, is not possible in practice. In quantum physics, despite its inherently probabilistic nature, the concept of entropy has been elusive. The von Neumann entropy, currently adopted in quantum information and computing, models only the randomness associated with unknown specifications of a state and is zero for pure quantum states, and thus cannot quantify the inherent randomness of its observables. Our goal is to provide such quantification. This paper focuses on the quantification of the observed spin values associated with a pure quantum state, given an axis $z$. To this end, we define a spin entropy, which is not zero for pure states, and its minimum is $\ln 2\pi$, reflecting the uncertainty principle for the spin observables. We study the spin entropy for single massive particles with spin $1/2$ and spin 1, photons, and two fermions in entangled and disentangled states. The spin entropy attains local minima for Bell states, which are pure entangled states of two fermions, and local maxima for disentangled states. The spin entropy may be useful for developing robust quantum computational processes.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (2)