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

Springer eBooks

Quantum Schrödinger Bridges

Michele Pavon

Published Aug 7, 2007• 8 citations
Publisher
DOI
10.1007/3-540-36106-5_17

Related papers

How to Steer a Quantum System over a Schrödinger Bridge

Alessandro Beghi, Augusto Ferrante, Michele Pavon

Quantum Information Processing•Jun 1, 2002•9 citations

The Schrödinger Realization of Quantum Mechanics

Daniel R. Bes

Springer eBooks•Jan 1, 2004•0 citations

Quantum-Enhanced Sampling of Schrödinger Bridges

Tom Lollier, Eyal Neuman

We consider the dynamic Schrödinger bridge problem on a finite state space and exploit its Markov structure to decompose the problem into an endpoint coupling and a collection of conditional Markov bridges. To sample from the conditional bridges, we develop a quantum Gibbs sampler based on quantum walks on the bridge path space. Under uniformly positive transition probabilities, we derive a spectral-gap bound and provide an explicit procedure for preparing the initial state. Compared with the update bounds of the corresponding classical Gibbs sampler, our quantum walk-query complexity improves the dependence on the time horizon $T$ from quadratic to linear. For the endpoint coupling, we adapt a quantum box-constrained Newton method to compute the Schrödinger potentials, improving the matrix-scaling complexity, at fixed accuracy, from quadratic to $N^{3/2}$ in the state-space size $N$. Finally, we show that exponential reweighting extends both the Schrödinger bridge formulation and the Gibbs spectral-gap estimate to models with additive running costs.

quant-pharXiv:2609.27103•Sep 24, 2026•0 citations

The Schrödinger Picture of Quantum Mechanics

Nima Moshayedi

SpringerBriefs in physics•Jan 1, 2023•0 citations

Schrödinger Bridges via the Hacking of Bayesian Priors in Classical and Quantum Regimes

Clive Cenxin Aw, Peter Sidajaya

Bayes' rule is widely regarded as the canonical prescription for belief updating. We show, however, that one can arbitrarily preserve pre-specified beliefs while appearing to perform Bayesian updates via "prior hacking": engineering a reference prior distribution such that, for a fixed channel and evidence, the update matches a chosen target distribution. We prove that this is generically possible in both classical and quantum settings whenever Bayesian inversions are well-defined (with the Petz recovery map as the quantum analogue to Bayes' rule), and provide constructive algorithms for doing so. We further establish a duality between prior hacking and Schrödinger bridge problems (a key object in statistical physics with applications in generative modelling), yielding in the quantum setting a unique, inference-consistent selection among candidate bridges. This formally establishes the Bayes-like updating that Schrödinger bridges are performing with respect to the process as opposed to the reference prior, both in classical and quantum settings.

quant-pharXiv:2603.18665•Mar 20, 2026•0 citations

Quantum Schrödinger bridges: Large deviations and time-symmetric ensembles

Olga Movilla Miangolarra, Ralph Sabbagh, Tryphon T. Georgiou

Quantum counterparts of Schrodinger's classical bridge problem have been around for the better part of half a century. During that time, several quantum approaches to this multifaceted classical problem have been introduced. In the present work, we unify, extend, and interpret several such approaches through a classical large deviations perspective. To this end, we consider time-symmetric ensembles that are pre- and post-selected before and after a Markovian experiment is performed. The Schrodinger bridge problem is that of finding the most likely joint distribution of initial and final outcomes that is consistent with obtained endpoint results. The derived distribution provides quantum Markovian dynamics that bridge the observed endpoint states in the form of density matrices. The solution retains its classical structure in that density matrices can be expressed as the product of forward-evolving and backward-evolving matrices. In addition, the quantum Schrodinger bridge allows inference of the most likely distribution of outcomes of an intervening measurement with unknown results. This distribution may be written as a product of forward- and backward-evolving expressions, in close analogy to the classical setting, and in a time-symmetric way. The derived results are illustrated through a two-level amplitude damping example.

arXiv:2503.05886•Physical Review A•Jun 11, 2025•1 citation
We consider the dynamic Schrödinger bridge problem on a finite state space and exploit its Markov structure to decompose the problem into an endpoint coupling and a collection of conditional Markov bridges. To sample from the conditional bridges, we develop a quantum Gibbs sampler based on quantum walks on the bridge path space. Under uniformly positive transition probabilities, we derive a spectral-gap bound and provide an explicit procedure for preparing the initial state. Compared with the update bounds of the corresponding classical Gibbs sampler, our quantum walk-query complexity improves the dependence on the time horizon TTT from quadratic to linear. For the endpoint coupling, we adapt a quantum box-constrained Newton method to compute the Schrödinger potentials, improving the matrix-scaling complexity, at fixed accuracy, from quadratic to N3/2N^{3/2}N3/2 in the state-space size NNN. Finally, we show that exponential reweighting extends both the Schrödinger bridge formulation and the Gibbs spectral-gap estimate to models with additive running costs.
Bayes' rule is widely regarded as the canonical prescription for belief updating. We show, however, that one can arbitrarily preserve pre-specified beliefs while appearing to perform Bayesian updates via "prior hacking": engineering a reference prior distribution such that, for a fixed channel and evidence, the update matches a chosen target distribution. We prove that this is generically possible in both classical and quantum settings whenever Bayesian inversions are well-defined (with the Petz recovery map as the quantum analogue to Bayes' rule), and provide constructive algorithms for doing so. We further establish a duality between prior hacking and Schrödinger bridge problems (a key object in statistical physics with applications in generative modelling), yielding in the quantum setting a unique, inference-consistent selection among candidate bridges. This formally establishes the Bayes-like updating that Schrödinger bridges are performing with respect to the process as opposed to the reference prior, both in classical and quantum settings.
Quantum counterparts of Schrodinger's classical bridge problem have been around for the better part of half a century. During that time, several quantum approaches to this multifaceted classical problem have been introduced. In the present work, we unify, extend, and interpret several such approaches through a classical large deviations perspective. To this end, we consider time-symmetric ensembles that are pre- and post-selected before and after a Markovian experiment is performed. The Schrodinger bridge problem is that of finding the most likely joint distribution of initial and final outcomes that is consistent with obtained endpoint results. The derived distribution provides quantum Markovian dynamics that bridge the observed endpoint states in the form of density matrices. The solution retains its classical structure in that density matrices can be expressed as the product of forward-evolving and backward-evolving matrices. In addition, the quantum Schrodinger bridge allows inference of the most likely distribution of outcomes of an intervening measurement with unknown results. This distribution may be written as a product of forward- and backward-evolving expressions, in close analogy to the classical setting, and in a time-symmetric way. The derived results are illustrated through a two-level amplitude damping example.