Quantum theory in finite dimension cannot explain every general process with finite memory

DOI10.1007/S00220-023-04913-4MaRDI QIDQ6202449zbMATH OpenFDO

Authors Marco Fanizza, Josep Lumbreras, Andreas Winter

Publication date 26 February 2024

Published in Communications in Mathematical Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2209.11225

Mathematics Subject Classification ID

Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Mathematical programming (90Cxx)

Abstract: Arguably, the largest class of stochastic processes generated by means of a finite memory consists of those that are sequences of observations produced by sequential measurements in a suitable generalized probabilistic theory (GPT). These are constructed from a finite-dimensional memory evolving under a set of possible linear maps, and with probabilities of outcomes determined by linear functions of the memory state. Examples of such models are given by classical hidden Markov processes, where the memory state is a probability distribution, and at each step it evolves according to a non-negative matrix, and hidden quantum Markov processes, where the memory state is a finite dimensional quantum state, and at each step it evolves according to a completely positive map. Here we show that the set of processes admitting a finite-dimensional explanation do not need to be explainable in terms of either classical probability or quantum mechanics. To wit, we exhibit families of processes that have a finite-dimensional explanation, defined manifestly by the dynamics of explicitly given GPT, but that do not admit a quantum, and therefore not even classical, explanation in finite dimension. Furthermore, we present a family of quantum processes on qubits and qutrits that do not admit a classical finite-dimensional realization, which includes examples introduced earlier by Fox, Rubin, Dharmadikari and Nadkarni as functions of infinite dimensional Markov chains, and lower bound the size of the memory of a classical model realizing a noisy version of the qubit processes.

Recommendations

• Finite quantum processes
• Strong and weak optimizations in classical and quantum models of stochastic processes
• Computation in finitary stochastic and quantum processes
• On the non-Markovianity of quantum semi-Markov processes
• Memory effects in quantum processes

Cites work

• scientific article; zbMATH DE number 5989818 (Why is no real title available?)
• scientific article; zbMATH DE number 3230998 (Why is no real title available?)
• scientific article; zbMATH DE number 967931 (Why is no real title available?)
• scientific article; zbMATH DE number 3065861 (Why is no real title available?)
• scientific article; zbMATH DE number 7646009 (Why is no real title available?)
• A Canonical Form for Weighted Automata and Applications to Approximate Minimization
• A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
• A tutorial on geometric programming
• Applications of second-order cone programming
• Asymptotic and non-asymptotic analysis for a hidden Markovian process with a quantum hidden system
• Asymptotic properties for Markovian dynamics in quantum theory and general probabilistic theories
• Computation in finitary stochastic and quantum processes
• Cones and matrix invariance: a short survey
• Digital Circuit Optimization via Geometric Programming
• Finitely correlated states on quantum spin chains
• Functions of Processes with Markovian States
• Fundamental limitations in the purifications of tensor networks
• General probabilistic theories: an introduction
• Hidden Markov Models for Time Series
• Hidden Markov processes. Theory and applications to biology
• Identification of State-calculable Functions of Finite Markov Chains
• Manipulating quantum entanglement with atoms and photons in a cavity
• Norm-observable operator models
• OR Practice—Solving Complex Chemical Equilibria Using a Geometric-Programming Based Technique
• Quantum learning of classical stochastic processes: the completely positive realization problem
• Relative entropy optimization and its applications
• Row Stochastic Matrices Similar to Doubly Stochastic Matrices
• Semidefinite approximations of the matrix logarithm
• Some Regular and Non-regular Functions of Finite Markov Chains
• Spectral Properties of Matrices which have Invariant Cones
• Sufficient Conditions for a Stationary Process to be a Function of a Finite Markov Chain
• The NIEP
• The calculi of emergence: Computation, dynamics and induction
• Towards non-symmetric conic optimization

This page was built for publication: Quantum theory in finite dimension cannot explain every general process with finite memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202449)