Ge Bai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ge Bai has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Giulio Chiribella
The University of Hong Kong
9 shared publications - Ya-Dong Wu
John Hopcroft Center for Computer Science, Shanghai Jiao Tong University, Shanghai, China
4 shared publications - Francesco Buscemi
Nagoya University
3 shared publications - Mingxuan Liu
Centre for Quantum Technologies, National University of Singapore, Singapore, Singapore
3 shared publications Valerio Scarani
National University of Singapore
3 shared publications- Valerio Scarani
Centre for Quantum Technologies, National University of Singapore, Singapore, Singapore
3 shared publications
Latest Publications
- Open Access
- 1 November 2026
- Published by Springer Nature in npj Quantum Information
Unifying quantum smoothing theories with extended retrodiction
- 1 November 2026
- Published by Springer Nature in npj Quantum Information
Open AccessUnifying quantum smoothing theories with extended retrodiction
- 20 July 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (29) , 295301
A quantum entropy production operator
We introduce a fully quantum notion of entropy production based on the non-commutative extension of the classical log-ratio between forward and reverse processes. Given a pair of quantum objects associated with the forward and reverse descriptions, we define a Hermitian entropy-production operator whose expectation value is non-negative and equal to the Belavkin–Staszewski relative entropy. The operator satisfies exact integral and detailed fluctuation theorems without requiring commutativity. We then specialize this construction to the case in which the forward process is described by a single quantum channel and the reverse process is defined inferentially, through Bayesian retrodiction relative to a prior state, with the Petz transpose map as the Bayesian inverse. In this setting, the relevant quantities can be evaluated explicitly, leading to a number of natural structural and physical properties. The framework recovers the classical formula in the commutative limit, yields explicit expressions for the average entropy production, and clarifies where the fully quantum case departs from standard thermodynamic expectations.
- 20 July 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (29) , 295301
A quantum entropy production operator
We introduce a fully quantum notion of entropy production based on the non-commutative extension of the classical log-ratio between forward and reverse processes. Given a pair of quantum objects associated with the forward and reverse descriptions, we define a Hermitian entropy-production operator whose expectation value is non-negative and equal to the Belavkin–Staszewski relative entropy. The operator satisfies exact integral and detailed fluctuation theorems without requiring commutativity. We then specialize this construction to the case in which the forward process is described by a single quantum channel and the reverse process is defined inferentially, through Bayesian retrodiction relative to a prior state, with the Petz transpose map as the Bayesian inverse. In this setting, the relevant quantities can be evaluated explicitly, leading to a number of natural structural and physical properties. The framework recovers the classical formula in the commutative limit, yields explicit expressions for the average entropy production, and clarifies where the fully quantum case departs from standard thermodynamic expectations.
- 12 February 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 136 (6) , 060203
Proper and Improper Mixed States Serve as Different Prior Beliefs for Quantum State Retrodiction
A mixed quantum state can be taken as capturing an unspecified form of ignorance; or as describing the lack of knowledge about the true pure state of the system ("proper mixture"); or as arising from entanglement with another system that has been disregarded ("improper mixture"). These different views yield identical density matrices and therefore identical predictions for future measurements. But when used as prior beliefs for inferring the past state from later observations ("retrodiction"), they lead to different updated beliefs. This is a purely quantum feature of Bayesian agency. Based on this observation, we establish a framework for retrodicting on any quantum belief and we prove a necessary and sufficient condition for the equivalence of beliefs. We also illustrate how these differences have operational consequences in quantum state recovery.
- 12 February 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 136 (6) , 060203
Proper and Improper Mixed States Serve as Different Prior Beliefs for Quantum State Retrodiction
A mixed quantum state can be taken as capturing an unspecified form of ignorance; or as describing the lack of knowledge about the true pure state of the system ("proper mixture"); or as arising from entanglement with another system that has been disregarded ("improper mixture"). These different views yield identical density matrices and therefore identical predictions for future measurements. But when used as prior beliefs for inferring the past state from later observations ("retrodiction"), they lead to different updated beliefs. This is a purely quantum feature of Bayesian agency. Based on this observation, we establish a framework for retrodicting on any quantum belief and we prove a necessary and sufficient condition for the equivalence of beliefs. We also illustrate how these differences have operational consequences in quantum state recovery.
- Open Access
Simulation of Adjoints and Petz Recovery Maps for Unknown Quantum Channels
Transformations of quantum channels, such as the transpose, complex conjugate, and adjoint, are fundamental to quantum information theory. Given access to an unknown channel, a central problem is whether these transformations can be implemented physically with quantum supermaps. While such supermaps are known for unitary operations, the situation for general quantum channels is fundamentally different. In this work, we establish a strict hierarchy of physical realizability for the transposition, complex conjugation, and adjoint transformation of an unknown quantum channel. We present a probabilistic protocol that exactly implements the transpose with a single query. In contrast, we prove no-go theorems showing that neither the complex conjugate nor the adjoint can be implemented by any completely positive supermap, even probabilistically. We then overcome this impossibility by designing a virtual protocol for the complex conjugate based on quasi-probability decomposition, and show its optimality in terms of the diamond norm. As a key application, we propose a protocol to estimate the expectation values resulting from the Petz recovery map of an unknown channel, achieving an improved query complexity compared to existing methods.
Open AccessSimulation of Adjoints and Petz Recovery Maps for Unknown Quantum Channels
Transformations of quantum channels, such as the transpose, complex conjugate, and adjoint, are fundamental to quantum information theory. Given access to an unknown channel, a central problem is whether these transformations can be implemented physically with quantum supermaps. While such supermaps are known for unitary operations, the situation for general quantum channels is fundamentally different. In this work, we establish a strict hierarchy of physical realizability for the transposition, complex conjugation, and adjoint transformation of an unknown quantum channel. We present a probabilistic protocol that exactly implements the transpose with a single query. In contrast, we prove no-go theorems showing that neither the complex conjugate nor the adjoint can be implemented by any completely positive supermap, even probabilistically. We then overcome this impossibility by designing a virtual protocol for the complex conjugate based on quasi-probability decomposition, and show its optimality in terms of the diamond norm. As a key application, we propose a protocol to estimate the expectation values resulting from the Petz recovery map of an unknown channel, achieving an improved query complexity compared to existing methods.
- Open Access
Unifying Quantum Smoothing Theories with Extended Retrodiction
Estimating the state of an open quantum system monitored over time requires incorporating information from past measurements (filtering) and, for improved accuracy, also from future measurements (smoothing). While classical smoothing is well-understood within Bayesian framework, its quantum generalization has been challenging, leading to distinct and seemingly incompatible approaches. In this work, we resolve this conceptual divide by developing a comprehensive retrodictive framework for quantum state smoothing. We demonstrate that existing theories are special cases within our formalism, corresponding to different extended prior beliefs. Our theory unifies the field and naturally extends it to a broader class of scenarios. We also explore the behavior of updates when using different priors with the same marginal and prove that the upper and lower bounds on average entropy of smoothed states are achieved by the Petz-Fuchs smoothed state and the CLHS smoothed state, respectively. Our results establish that quantum state smoothing is fundamentally a retrodictive process, finally bringing it into a closer analogy with classical smoothing.
Open AccessUnifying Quantum Smoothing Theories with Extended Retrodiction
Estimating the state of an open quantum system monitored over time requires incorporating information from past measurements (filtering) and, for improved accuracy, also from future measurements (smoothing). While classical smoothing is well-understood within Bayesian framework, its quantum generalization has been challenging, leading to distinct and seemingly incompatible approaches. In this work, we resolve this conceptual divide by developing a comprehensive retrodictive framework for quantum state smoothing. We demonstrate that existing theories are special cases within our formalism, corresponding to different extended prior beliefs. Our theory unifies the field and naturally extends it to a broader class of scenarios. We also explore the behavior of updates when using different priors with the same marginal and prove that the upper and lower bounds on average entropy of smoothed states are achieved by the Petz-Fuchs smoothed state and the CLHS smoothed state, respectively. Our results establish that quantum state smoothing is fundamentally a retrodictive process, finally bringing it into a closer analogy with classical smoothing.
- 28 August 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (9) , 090203
Quantum Bayes’ Rule and Petz Transpose Map from the Minimum Change Principle
Bayes' rule, which is routinely used to update beliefs based on new evidence, can be derived from a principle of minimum change. This principle states that updated beliefs must be consistent with new data, while deviating minimally from the prior belief. Here, we introduce a quantum analog of the minimum change principle and use it to derive a quantum Bayes' rule by minimizing the change between two quantum input-output processes, not just their marginals. This is analogous to the classical case, where Bayes' rule is obtained by minimizing several distances between the joint input-output distributions. When the change maximizes the fidelity, the quantum minimum change principle has a unique solution, and the resulting quantum Bayes' rule recovers the Petz transpose map in many cases.
- 28 August 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (9) , 090203
Quantum Bayes’ Rule and Petz Transpose Map from the Minimum Change Principle
Bayes' rule, which is routinely used to update beliefs based on new evidence, can be derived from a principle of minimum change. This principle states that updated beliefs must be consistent with new data, while deviating minimally from the prior belief. Here, we introduce a quantum analog of the minimum change principle and use it to derive a quantum Bayes' rule by minimizing the change between two quantum input-output processes, not just their marginals. This is analogous to the classical case, where Bayes' rule is obtained by minimizing several distances between the joint input-output distributions. When the change maximizes the fidelity, the quantum minimum change principle has a unique solution, and the resulting quantum Bayes' rule recovers the Petz transpose map in many cases.
- Open Access
- 14 November 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1524
Observational entropy with general quantum priors
Observational entropy captures both the intrinsic uncertainty of a thermodynamic state and the lack of knowledge due to coarse-graining. We demonstrate two interpretations of observational entropy, one as the statistical deficiency resulting from a measurement, the other as the difficulty of inferring the input state from the measurement statistics by quantum Bayesian retrodiction. These interpretations show that the observational entropy implicitly includes a uniform reference prior. Since the uniform prior cannot be used when the system is infinite-dimensional or otherwise energy-constrained, we propose generalizations by replacing the uniform prior with arbitrary quantum states that may not even commute with the state of the system. We propose three candidates for this generalization, discuss their properties, and show that one of them gives a unified expression that relates both interpretations.
- 14 November 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1524
Open AccessObservational entropy with general quantum priors
Observational entropy captures both the intrinsic uncertainty of a thermodynamic state and the lack of knowledge due to coarse-graining. We demonstrate two interpretations of observational entropy, one as the statistical deficiency resulting from a measurement, the other as the difficulty of inferring the input state from the measurement statistics by quantum Bayesian retrodiction. These interpretations show that the observational entropy implicitly includes a uniform reference prior. Since the uniform prior cannot be used when the system is infinite-dimensional or otherwise energy-constrained, we propose generalizations by replacing the uniform prior with arbitrary quantum states that may not even commute with the state of the system. We propose three candidates for this generalization, discuss their properties, and show that one of them gives a unified expression that relates both interpretations.
- 22 May 2023
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 130 (21) , 210601
Quantum Similarity Testing with Convolutional Neural Networks
The task of testing whether two uncharacterized quantum devices behave in the same way is crucial for benchmarking near-term quantum computers and quantum simulators, but has so far remained open for continuous variable quantum systems. In this Letter, we develop a machine learning algorithm for comparing unknown continuous variable states using limited and noisy data. The algorithm works on non-Gaussian quantum states for which similarity testing could not be achieved with previous techniques. Our approach is based on a convolutional neural network that assesses the similarity of quantum states based on a lower-dimensional state representation built from measurement data. The network can be trained off-line with classically simulated data from a fiducial set of states sharing structural similarities with the states to be tested, with experimental data generated by measurements on the fiducial states, or with a combination of simulated and experimental data. We test the performance of the model on noisy cat states and states generated by arbitrary selective number-dependent phase gates. Our network can also be applied to the problem of comparing continuous variable states across different experimental platforms, with different sets of achievable measurements, and to the problem of experimentally testing whether two states are equivalent up to Gaussian unitary transformations.
- 22 May 2023
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 130 (21) , 210601
Quantum Similarity Testing with Convolutional Neural Networks
The task of testing whether two uncharacterized quantum devices behave in the same way is crucial for benchmarking near-term quantum computers and quantum simulators, but has so far remained open for continuous variable quantum systems. In this Letter, we develop a machine learning algorithm for comparing unknown continuous variable states using limited and noisy data. The algorithm works on non-Gaussian quantum states for which similarity testing could not be achieved with previous techniques. Our approach is based on a convolutional neural network that assesses the similarity of quantum states based on a lower-dimensional state representation built from measurement data. The network can be trained off-line with classically simulated data from a fiducial set of states sharing structural similarities with the states to be tested, with experimental data generated by measurements on the fiducial states, or with a combination of simulated and experimental data. We test the performance of the model on noisy cat states and states generated by arbitrary selective number-dependent phase gates. Our network can also be applied to the problem of comparing continuous variable states across different experimental platforms, with different sets of achievable measurements, and to the problem of experimentally testing whether two states are equivalent up to Gaussian unitary transformations.
- Open Access
- 20 October 2022
- Published by Springer Nature in Nature Communications
- Vol. 13 (1) , 1-10
Flexible learning of quantum states with generative query neural networks
Deep neural networks are a powerful tool for characterizing quantum states. Existing networks are typically trained with experimental data gathered from the quantum state that needs to be characterized. But is it possible to train a neural network offline, on a different set of states? Here we introduce a network that can be trained with classically simulated data from a fiducial set of states and measurements, and can later be used to characterize quantum states that share structural similarities with the fiducial states. With little guidance of quantum physics, the network builds its own data-driven representation of a quantum state, and then uses it to predict the outcome statistics of quantum measurements that have not been performed yet. The state representations produced by the network can also be used for tasks beyond the prediction of outcome statistics, including clustering of quantum states and identification of different phases of matter.
- 20 October 2022
- Published by Springer Nature in Nature Communications
- Vol. 13 (1) , 1-10
Open AccessFlexible learning of quantum states with generative query neural networks
Deep neural networks are a powerful tool for characterizing quantum states. Existing networks are typically trained with experimental data gathered from the quantum state that needs to be characterized. But is it possible to train a neural network offline, on a different set of states? Here we introduce a network that can be trained with classically simulated data from a fiducial set of states and measurements, and can later be used to characterize quantum states that share structural similarities with the fiducial states. With little guidance of quantum physics, the network builds its own data-driven representation of a quantum state, and then uses it to predict the outcome statistics of quantum measurements that have not been performed yet. The state representations produced by the network can also be used for tasks beyond the prediction of outcome statistics, including clustering of quantum states and identification of different phases of matter.
- Open Access
- 21 June 2022
- Published by Springer Nature in npj Quantum Information
- Vol. 8 (1) , 1-9
Quantum causal unravelling
Complex processes often arise from sequences of simpler interactions involving a few particles at a time. These interactions, however, may not be directly accessible to experiments. Here we develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process, under the assumption that the process has bounded information loss and induces causal dependencies whose strength is above a fixed (but otherwise arbitrary) threshold. Our method is based on a quantum algorithm whose complexity scales polynomially in the total number of input/output systems, in the dimension of the systems involved in each interaction, and in the inverse of the chosen threshold for the strength of the causal dependencies. Under additional assumptions, we also provide a second algorithm that has lower complexity and requires only local state preparation and local measurements. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography. Similarly, they can be used to identify useful communication channels in quantum networks, and to test the internal structure of uncharacterized quantum circuits.
- 21 June 2022
- Published by Springer Nature in npj Quantum Information
- Vol. 8 (1) , 1-9
Open AccessQuantum causal unravelling
Complex processes often arise from sequences of simpler interactions involving a few particles at a time. These interactions, however, may not be directly accessible to experiments. Here we develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process, under the assumption that the process has bounded information loss and induces causal dependencies whose strength is above a fixed (but otherwise arbitrary) threshold. Our method is based on a quantum algorithm whose complexity scales polynomially in the total number of input/output systems, in the dimension of the systems involved in each interaction, and in the inverse of the chosen threshold for the strength of the causal dependencies. Under additional assumptions, we also provide a second algorithm that has lower complexity and requires only local state preparation and local measurements. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography. Similarly, they can be used to identify useful communication channels in quantum networks, and to test the internal structure of uncharacterized quantum circuits.