2026-06-29T08:19:36Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/962162025-09-18T15:51:12Zcom_20.500.14352_14col_20.500.14352_15

Resource Quantification for the No-Programing Theorem Kubicki, Aleksander M. Pérez García, David Palazuelos Cabezón, Carlos Mathematical Physics Quantum computations Quantum information processing Quantum memories Quantum teleportation Física matemática 22 Física 12 Matemáticas The no-programing theorem prohibits the existence of a universal programmable quantum processor. This statement has several implications in relation to quantum computation but also to other tasks of quantum information processing, making this construction a central notion in this context. Nonetheless, it is well known that, even when the strict model is not implementable, it is possible to conceive of it in an approximate sense. Unfortunately, the minimal resources necessary for this aim are still not completely understood. Here, we investigate quantitative statements of the theorem, improving exponentially previous bounds on the resources required by such a hypothetical machine. The proofs exploit a new connection between quantum channels and embeddings between Banach spaces which allows us to use classical tools from geometric Banach space theory in a clean and simple way. Depto. de Análisis Matemático y Matemática Aplicada Fac. de Ciencias Matemáticas TRUE pub 2024-01-29T16:30:47Z 2024-01-29T16:30:47Z 2019 journal article https://hdl.handle.net/20.500.14352/96216 0031-9007 10.1103/physrevlett.122.080505 eng A. M. Kubicki, C. Palazuelos, and D. Pérez-García, Resource Quantification for the No-Programing Theorem, Phys. Rev. Lett. 122, 080505 (2019). open access application/pdf American Physical Society