SearcharxivSearch

arXiv · 1912.02381

A factorization property of positive maps on $C^*$-algebras

Abstract

The purpose of this short note is to clarify and present a general version of an interesting observation by Piani and Mora (Physic. Rev. A 75, 012305 (2007)), linking complete positivity of linear maps on matrix algebras to decomposability of their ampliations. Let $A_i$, $C_i$ be unital C*-algebras and let $\alpha_i$ be positive linear maps from $A_i$ to $C_i,$ $i=1,2$. We obtain conditions under which any positive map $\beta$ from the minimal C*-tensor product $A_1 \otimes_{min} A_2$ to $C_1 \otimes_{min} C_2$, such that $ \alpha_1 \otimes \alpha_2 \geq \beta$, factorizes as $\beta = \gamma \otimes \alpha_2$ for some positive map $\gamma$. In particular we show that when $\alpha_i \colon A_i \rightarrow B(\mathcal H_i)$ are completely positive (CP) maps for some Hilbert spaces $\mathcal H_i$ $(i=1,2)$, and $\alpha_2$ is a pure CP map and $\beta$ is a CP map so that $\alpha_1 \otimes \alpha_2 - \beta$ is also CP, then $\beta = \gamma \otimes \alpha_2$ for some CP map $\gamma$. We show that a similar result holds in the context of positive linear maps when $A_2 = C_2 = B(\mathcal H)$ and $\alpha_2 = id$. As an application we extend \cite[IX Theorem]{PM}( revisited recently by Huber et al in \cite{HLLM}) to show that for any linear map $\tau$ from a unital C*-algebra $A$ to a C*-algebra $C$, if $\tau \otimes id_k$ is decomposable for some $k \geq 2$, where $id_k$ is the identity map on the algebra $M_k(\mathbb {C} )$ of $k\times k$ matrices, then $\tau $ is completely positive.

Explore related subjects

Keep this discovery

BibTeXRIS

B. V. Rajarma Bhat, Hiroyuki Osaka. 2019-12-05. A factorization property of positive maps on $C^*$-algebras. https://arxiv.org/abs/1912.02381

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph