Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1605.00315 · Communications in Mathematical Physics

Universal Preparability of States and Asymptotic Completeness

Rolf Gohm, Florian Haag, Burkhard Kümmerer

Published Mar 6, 2017• 1 citation
arXivHTMLPDF

Abstract

We introduce a notion of universal preparability for a state of a system, more precisely: for a normal state on a von Neumann algebra. It describes a situation where from an arbitrary initial state it is possible to prepare a target state with arbitrary precision by a repeated interaction with a sequence of copies of another system. For $${\mathcal{B}(\mathcal{H})}$$ we give criteria sufficient to ensure that all normal states are universally preparable which can be verified for a class of non-commutative birth and death processes realized, in particular, by the interaction of a micromaser with a stream of atoms. As a tool, the theory of tight sequences of states and of stationary states is further developed and we show that in the presence of stationary faithful normal states universal preparability of all normal states is equivalent to asymptotic completeness, a notion studied earlier in connection with the scattering theory of non-commutative Markov processes.

DOI
10.1007/s00220-017-2851-8

Related papers

INDEPENDENCE AND MARKOVIANITY FOR STATES ON VON NEUMANN ALGEBRAS

Carlo Cecchini

Several possible generalizations of the classical notion of markovianity are given for states defined on a von Neumann algebras generated on a triple of subalgebras. Their mutual relation is discussed in the particular case in which they mutually commute, and the generalization of the classical; time reversal theorem is proved. A structure theorem for a class of Markov chains is also proved.

Infinite Dimensional Analysis Quantum Probability and Related Topics•Mar 1, 2007•0 citations

A universal property for sequential measurement

Abraham Westerbaan, Bas Westerbaan

We study the sequential product the operation p∗q=pqp on the set of effects, [0, 1]𝒜, of a von Neumann algebra 𝒜 that represents sequential measurement of first p and then q. In their work [J. Math. Phys. 49(5), 052106 (2008)], Gudder and Latrémolière give a list of axioms based on physical grounds that completely determines the sequential product on a von Neumann algebra of type I, that is, a von Neumann algebra ℬ(ℋ) of all bounded operators on some Hilbert space ℋ. In this paper we give a list of axioms that completely determines the sequential product on all von Neumann algebras simultaneously (Theorem 4).

arXiv:1603.00410•Journal of Mathematical Physics•Sep 1, 2016•13 citations

Contiguity of States and Super Wave Operators

Rolando Rebolledo

This paper characterises contiguity for families of states defined on a von Neumann algebra. It extends earlier research of my own published in [1], motivated by scattering theory and the celebrated work of Lucien Le Cam in classical probability. It is well-known that Le Cam did a major contribution to develop asymptotic methods in statistical decision theory, defining various new concepts, among them, contiguity of probability measures. In particular, contiguity of quantum states allows to explore different aspects of the large time behaviour of noncommutative Markov semigroups, among them, the super wave operator characterisation. I illustrate these results via quantum and classical examples of evolutions.

Open Systems & Information Dynamics•Mar 1, 2019•2 citations

Greatest Quantum Channels with Prescribed Maximal Information

Harjas Sandhu

Two quantum channels can have identical information geometry while allowing different physical simulations. This paper asks whether a complete RLD information profile has a greatest realization: a channel from which every other realization of that profile can be produced by deterministic postprocessing. Equality of right logarithmic derivative (RLD) Fisher information for every faithful input, tangent and finite quantum reference determines a labelled von Neumann algebra, a normalized channel and a faithful normal state. The same equivalence relation is obtained from complete maximal f-divergences. Every finite-dimensional invariant has a greatest representative of minimum possible effective output dimension, without requiring the invariant state to be tracial. For separable trace-class outputs with a faithful normal tracial invariant state, an exact greatest member exists precisely when the algebra is a countable product of finite matrix algebras. Arbitrarily accurate greatest members within the same exact profile class exist precisely when the algebra is injective. Existence of a single sequence approximating every fixed target already implies existence of a sequence whose diamond-norm error is uniform over all targets. Spectral pinching and finite-dimensional Haar averaging connect these operational requirements to established operator-algebraic approximation theory. The paper gives diffuse binary examples, an explicit free-group class with a finite quantitative obstruction, polynomial-time exact profile comparison and polynomial-bit faithful witnesses for rational finite channels, and finite probe identification with conditioned stability. A fixed full-support family shows that capacity optimized over an exact profile class can be discontinuous even while every physical channel in the family is antidegradable and has zero quantum capacity. The infinite-output classification requires the stated tracial hypothesis. It supplies neither an effective general filtration nor an experimental convergence rate. The atomic/injective distinction, reverse-test and sufficiency theory, amenability machinery and finite identification methods are credited to their primary sources. RLD-profile equality is distinct from the SLD, Umegaki and Holevo comparison problems studied in Complete information orders of quantum channels: equivalence and undecidability.

•Nov 6, 2026•0 citations

Universality in exact quantum state population dynamics and control

Lian-Ao Wu, Dvira Segal, I. L. Egusquiza +1 more

We consider an exact population transition, defined as the probability of finding a state at a final time that is exactly equal to the probability of another state at the initial time. We prove that, given a Hamiltonian, there always exists a complete set of orthogonal states that can be employed as time-zero states for which this exact population transition occurs. The result is general: It holds for arbitrary systems, arbitrary pairs of initial and final states, and for any time interval. The proposition is illustrated with several analytic models. In particular, we demonstrate that in some cases, by tuning the control parameters, a complete transition might occur, where a target state, vacant at $t=0$, is fully populated at time $\ensuremath{\tau}$.

arXiv:0911.2961•Physical Review A•Sep 9, 2010•3 citations

Independence and Lévy Processes in Quantum Probability

Uwe Franz, Adam Skalski

Quantum probability is a generalization of both classical probability theory and quantum mechanics that allows to describe the probabilistic aspects of quantum mechanics. This generalization is formulated in two steps. First, the theory is reformulated in terms of algebras of functions on probability spaces. Therefore, the notion of a probability space (Ω, ℱ, P) is replaced by the pair (L∞ (Ω), E(.) = ∫Ω. dP) consisting of the commutative von Neumann algebra of bounded random variables and the expectation functional. Then, the commutativity condition is dropped. In this way we arrive at the notion of a (von Neumann) algebraic probability space (N,Φ) consisting of a von Neumann algebra N and a normal (faithful tracial) state Φ. As we have seen this includes classical probability spaces in the form (L∞(Ω), E), it also includes quantum mechanical systems modeled by a Hilbert space H and a pure state ψ ∊ H (or a mixed state ρ ∊ S(H)), if we take N = B(H) and Ф the state defined by Ф(X) = 〈 ψ, X ψ 〉 (or Ф (X) = tr(ρX)) for X ∊ B(H). Note that in this course we shall relax the conditions on N and Φ and work with involutive algebras and positive normalized functionals, that is, *-algebraic probability spaces.

Cambridge University Press eBooks•Dec 18, 2015•1 citation
We introduce a notion of universal preparability for a state of a system, more precisely: for a normal state on a von Neumann algebra. It describes a situation where from an arbitrary initial state it is possible to prepare a target state with arbitrary precision by a repeated interaction with a sequence of copies of another system. For B(H){\mathcal{B}(\mathcal{H})}B(H) we give criteria sufficient to ensure that all normal states are universally preparable which can be verified for a class of non-commutative birth and death processes realized, in particular, by the interaction of a micromaser with a stream of atoms. As a tool, the theory of tight sequences of states and of stationary states is further developed and we show that in the presence of stationary faithful normal states universal preparability of all normal states is equivalent to asymptotic completeness, a notion studied earlier in connection with the scattering theory of non-commutative Markov processes.
We study the sequential product the operation p∗q=pqp on the set of effects, [0, 1]𝒜, of a von Neumann algebra 𝒜 that represents sequential measurement of first p and then q. In their work [J. Math. Phys. 49(5), 052106 (2008)], Gudder and Latrémolière give a list of axioms based on physical grounds that completely determines the sequential product on a von Neumann algebra of type I, that is, a von Neumann algebra ℬ(ℋ) of all bounded operators on some Hilbert space ℋ. In this paper we give a list of axioms that completely determines the sequential product on all von Neumann algebras simultaneously (Theorem 4).
This paper characterises contiguity for families of states defined on a von Neumann algebra. It extends earlier research of my own published in [1], motivated by scattering theory and the celebrated work of Lucien Le Cam in classical probability. It is well-known that Le Cam did a major contribution to develop asymptotic methods in statistical decision theory, defining various new concepts, among them, contiguity of probability measures. In particular, contiguity of quantum states allows to explore different aspects of the large time behaviour of noncommutative Markov semigroups, among them, the super wave operator characterisation. I illustrate these results via quantum and classical examples of evolutions.
Two quantum channels can have identical information geometry while allowing different physical simulations. This paper asks whether a complete RLD information profile has a greatest realization: a channel from which every other realization of that profile can be produced by deterministic postprocessing. Equality of right logarithmic derivative (RLD) Fisher information for every faithful input, tangent and finite quantum reference determines a labelled von Neumann algebra, a normalized channel and a faithful normal state. The same equivalence relation is obtained from complete maximal f-divergences. Every finite-dimensional invariant has a greatest representative of minimum possible effective output dimension, without requiring the invariant state to be tracial. For separable trace-class outputs with a faithful normal tracial invariant state, an exact greatest member exists precisely when the algebra is a countable product of finite matrix algebras. Arbitrarily accurate greatest members within the same exact profile class exist precisely when the algebra is injective. Existence of a single sequence approximating every fixed target already implies existence of a sequence whose diamond-norm error is uniform over all targets. Spectral pinching and finite-dimensional Haar averaging connect these operational requirements to established operator-algebraic approximation theory. The paper gives diffuse binary examples, an explicit free-group class with a finite quantitative obstruction, polynomial-time exact profile comparison and polynomial-bit faithful witnesses for rational finite channels, and finite probe identification with conditioned stability. A fixed full-support family shows that capacity optimized over an exact profile class can be discontinuous even while every physical channel in the family is antidegradable and has zero quantum capacity. The infinite-output classification requires the stated tracial hypothesis. It supplies neither an effective general filtration nor an experimental convergence rate. The atomic/injective distinction, reverse-test and sufficiency theory, amenability machinery and finite identification methods are credited to their primary sources. RLD-profile equality is distinct from the SLD, Umegaki and Holevo comparison problems studied in Complete information orders of quantum channels: equivalence and undecidability.
We consider an exact population transition, defined as the probability of finding a state at a final time that is exactly equal to the probability of another state at the initial time. We prove that, given a Hamiltonian, there always exists a complete set of orthogonal states that can be employed as time-zero states for which this exact population transition occurs. The result is general: It holds for arbitrary systems, arbitrary pairs of initial and final states, and for any time interval. The proposition is illustrated with several analytic models. In particular, we demonstrate that in some cases, by tuning the control parameters, a complete transition might occur, where a target state, vacant at t=0t=0t=0, is fully populated at time $\ensuremath{\tau}$.
Quantum probability is a generalization of both classical probability theory and quantum mechanics that allows to describe the probabilistic aspects of quantum mechanics. This generalization is formulated in two steps. First, the theory is reformulated in terms of algebras of functions on probability spaces. Therefore, the notion of a probability space (Ω, ℱ, P) is replaced by the pair (L∞ (Ω), E(.) = ∫Ω. dP) consisting of the commutative von Neumann algebra of bounded random variables and the expectation functional. Then, the commutativity condition is dropped. In this way we arrive at the notion of a (von Neumann) algebraic probability space (N,Φ) consisting of a von Neumann algebra N and a normal (faithful tracial) state Φ. As we have seen this includes classical probability spaces in the form (L∞(Ω), E), it also includes quantum mechanical systems modeled by a Hilbert space H and a pure state ψ ∊ H (or a mixed state ρ ∊ S(H)), if we take N = B(H) and Ф the state defined by Ф(X) = 〈 ψ, X ψ 〉 (or Ф (X) = tr(ρX)) for X ∊ B(H). Note that in this course we shall relax the conditions on N and Φ and work with involutive algebras and positive normalized functionals, that is, *-algebraic probability spaces.