Quantum Maps Between CPTP and HPTP

• URL: http://arxiv.org/abs/2308.01894v1
• Date: Thu, 3 Aug 2023 17:44:53 GMT
• Title: Quantum Maps Between CPTP and HPTP
• Authors: Ningping Cao, Maxwell Fitzsimmons, Zachary Mann, Rajesh Pereira, and Raymond Laflamme
• Abstract summary: Hermitian-preserving trace-preserving maps are considered as the local dynamic maps beyond CPTP. We show that the only locally well-defined maps are in $SNbackslash SP$, they live on the boundary of $SN$. We prove that the current quantum error correction scheme is still sufficient to correct quantum non-Markovian errors.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: For an open quantum system to evolve under CPTP maps, assumptions are made on the initial correlations between the system and the environment. Hermitian-preserving trace-preserving (HPTP) maps are considered as the local dynamic maps beyond CPTP. In this paper, we provide a succinct answer to the question of what physical maps are in the HPTP realm by two approaches. The first is by taking one step out of the CPTP set, which provides us with Semi-Positivity (SP) TP maps. The second way is by examining the physicality of HPTP maps, which leads to Semi-Nonnegative (SN) TP maps. Physical interpretations and geometrical structures are studied for these maps. The non-CP SPTP maps $\Psi$ correspond to the quantum non-Markovian process under the CP-divisibility definition ($\Psi = \Xi \circ \Phi^{-1}$, where $\Xi$ and $\Phi$ are CPTP). When removing the invertibility assumption on $\Phi$, we land in the set of SNTP maps. A by-product of set relations is an answer to the following question -- what kind of dynamics the system will go through when the previous dynamic $\Phi$ is non-invertible. In this case, the only locally well-defined maps are in $SN\backslash SP$, they live on the boundary of $SN$. Otherwise, the non-local information will be irreplaceable in the system's dynamic. With the understanding of physical maps beyond CPTP, we prove that the current quantum error correction scheme is still sufficient to correct quantum non-Markovian errors. In some special cases, lack of complete positivity could provide us with more error correction methods with less overhead.

Related papers

• Augmenting Lane Perception and Topology Understanding with Standard Definition Navigation Maps [51.24861159115138]
  Standard Definition (SD) maps are more affordable and have worldwide coverage, offering a scalable alternative. We propose a novel framework to integrate SD maps into online map prediction and propose a Transformer-based encoder, SD Map Representations from transFormers. This enhancement consistently and significantly boosts (by up to 60%) lane detection and topology prediction on current state-of-the-art online map prediction methods.
  arXiv  Detail & Related papers  (2023-11-07T15:42:22Z)
• Noncompletely Positive Quantum Maps Enable Efficient Local Energy Extraction in Batteries [0.0]
  Energy extraction from quantum batteries by means of completely positive trace-preserving maps leads to the concept of CPTP-local passive states. We show that energy can be extracted efficiently from CPTP-local passive states employing NCPTP but still physically realizable maps on the same part of the shared battery. We provide a necessary and sufficient condition and a separate necessary condition for an arbitrary bipartite state to be unable to supply any energy using non-completely positive trace-preserving operations on one party with respect to an arbitrary but fixed Hamiltonian.
  arXiv  Detail & Related papers  (2023-07-31T15:08:05Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• On the Extremality of the Tensor Product of Quantum Channels [0.0]
  We investigate the preservation of extremality under the tensor product. We prove that extremality is preserved for CPT or UCP maps, but for UCPT it is not always preserved.
  arXiv  Detail & Related papers  (2023-05-09T23:00:48Z)
• Linear maps as sufficient criteria for entanglement depth and compatibility in many-body systems [0.0]
  We extend results presented in [Phys. Rev A 93, 042335], where sufficient separability criteria for bipartite systems were derived. We derive criteria to detect arbitrary $(N-n)$-entanglement depth tailored to states in close vicinity of the completely depolarized state. We also provide separability (or $1$- entanglement depth) conditions in the symmetric sector, including for diagonal states.
  arXiv  Detail & Related papers  (2022-11-05T10:42:24Z)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• Guaranteeing Completely Positive Quantum Evolution [2.578242050187029]
  We transform an initial NCP map to a CP map through composition with the asymmetric depolarizing map. We prove that the composition can always be made CP without completely depolarizing in any direction. We show that asymmetric depolarization has many advantages over SPA in preserving the structure of the original NCP map.
  arXiv  Detail & Related papers  (2021-04-30T20:53:19Z)
• MP3: A Unified Model to Map, Perceive, Predict and Plan [84.07678019017644]
  MP3 is an end-to-end approach to mapless driving where the input is raw sensor data and a high-level command. We show that our approach is significantly safer, more comfortable, and can follow commands better than the baselines in challenging long-term closed-loop simulations.
  arXiv  Detail & Related papers  (2021-01-18T00:09:30Z)
• DAGMapper: Learning to Map by Discovering Lane Topology [84.12949740822117]
  We focus on drawing the lane boundaries of complex highways with many lanes that contain topology changes due to forks and merges. We formulate the problem as inference in a directed acyclic graphical model (DAG), where the nodes of the graph encode geometric and topological properties of the local regions of the lane boundaries. We show the effectiveness of our approach on two major North American Highways in two different states and show high precision and recall as well as 89% correct topology.
  arXiv  Detail & Related papers  (2020-12-22T21:58:57Z)
• Extreme Points and Factorizability for New Classes of Unital Quantum Channels [0.0]
  We introduce and study two new classes of unital quantum channels. We show that almost every map in this class is extreme in both the set of unital CP maps and the set of trace-preserving CP maps.
  arXiv  Detail & Related papers  (2020-06-05T13:13:18Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)

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.