This framework provides foundational tools for exploring quantum information regardless of whether the physical world using finite- or infinite-dimensional spaces, and shows that the operational interpretation of entropic quantities through these achievable rates constitutes a universal principle beyond finite dimensions.
Abstract
Quantum information decoupling is a pillar of quantum information theory, underlying quantum communication, error correction, and information recovery. However, its existing formulations rely on random unitary operations tied to finite-dimensional assumptions on quantum systems. Here we establish a decoupling framework for arbitrary separable, possibly infinite-dimensional systems. For finite-dimensional inputs and arbitrary separable reference/output systems, we derive error bounds on one-shot decoupling for completely positive maps in terms of sandwiched R\'enyi conditional entropies. For partial-trace decoupling with finite-dimensional references, the error exponent is optimal up to the known critical rate. To handle infinite-dimensional inputs, we assume finite entropy of the manipulated system. We construct finite-rank projections on independent and identically distributed (IID) states to restrict randomization to a projected finite-dimensional subspace, while ensuring high success probability by including auxiliary components in the discarded subsystem at asymptotically negligible cost. This leads to an infinite-dimensional IID partial-trace decoupling protocol achieving optimal asymptotic dimension rates. As an application, we construct an infinite-dimensional quantum-state-merging protocol, a mother protocol of quantum information theory. Under finite entropy of Alice's marginal, it achieves the same quantum-communication and total-cost rates as in finite dimensions, governed by mutual information and conditional entropy. These results show that the operational interpretation of entropic quantities through these achievable rates constitutes a universal principle beyond finite dimensions. More broadly, our framework provides foundational tools for exploring quantum information regardless of whether we model the physical world using finite- or infinite-dimensional spaces.
Programmable quantum devices nominally act on a Hilbert space whose dimension grows exponentially with the number of constituents, but the presence of noise makes it unlikely that they remain coherent across all of this immense Hilbert space. Then, what is the effective coherent quantum dimension that should be associa...
Quantum state ensembles are important in quantum information processing. For example, quantum $t$-designs model highly entangled states in complex systems, while projected ensembles appear in generative quantum machine learning and studies of thermalization. With their sample state accompanied by a classical label, the...
Coherent states bridge the gap between quantum and classical physics, but their overcomplete and nonorthogonal nature makes it difficult to identify the minimal discrete set needed to reconstruct quantum information. Finite spin-coherent tomography and discrete coherent-state operator bases are known, but here we addre...
Marcin Rudziński, A. Goldberg, A. B. Klimov et al.· 0 citations
The recovery of quantum information after subsystem loss is a central challenge in quantum information processing. However, some states remain beyond the reach of any recovery strategies. Here we identify the algebraic origin of virtual irrecoverability, the \emph{ghost information}---correlations encoded in the global...
We introduce determinant quantum-quantum Monte Carlo (DQ$^2$MC), a quantum algorithm that lifts the auxiliary-field sampling and averaging at the operational core of determinant quantum Monte Carlo onto a quantum computer. A determinant oracle synthesizes the DQMC amplitudes directly from a block encoding of the single...
This work establishes the first rigorous finite-$n bounds on quantum resource testing and hence quantum resource manipulation, thus strengthening the GQSL and providing explicit estimates on the number of copies needed to achieve a prescribed performance.
Dmitry Grinko, Ludovico Lami· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.