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

• URL: http://arxiv.org/abs/2602.05777v1
• Date: Thu, 05 Feb 2026 15:37:59 GMT
• Title: Efficient implementation of arbitrary Hermitian-preserving and trace-preserving maps
• Authors: Weizhou Cai, Zi-Jie Chen, Xuanqiang Zhao, Xin Wang, Guang-Can Guo, Luyan Sun, Chang-Ling Zou,
• Abstract summary: Quantum control has been a cornerstone of quantum information science, driving advances in quantum computing, quantum communication, and quantum sensing.<n>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.<n>Here we present an efficient and fully constructive method for implementing arbitrary HPTP maps.
• Score: 6.1993527059891465
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• A Resource Efficient Quantum Kernel [0.6299766708197881]
  We introduce a quantum feature map designed to handle high-dimensional data with a significantly reduced number of qubits and entangling operations.<n>Our approach preserves essential data characteristics while promoting computational efficiency.<n>Our findings herald a promising avenue for the practical implementation of quantum machine learning algorithms on near future quantum computing platforms.
  arXiv  Detail & Related papers  (2025-07-04T16:12:57Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Realizing Non-Physical Actions through Hermitian-Preserving Map Exponentiation [1.0255759863714506]
  We introduce the Hermitian-preserving mapiation algorithm, which can effectively realize the action of an arbitrary Hermitian-preserving map by encoding its output into a quantum process. Our findings present a pathway for systematically and efficiently implementing non-physical actions with quantum devices.
  arXiv  Detail & Related papers  (2023-08-15T18:00:04Z)
• Completely Positive Map for Noisy Driven Quantum Systems Derived by Keldysh Expansion [39.58317527488534]
  We introduce a decoherence model based on the Keldysh formalism. This formalism allows us to include non-periodic drives and correlated quantum noise in our model. We demonstrate that this strategy generates pulses that mitigate correlated quantum noise in qubit state-transfer and gate operations.
  arXiv  Detail & Related papers  (2023-03-20T23:05:24Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Selective and efficient quantum process tomography for non-trace preserving maps: a superconducting quantum processor implementation [0.0]
  We describe a general type of quantum process that does not preserve the trace of the input quantum state. We show that with the aid of it a priori information on the losses structure of the quantum channel, the reconstruction can be adapted to reconstruct the non-trace-preserving map. Our results show that it is possible to efficiently reconstruct non trace-preserving processes, with high precision, and with significantly higher fidelity than when the process is assumed to be trace-preserving.
  arXiv  Detail & Related papers  (2022-05-20T22:36:16Z)
• Estimating gate-set properties from random sequences [0.0]
  Current quantum devices are only capable of short unstructured gate sequences followed by native measurements. A single experiment - random sequence estimation - solves a wealth of estimation problems. We derive robust channel variants of shadow estimation with close-to-optimal performance guarantees.
  arXiv  Detail & Related papers  (2021-10-25T18:01:25Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.