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:2308.07956 · npj Quantum Information

Simulating non-completely positive actions via exponentiation of Hermitian-preserving maps

Fuchuan Wei, Zhenhuan Liu, Guoding Liu, Zizhao Han, Dong-Ling Deng, Zhengwei Liu

Published Dec 30, 2024• 15 citations
arXivHTMLPDF

Abstract

Legitimate quantum operations must adhere to principles of quantum mechanics, particularly the requirements of complete positivity and trace preservation. Yet, non-completely positive maps, especially Hermitian-preserving maps, play a crucial role in quantum information science. Here, we introduce the Hermitian-preserving map exponentiation algorithm, which can effectively simulate the action of an arbitrary Hermitian-preserving map by exponentiating its output, $${\mathcal{N}}(\rho )$$ , into a quantum process, $${e}^{-i{\mathcal{N}}(\rho )t}$$ . We analyze the sample complexity of this algorithm and prove its optimality in certain cases. Utilizing positive but not completely positive maps, this algorithm provides exponential speedups in entanglement detection and quantification compared to protocols based on single-copy operations. In addition, it facilitates the encoding-free recovery of noiseless quantum states from multiple noisy ones by simulating the inverse map of the corresponding noise channel, providing a new approach to handling quantum noises. This algorithm acts as a building block of large-scale quantum algorithms and presents a pathway for exploring potential quantum speedups across a wide range of information-processing tasks.

DOI
10.1038/s41534-024-00949-z

Related papers

Efficient implementation of arbitrary Hermitian-preserving and trace-preserving maps

Weizhou Cai, Zi-Jie Chen, Xuanqiang Zhao +4 more

Quantum control has been a cornerstone of quantum information science, driving major advances in quantum computing, quantum communication, and quantum sensing. Over the years, it has enabled the implementation of arbitrary completely positive and trace-preserving (CPTP) maps; an important next step is to extend control to Hermitian-preserving and trace-preserving (HPTP) maps, which underpin applications such as entanglement detection, quantum error mitigation, quantum simulation, and quantum machine learning. Here we present an efficient and fully constructive method for implementing arbitrary HPTP maps. Unlike existing methods that decompose an HPTP map into multiple CPTP maps or approximate it using bipartite Hamiltonians with large Hilbert spaces, our approach compiles a target HPTP map into a single executable CPTP map whose Kraus rank is guaranteed to be no larger than the intrinsic rank of the target HPTP map plus one, followed by simple classical post-processing. Numerical results for inverse noise channels used in quantum error mitigation, including bosonic photon loss, confirm substantial reductions in resources and highlight scalability in higher-dimensional settings. Together with our numerical benchmarks, these results validate the efficiency and versatility of the proposed framework, opening a route to broader quantum-information applications enabled by HPTP processing.

quant-pharXiv:2602.05777•Feb 6, 2026•1 citation

On the relevance of Hermitian-preserving trace-preserving linear maps in asymptotic information retrieval in quantum communication

Arindam Mitra, Jatin Ghai

In quantum technologies, quantum channels are essential for transmitting quantum states. Quantum channels usually introduce noise, thereby reducing the information in a state. These are mathematically described by completely positive trace-preserving linear maps that represent the generic evolution of quantum systems and are also special cases of Hermitian-preserving trace-preserving (HPTP) linear maps. Concatenating a quantum channel with another quantum channel makes it noisier and degrades its information and resource preservability. In this work, we demonstrate a physically meaningful way to compare a pair of quantum channels using Hermitian-preserving trace-preserving linear maps. Precisely, given a pair of quantum channels $Λ_1, Λ_2$ and an arbitrary unknown input state, we show that the output state of the quantum channel $Λ_2$ from the pair can be uniquely identified from the output statistics of the other channel $Λ_1$ from the pair, using some POVM, iff $Λ_2$ can be obtained from $Λ_1$ by concatenating it with a Hermitian-preserving trace-preserving linear map that is not necessarily positive. In such cases, $Λ_2$ may not always be obtained from $Λ_1$ through post-processing. The relation between these channels is a preorder, and we study its characterization in this work. In other words, we provide an operational interpretation of this preorder induced by HPTP linear maps in a communication scenario. Furthermore, we characterize the difficulty of implementing $Λ_2$ given that $Λ_1$ has already been implemented via a quantifier, namely, physical implementability. We also illustrate the implications of our results for the incompatibility of quantum devices through an example. In short, we provide valuable insights about the relevance of Hermitian-preserving trace-preserving linear maps in physically motivated settings.

quant-pharXiv:2512.07822•Dec 9, 2025•1 citation

Constructing positive maps from block matrices

Yu Jing Guo, Heng Fan

Positive maps are useful for detecting entanglement in quantum information theory. Any entangled state can be detected by some positive map. In this paper, the relation between positive block matrices and completely positive trace-preserving maps is characterized. Consequently, a new method for constructing decomposable maps from positive block matrices is derived. In addition, a method for constructing positive but not completely positive maps from Hermitian block matrices is also obtained.

arXiv:1212.5851•Journal of Physics A Mathematical and Theoretical•Jun 12, 2013•1 citation

BELT: Block Encoding of Linear Transformation on Density Matrices

Fuchuan Wei, Lu, Rundi, Yuguo Shao +3 more

Linear maps that are not completely positive play a crucial role in the study of quantum information, yet their non-completely positive nature renders them challenging to realize physically. The core difficulty lies in the fact that when acting such a map $\mathcal{N}$ on a state $ρ$, $\mathcal{N}(ρ)$ may not correspond to a valid density matrix, making it difficult to prepare directly in a physical system. We introduce Block Encoding of Linear Transformation (BELT), a systematic protocol that simulates arbitrary linear maps by embedding the output $\mathcal{N}(ρ)$ into a block of a unitary operator. BELT enables the manipulation and extraction of information about $\mathcal{N}(ρ)$ through coherent quantum evolution. Notably, BELT accommodates maps that fall outside the scope of quantum singular value transformation, such as the transpose map. BELT finds applications in entanglement detection, quantum channel inversion, and simulating pseudo-differential operators, and demonstrates improved sample complexity compared to protocols based on Hermitian-preserving map exponentiation.

arXiv:2508.12858•Aug 18, 2025•1 citation

Extending quantum operations

Teiko Heinosaari, Maria Anastasia Jivulescu, David Reeb +1 more

For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.

arXiv:1205.0641•Journal of Mathematical Physics•Oct 1, 2012•45 citations

Single-Qubit Error Mitigation by Simulating Non-Markovian Dynamics

Mirko Rossini, Dominik Maile, Joachim Ankerhold +1 more

Quantum simulation is a powerful tool to study the properties of quantum systems. The dynamics of open quantum systems are often described by completely positive (CP) maps, for which several quantum simulation schemes exist. Such maps, however, represent only a subset of a larger class of maps: the general dynamical maps which are linear, Hermitian preserving, and trace preserving but not necessarily positivity preserving. Here we present a simulation scheme for these general dynamical maps, which occur when the underlying system-reservoir model undergoes entangling (and thus non-Markovian) dynamics. Such maps also arise as the inverse of CP maps, which are commonly used in error mitigation. We illustrate our simulation scheme on an IBM quantum processor, demonstrating its ability to recover the initial state of a Lindblad evolution. This paves the way for a novel form of quantum error mitigation. Our scheme only requires one ancilla qubit as an overhead and a small number of one and two qubit gates. Consequently, we expect it to be of practical use in near-term quantum devices.

arXiv:2303.03268•Physical Review Letters•Sep 15, 2023•13 citations
Legitimate quantum operations must adhere to principles of quantum mechanics, particularly the requirements of complete positivity and trace preservation. Yet, non-completely positive maps, especially Hermitian-preserving maps, play a crucial role in quantum information science. Here, we introduce the Hermitian-preserving map exponentiation algorithm, which can effectively simulate the action of an arbitrary Hermitian-preserving map by exponentiating its output, N(ρ){\mathcal{N}}(\rho )N(ρ) , into a quantum process, e−iN(ρ)t{e}^{-i{\mathcal{N}}(\rho )t}e−iN(ρ)t . We analyze the sample complexity of this algorithm and prove its optimality in certain cases. Utilizing positive but not completely positive maps, this algorithm provides exponential speedups in entanglement detection and quantification compared to protocols based on single-copy operations. In addition, it facilitates the encoding-free recovery of noiseless quantum states from multiple noisy ones by simulating the inverse map of the corresponding noise channel, providing a new approach to handling quantum noises. This algorithm acts as a building block of large-scale quantum algorithms and presents a pathway for exploring potential quantum speedups across a wide range of information-processing tasks.
Quantum control has been a cornerstone of quantum information science, driving major advances in quantum computing, quantum communication, and quantum sensing. Over the years, it has enabled the implementation of arbitrary completely positive and trace-preserving (CPTP) maps; an important next step is to extend control to Hermitian-preserving and trace-preserving (HPTP) maps, which underpin applications such as entanglement detection, quantum error mitigation, quantum simulation, and quantum machine learning. Here we present an efficient and fully constructive method for implementing arbitrary HPTP maps. Unlike existing methods that decompose an HPTP map into multiple CPTP maps or approximate it using bipartite Hamiltonians with large Hilbert spaces, our approach compiles a target HPTP map into a single executable CPTP map whose Kraus rank is guaranteed to be no larger than the intrinsic rank of the target HPTP map plus one, followed by simple classical post-processing. Numerical results for inverse noise channels used in quantum error mitigation, including bosonic photon loss, confirm substantial reductions in resources and highlight scalability in higher-dimensional settings. Together with our numerical benchmarks, these results validate the efficiency and versatility of the proposed framework, opening a route to broader quantum-information applications enabled by HPTP processing.
In quantum technologies, quantum channels are essential for transmitting quantum states. Quantum channels usually introduce noise, thereby reducing the information in a state. These are mathematically described by completely positive trace-preserving linear maps that represent the generic evolution of quantum systems and are also special cases of Hermitian-preserving trace-preserving (HPTP) linear maps. Concatenating a quantum channel with another quantum channel makes it noisier and degrades its information and resource preservability. In this work, we demonstrate a physically meaningful way to compare a pair of quantum channels using Hermitian-preserving trace-preserving linear maps. Precisely, given a pair of quantum channels Λ1,Λ2Λ_1, Λ_2Λ1​,Λ2​ and an arbitrary unknown input state, we show that the output state of the quantum channel Λ2Λ_2Λ2​ from the pair can be uniquely identified from the output statistics of the other channel Λ1Λ_1Λ1​ from the pair, using some POVM, iff Λ2Λ_2Λ2​ can be obtained from Λ1Λ_1Λ1​ by concatenating it with a Hermitian-preserving trace-preserving linear map that is not necessarily positive. In such cases, Λ2Λ_2Λ2​ may not always be obtained from Λ1Λ_1Λ1​ through post-processing. The relation between these channels is a preorder, and we study its characterization in this work. In other words, we provide an operational interpretation of this preorder induced by HPTP linear maps in a communication scenario. Furthermore, we characterize the difficulty of implementing Λ2Λ_2Λ2​ given that Λ1Λ_1Λ1​ has already been implemented via a quantifier, namely, physical implementability. We also illustrate the implications of our results for the incompatibility of quantum devices through an example. In short, we provide valuable insights about the relevance of Hermitian-preserving trace-preserving linear maps in physically motivated settings.
Linear maps that are not completely positive play a crucial role in the study of quantum information, yet their non-completely positive nature renders them challenging to realize physically. The core difficulty lies in the fact that when acting such a map N\mathcal{N}N on a state ρρρ, N(ρ)\mathcal{N}(ρ)N(ρ) may not correspond to a valid density matrix, making it difficult to prepare directly in a physical system. We introduce Block Encoding of Linear Transformation (BELT), a systematic protocol that simulates arbitrary linear maps by embedding the output N(ρ)\mathcal{N}(ρ)N(ρ) into a block of a unitary operator. BELT enables the manipulation and extraction of information about N(ρ)\mathcal{N}(ρ)N(ρ) through coherent quantum evolution. Notably, BELT accommodates maps that fall outside the scope of quantum singular value transformation, such as the transpose map. BELT finds applications in entanglement detection, quantum channel inversion, and simulating pseudo-differential operators, and demonstrates improved sample complexity compared to protocols based on Hermitian-preserving map exponentiation.
For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.
Quantum simulation is a powerful tool to study the properties of quantum systems. The dynamics of open quantum systems are often described by completely positive (CP) maps, for which several quantum simulation schemes exist. Such maps, however, represent only a subset of a larger class of maps: the general dynamical maps which are linear, Hermitian preserving, and trace preserving but not necessarily positivity preserving. Here we present a simulation scheme for these general dynamical maps, which occur when the underlying system-reservoir model undergoes entangling (and thus non-Markovian) dynamics. Such maps also arise as the inverse of CP maps, which are commonly used in error mitigation. We illustrate our simulation scheme on an IBM quantum processor, demonstrating its ability to recover the initial state of a Lindblad evolution. This paves the way for a novel form of quantum error mitigation. Our scheme only requires one ancilla qubit as an overhead and a small number of one and two qubit gates. Consequently, we expect it to be of practical use in near-term quantum devices.