Infinite-Dimensional Programmable Quantum Processors
arXiv:2012.00736 · doi:10.1103/PRXQuantum.2.030308
Abstract
A universal programmable quantum processor uses program quantum states to apply an arbitrary quantum channel to an input state. We generalize the concept of a finite-dimensional programmable quantum processor to infinite dimension assuming an energy constraint on the input and output of the target quantum channels. By proving reductions to and from finite-dimensional processors, we obtain upper and lower bounds on the program dimension required to approximately implement energy-limited quantum channels. In particular, we consider the implementation of Gaussian channels. Due to their practical relevance, we investigate the resource requirements for gauge-covariant Gaussian channels. Additionally, we give upper and lower bounds on the program dimension of a processor implementing all Gaussian unitary channels. These lower bounds rely on a direct information-theoretic argument, based on the generalization from finite to infinite dimension of a certain replication lemma for unitaries.
arXiv comment38 pages, 2 figures, published version
References in corpus (26)
- Mixed State Entanglement and Quantum Error Correction
- Quantum information with continuous variables
- Gaussian Quantum Information
- Quantum key distribution using gaussian-modulated coherent states
- Fundamental Limits of Repeaterless Quantum Communications
- General Benchmarks for Quantum Repeaters
- Advances in Photonic Quantum Sensing
- Coding Theorem and Strong Converse for Quantum Channels
- The Real Symplectic Groups in Quantum Mechanics and Optics
- Composable security proof for continuous-variable quantum key distribution with coherent states
- Programmable quantum gate arrays
- Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
- Ultimate communication capacity of quantum optical channels by solving the Gaussian minimum-entropy conjecture
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Simplified instantaneous non-local quantum computation with applications to position-based cryptography
- Fundamental limits to quantum channel discrimination
- Ultimate Precision of Adaptive Noise Estimation
- Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
- Energy-constrained diamond norms and their use in quantum information theory
- Energy-constrained discrimination of unitaries, quantum speed limits and a Gaussian Solovay-Kitaev theorem
- Asymptotic performance of port-based teleportation
- Resource Quantification for the No-Programming Theorem
- Convergence rates for quantum evolution & entropic continuity bounds in infinite dimensions
- Continuity bounds for information characteristics of quantum channels depending on input dimension
- Uniform continuity bounds for information characteristics of quantum channels depending on input dimension and on input energy
- Optimality of programmable quantum measurements
Cited by in corpus (4)
- Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
- Energy requirement for implementing unitary gates on energy-unbounded systems
- Linear programming with unitary-equivariant constraints
- Quantum Advantage in Storage and Retrieval of Isometry Channels