Search arXivSearch

arXiv · quant-ph/0409138

Entropy, time irreversibility and Schroedinger equation in a primarily discrete space-time

Abstract

In this paper we show that the existence of a primarily discrete space-time may be a fruitful assumption from which we may develop a new approach of statistical thermodynamics in pre-relativistic conditions. The discreetness of space-time structure is determined by a condition that mimics the Heisenberg uncertainty relations and the motion in this space-time model is chosen as simple as possible. From these two assumptions we define a path-entropy that measures the number of closed paths associated with a given energy of the system preparation. This entropy has a dynamical character and depends on the time interval on which we count the paths. We show that it exists an like-equilibrium condition for which the path-entropy corresponds exactly to the usual thermodynamic entropy and, more generally, the usual statistical thermodynamics is reobtained. This result derived without using the Gibbs ensemble method shows that the standard thermodynamics is consistent with a motion that is time-irreversible at a microscopic level. From this change of paradigm it becomes easy to derive a $H-theorem$. A comparison with the traditional Boltzmann approach is presented. We also show how our approach can be implemented in order to describe reversible processes. By considering a process defined simultaneously by initial and final conditions a well defined stochastic process is introduced and we are able to derive a Schroedinger equation, an example of time reversible equation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J. P. Badiali. 2004-09-21. Entropy, time irreversibility and Schroedinger equation in a primarily discrete space-time. https://doi.org/10.1088/0305-4470%2F38%2F13%2F002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph