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:2507.17648

Reconstructing the unitary part of a noisy quantum channel

Romer, Adrian, Daniel M. Reich, Christiane P. Koch

Published Jul 23, 2025• 1 citation
arXivHTMLPDF

Abstract

We consider the problem of reconstructing the unitary describing the evolution of a quantum system, or quantum channel, from a set of input and output states. For ideal, fully coherent evolution, we show that the unitary can be reconstructed from two mixed states or $d+1$ pure states, where $d$ is the size of Hilbert space. The reconstruction method can be extended to approximate the unitary part of a dynamical map, provided the decoherence is not too strong to render this question meaningless. We exemplify the method for the example of the cross-resonance gate as well as a random set of unitaries, comparing the reconstruction from pure, respectively mixed, states to an approach based on the Choi matrix. We find that the pure state reconstruction requires the least amount of resources when the dynamics is close to unitary, whereas the mixed state approach outperforms the pure state reconstruction in terms of channel uses for appreciable decoherence. These conclusions hold also in the presence of SPAM errors and irrespective of the Hilbert space size.

DOI
10.48550/arxiv.2507.17648

Related papers

Exact quantum noise deconvolution with partial knowledge of noise

Nahid Ahmadvand, Laleh Memarzadeh

We introduce a new quantum noise deconvolution technique that requires neither complete knowledge of the noise nor partial noise tomography, and is applicable to any invertible quantum noise channel. In this new method, we construct a set of observables with completely correctable expectation values despite our incomplete knowledge of noise. This task is achieved just by classical post-processing without extra quantum resources. We show that the number of parameters in the subset of observables with correctable expectation values is the same for all unitary quantum channels. For mixed unitary channels and the assumption that the probability distribution of unitary errors is unknown, we instruct the construction of the set of observables with correctable expectation values. For a particular case where the mixed unitary channel is made of just two random unitary Kraus operators acting on $d$-dimensional Hilbert-space, we show that the observable with correctable expectation value belongs to a set with at least $d$ parameters. We extend our method by considering observables for which the partial recovery of the expectation value is possible, at the cost of having partial knowledge about the noise-free initial state.

arXiv:2505.08640•Physical Review A•Apr 3, 2026•0 citations

Random unitary maps for quantum state reconstruction

Seth Merkel, Carlos A. Riofrío, Steven T. Flammia +1 more

We study the possibility of performing quantum state reconstruction from a measurement record that is obtained as a sequence of expectation values of a Hermitian operator evolving under repeated application of a single random unitary map, ${U}_{0}$. We show that while this single-parameter orbit in operator space is not informationally complete, it can be used to yield surprisingly high-fidelity reconstruction. For a $d$-dimensional Hilbert space with the initial observable in $\mathfrak{su}(d)$, the measurement record lacks information about a matrix subspace of dimension $\ensuremath{\geqslant}d\ensuremath{-}2$ out of the total dimension ${d}^{2}\ensuremath{-}1$. We determine the conditions on ${U}_{0}$ such that the bound is saturated, and show they are achieved by almost all pseudorandom unitary matrices. When we further impose the constraint that the physical density matrix must be positive, we obtain even higher fidelity than that predicted from the missing subspace. With prior knowledge that the state is pure, the reconstruction will be perfect (in the limit of vanishing noise) and for arbitrary mixed states, the fidelity is over $0.96$, even for small $d$, and reaching $\mathcal{F}>0.99$ for $d>9$. We also study the implementation of this protocol based on the relationship between random matrices and quantum chaos. We show that the Floquet operator of the quantum kicked top provides a means of generating the required type of measurement record, with implications on the relationship between quantum chaos and information gain.

arXiv:0912.2101•Physical Review A•Mar 31, 2010•37 citations

Reconstruction of Hamiltonians from given time evolutions

Julia Bernatska, ANTONINO MESSINA

In this paper we propose a systematic method to solve the inverse dynamical problem for a quantum system governed by the von Neumann equation: to find a class of Hamiltonians reproducing a prescribed time evolution of a pure or mixed state of the system. Our approach exploits the equivalence between an action of the group of evolution operators over the state space and an adjoint action of the unitary group over Hermitian matrices. The method is illustrated by two examples involving a pure and a mixed state.

arXiv:1006.5183•Physica Scripta•Dec 7, 2011•2 citations

Semidefinite Programming for Quantum Channel Learning

Mikhail Gennadievich Belov, Victor Victorovich Dubov, Vadim Konstantinovich Ivanov +3 more

The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state, projective operators, unitary learning, and others), Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi matrix. A remarkable feature of SDP is that the optimization is convex, which allows the problem to be efficiently solved by a variety of numerical algorithms. We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of quantum channels of different forms. A notable feature is that the Kraus rank of the obtained quantum channel typically comprises less than a few percent of its maximal possible value. This suggests that a relatively small Kraus rank quantum channel is typically sufficient to describe experimentally observed classical data. The theory was also applied to the problem of reconstructing projective operators from data. Finally, we discuss a classical computational model based on quantum channel transformation, performed and calculated on a classical computer, possibly hardware-optimized.

cs.LGCross-listedarXiv:2601.12502•Physical review. E•Jan 20, 2026•0 citations

Quantum Channels and Quantum Operations

Reinhold A. Bertlmann, Nicolai Friis

Abstract In this chapter we visit the ‘church of the larger Hilbert space’: we take a closer look at the relationship of pure and mixed quantum states via purification, and discuss a similar connection between completely positive and trace-preserving (CPTP) maps and unitary dynamics on a larger Hilbert space. We show that such CPTP maps, which represent quantum channels, are equivalent to operations admitting a Kraus decomposition, as well as to unitary dynamics on a larger Hilbert space with factoring initial condition, the famous Stinespring dilation of quantum operations. In this context we introduce the Choi-Jamiołkowski isomorphism, which expresses a duality between maps between two Hilbert spaces and states on tensor products of these Hilbert spaces, and we review several important examples of quantum channels such as the dephasing channel, amplitude-damping channel, and depolarizing channel. Finally, we examine operations that are not possible in quantum theory, focusing on the no-cloning theorem.

•Sep 7, 2023•1 citation

Channel kets, entangled states, and the location of quantum information

Robert B. Griffiths

The well-known duality relating entangled states and noisy quantum channels is expressed in terms of a channel ket, a pure state on a suitable tripartite system, which functions as a pre-probability allowing the calculation of statistical correlations between, for example, the entrance and exit of a channel, once a framework has been chosen so as to allow a consistent set of probabilities. In each framework the standard notions of ordinary (classical) information theory apply, and it makes sense to ask whether information of a particular sort about one system is or is not present in another system. Quantum effects arise when a single pre-probability is used to compute statistical correlations in different incompatible frameworks, and various constraints on the presence and absence of different kinds of information are expressed in a set of all-or-nothing theorems which generalize or give a precise meaning to the concept of ``no-cloning.'' These theorems are used to discuss the location of information in quantum channels modeled using a mixed-state environment, the classical-quantum channels introduced by Holevo, and the location of information in the physical carriers of a quantum code. It is proposed that both channel and entanglement problems be classified in terms of pure states (functioning as pre-probabilities) on systems of $p\ensuremath{\geqslant}2$ parts, with mixed bipartite entanglement and simple noisy channels belonging to the category $p=3$, a five-qubit code to the category $p=6$, etc., then by the dimensions of the Hilbert spaces of the component parts, along with other criteria yet to be determined.

arXiv:quant-ph/0409106•Physical Review A•Apr 28, 2005•22 citations
We consider the problem of reconstructing the unitary describing the evolution of a quantum system, or quantum channel, from a set of input and output states. For ideal, fully coherent evolution, we show that the unitary can be reconstructed from two mixed states or d+1d+1d+1 pure states, where ddd is the size of Hilbert space. The reconstruction method can be extended to approximate the unitary part of a dynamical map, provided the decoherence is not too strong to render this question meaningless. We exemplify the method for the example of the cross-resonance gate as well as a random set of unitaries, comparing the reconstruction from pure, respectively mixed, states to an approach based on the Choi matrix. We find that the pure state reconstruction requires the least amount of resources when the dynamics is close to unitary, whereas the mixed state approach outperforms the pure state reconstruction in terms of channel uses for appreciable decoherence. These conclusions hold also in the presence of SPAM errors and irrespective of the Hilbert space size.
We introduce a new quantum noise deconvolution technique that requires neither complete knowledge of the noise nor partial noise tomography, and is applicable to any invertible quantum noise channel. In this new method, we construct a set of observables with completely correctable expectation values despite our incomplete knowledge of noise. This task is achieved just by classical post-processing without extra quantum resources. We show that the number of parameters in the subset of observables with correctable expectation values is the same for all unitary quantum channels. For mixed unitary channels and the assumption that the probability distribution of unitary errors is unknown, we instruct the construction of the set of observables with correctable expectation values. For a particular case where the mixed unitary channel is made of just two random unitary Kraus operators acting on ddd-dimensional Hilbert-space, we show that the observable with correctable expectation value belongs to a set with at least ddd parameters. We extend our method by considering observables for which the partial recovery of the expectation value is possible, at the cost of having partial knowledge about the noise-free initial state.
We study the possibility of performing quantum state reconstruction from a measurement record that is obtained as a sequence of expectation values of a Hermitian operator evolving under repeated application of a single random unitary map, U0{U}_{0}U0​. We show that while this single-parameter orbit in operator space is not informationally complete, it can be used to yield surprisingly high-fidelity reconstruction. For a ddd-dimensional Hilbert space with the initial observable in su(d)\mathfrak{su}(d)su(d), the measurement record lacks information about a matrix subspace of dimension $\ensuremath{\geqslant}d\ensuremath{-}2$ out of the total dimension ${d}^{2}\ensuremath{-}1$. We determine the conditions on U0{U}_{0}U0​ such that the bound is saturated, and show they are achieved by almost all pseudorandom unitary matrices. When we further impose the constraint that the physical density matrix must be positive, we obtain even higher fidelity than that predicted from the missing subspace. With prior knowledge that the state is pure, the reconstruction will be perfect (in the limit of vanishing noise) and for arbitrary mixed states, the fidelity is over 0.960.960.96, even for small ddd, and reaching F>0.99\mathcal{F}>0.99F>0.99 for d>9d>9d>9. We also study the implementation of this protocol based on the relationship between random matrices and quantum chaos. We show that the Floquet operator of the quantum kicked top provides a means of generating the required type of measurement record, with implications on the relationship between quantum chaos and information gain.
In this paper we propose a systematic method to solve the inverse dynamical problem for a quantum system governed by the von Neumann equation: to find a class of Hamiltonians reproducing a prescribed time evolution of a pure or mixed state of the system. Our approach exploits the equivalence between an action of the group of evolution operators over the state space and an adjoint action of the unitary group over Hermitian matrices. The method is illustrated by two examples involving a pure and a mixed state.
The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state, projective operators, unitary learning, and others), Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi matrix. A remarkable feature of SDP is that the optimization is convex, which allows the problem to be efficiently solved by a variety of numerical algorithms. We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of quantum channels of different forms. A notable feature is that the Kraus rank of the obtained quantum channel typically comprises less than a few percent of its maximal possible value. This suggests that a relatively small Kraus rank quantum channel is typically sufficient to describe experimentally observed classical data. The theory was also applied to the problem of reconstructing projective operators from data. Finally, we discuss a classical computational model based on quantum channel transformation, performed and calculated on a classical computer, possibly hardware-optimized.
Abstract In this chapter we visit the ‘church of the larger Hilbert space’: we take a closer look at the relationship of pure and mixed quantum states via purification, and discuss a similar connection between completely positive and trace-preserving (CPTP) maps and unitary dynamics on a larger Hilbert space. We show that such CPTP maps, which represent quantum channels, are equivalent to operations admitting a Kraus decomposition, as well as to unitary dynamics on a larger Hilbert space with factoring initial condition, the famous Stinespring dilation of quantum operations. In this context we introduce the Choi-Jamiołkowski isomorphism, which expresses a duality between maps between two Hilbert spaces and states on tensor products of these Hilbert spaces, and we review several important examples of quantum channels such as the dephasing channel, amplitude-damping channel, and depolarizing channel. Finally, we examine operations that are not possible in quantum theory, focusing on the no-cloning theorem.
The well-known duality relating entangled states and noisy quantum channels is expressed in terms of a channel ket, a pure state on a suitable tripartite system, which functions as a pre-probability allowing the calculation of statistical correlations between, for example, the entrance and exit of a channel, once a framework has been chosen so as to allow a consistent set of probabilities. In each framework the standard notions of ordinary (classical) information theory apply, and it makes sense to ask whether information of a particular sort about one system is or is not present in another system. Quantum effects arise when a single pre-probability is used to compute statistical correlations in different incompatible frameworks, and various constraints on the presence and absence of different kinds of information are expressed in a set of all-or-nothing theorems which generalize or give a precise meaning to the concept of ``no-cloning.'' These theorems are used to discuss the location of information in quantum channels modeled using a mixed-state environment, the classical-quantum channels introduced by Holevo, and the location of information in the physical carriers of a quantum code. It is proposed that both channel and entanglement problems be classified in terms of pure states (functioning as pre-probabilities) on systems of $p\ensuremath{\geqslant}2$ parts, with mixed bipartite entanglement and simple noisy channels belonging to the category p=3p=3p=3, a five-qubit code to the category p=6p=6p=6, etc., then by the dimensions of the Hilbert spaces of the component parts, along with other criteria yet to be determined.