How much randomness in a quantum process can be explained using memory?

• URL: http://arxiv.org/abs/2608.25878v1
• Date: Wed, 26 Aug 2026 14:50:53 GMT
• Title: How much randomness in a quantum process can be explained using memory?
• Abstract summary: We develop a convergent measure of irreducible randomness in stationary quantum processes.<n>This directly enables a measure of temporal correlations which lower bounds the memory resources required to replicate the process.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For a stochastic process describing observations of a dynamical system, complexity science provides systematic methods to decompose the information produced into true irreducible randomness, and that which corresponds to structure superficially disguised as random but can in fact be learned and predicted. Such methods then equip vital tools for prediction, control and inference of the system's internal structure. However, quantum analogs remain underdeveloped due to the inherent complications of invasive measurements and quantum correlations. By harnessing the Choi state representation of process tensors which encode multi-time input-output relations, we formulate a convergent measure of irreducible randomness in stationary quantum stochastic processes. This directly enables a measure of temporal correlations which lower bounds the memory resources required to replicate the process via a recurrent quantum circuit.

Related papers

• Direct probing of the simulation complexity of open quantum many-body dynamics [42.085941481155295]
  We study the role of dissipation in simulating open-system dynamics using both quantum and classical methods.<n>Our results show that dissipation affects correlation length and mixing time in distinct ways at intermediate and long timescales.
  arXiv  Detail & Related papers  (2025-08-27T15:14:36Z)
• Dissipation-induced Quantum Homogenization for Temporal Information Processing [44.99833362998488]
  Quantum reservoirs have great potential as they utilize the complex real-time dissipative dynamics of quantum systems for information processing and target time-series generation without precise control or fine-tuning of the Hamiltonian parameters.<n>We propose the disordered quantum homogenizer as an alternative platform, and prove it satisfies the necessary and sufficient conditions - stability and contractivity - of the reservoir dynamics.<n>The results indicate that the quantum homogenization protocol, physically implementable as either nuclear magnetic resonance ensemble or a photonic system, can potentially function as a reservoir computer.
  arXiv  Detail & Related papers  (2024-12-13T09:05:41Z)
• Quantum Dissipative Search via Lindbladians [0.0]
  We analyze a purely dissipative quantum random walk on an unstructured classical search space.<n>We show that certain jump operators make the quantum process replicate a classical one, while others yield differences between open quantum (OQRW) and classical random walks.<n>We also clarify a previously observed quadratic speedup, demonstrating that OQRWs are no more efficient than classical search.
  arXiv  Detail & Related papers  (2024-07-16T14:39:18Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Intrinsic and Measured Information in Separable Quantum Processes [0.0]
  We introduce quantum-information-theoretic properties for separable qudit sequences. We identify broad classes of separable processes based on their quantum information properties.
  arXiv  Detail & Related papers  (2023-03-01T01:26:01Z)
• Characterizing quantum pseudorandomness by machine learning [2.589904091148018]
  We propose a method for verifying random dynamics from the data that is experimentally easy-to-access. We use measurement probabilities estimated by a finite number of measurements of quantum states generated by a given random dynamics.
  arXiv  Detail & Related papers  (2022-05-29T13:51:49Z)
• Optimality and Complexity in Measured Quantum-State Stochastic Processes [0.0]
  We show that optimal prediction requires using an infinite number of temporal features. We identify the mechanism underlying this complicatedness as generator nonunifilarity. This makes it possible to quantitatively explore the influence that measurement choice has on a quantum process' degrees of randomness.
  arXiv  Detail & Related papers  (2022-05-08T21:43:06Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers [0.0]
  We show how to tackle the problem using a suitably quantum computer. We propose a hybrid quantum-classical sampling scheme to escape local minima.
  arXiv  Detail & Related papers  (2021-08-25T18:04:52Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• A discrete memory-kernel for multi-time correlations in non-Markovian quantum processes [0.0]
  We show that the transfer-tensor method can be extended to processes which include multiple interrogations. Our approach exploits the process-tensor description of open quantum processes to represent and propagate the dynamics.
  arXiv  Detail & Related papers  (2020-07-07T07:00:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.