Isometry operations encode the quantum information of the input system to a larger output system, while the corresponding decoding operation would be an inverse operation of the encoding isometry operation. Given an encoding operation as a black box from a d -dimensional system to a D -dimensional system, we propose a universal protocol for isometry inversion that constructs a decoder from multiple calls of the encoding operation. This is a probabilistic but exact protocol whose success probability is independent of D . For a qubit ( d=2 ) encoded in n qubits, our protocol achieves an exponential improvement over any tomography-based or unitary-embedding method, which cannot avoid D -dependence. We present a quantum operation that converts multiple parallel calls of any given isometry operation to random parallelized unitary operations, each of dimension d . Applied to our setup, it universally compresses the encoded quantum information to a D -independent space, while keeping the initial quantum information intact. This compressing operation is combined with a unitary inversion protocol to complete the isometry inversion. We also discover a fundamental difference between our isometry inversion protocol and the known unitary inversion protocols by analyzing isometry complex conjugation and isometry transposition. General protocols including indefinite causal order are searched using semidefinite programming for any improvement in the success probability over the parallel protocols. We find a sequential "success-or-draw" protocol of universal isometry inversion for d=2 and D=3 , thus whose success probability exponentially improves over parallel protocols in the number of calls of the input isometry operation for the said case.
Isometry operations encode the quantum information of the input system to a larger output system, while the corresponding decoding operation would be an inverse operation of the encoding isometry operation. Given an encoding operation as a black box from a d -dimensional system to a D -dimensional system, we propose a universal protocol for isometry inversion that constructs a decoder from multiple calls of the encoding operation. This is a probabilistic but exact protocol whose success probability is independent of D . For a qubit ( d=2 ) encoded in n qubits, our protocol achieves an exponential improvement over any tomography-based or unitary-embedding method, which cannot avoid D -dependence. We present a quantum operation that converts multiple parallel calls of any given isometry operation to random parallelized unitary operations, each of dimension d . Applied to our setup, it universally compresses the encoded quantum information to a D -independent space, while keeping the initial quantum information intact. This compressing operation is combined with a unitary inversion protocol to complete the isometry inversion. We also discover a fundamental difference between our isometry inversion protocol and the known unitary inversion protocols by analyzing isometry complex conjugation and isometry transposition. General protocols including indefinite causal order are searched using semidefinite programming for any improvement in the success probability over the parallel protocols. We find a sequential "success-or-draw" protocol of universal isometry inversion for d=2 and D=3 , thus whose success probability exponentially improves over parallel protocols in the number of calls of the input isometry operation for the said case.
Identification of possible transformations of quantum objects including quantum states and quantum operations is indispensable in developing quantum algorithms. Universal transformations, defined as input-independent transformations, appear in various quantum applications. Such is the case for universal transformations of unitary operations. However, extending these transformations to non-unitary operations is nontrivial and largely unresolved. Addressing this, we introduce isometry adjointation protocols that transform an input isometry operation into its adjoint operation, which include both unitary operation and quantum state transformations. The paper details the construction of parallel and sequential isometry adjointation protocols, derived from unitary inversion protocols using quantum combs and the (dual) Clebsch-Gordan transforms, and achieving optimal approximation error. This error is shown to be independent of the output dimension of the isometry operation. In particular, we explicitly obtain an asymptotically optimal parallel protocol achieving an approximation error ϵ=Θ(d2/n) , where d is the input dimension of the isometry operation and n is the number of calls of the isometry operation. The research also extends to isometry inversion and universal error detection, employing semidefinite programming to assess optimal performances. The findings suggest that the optimal performance of general protocols in isometry adjointation and universal error detection is not dependent on the output dimension, and that indefinite causal order protocols offer advantages over sequential ones in isometry inversion and universal error detection.
We report a deterministic and exact protocol to reverse any unknown qubit-unitary operation, which simulates the time inversion of a closed qubit system. To avoid known no-go results on universal deterministic exact unitary inversion, we consider the most general class of protocols transforming unknown unitary operations within the quantum circuit model, where the input unitary operation is called multiple times in sequence and fixed quantum circuits are inserted between the calls. In the proposed protocol, the input qubit-unitary operation is called 4 times to achieve the inverse operation, and the output state in an auxiliary system can be reused as a catalyst state in another run of the unitary inversion. We also present the simplification of the semidefinite programming for searching the optimal deterministic unitary inversion protocol for an arbitrary dimension presented by M. T. Quintino and D. Ebler [Quantum 6, 679 (2022)2521-327X10.22331/q-2022-03-31-679]. We show a method to reduce the large search space representing all possible protocols, which provides a useful tool for analyzing higher-order quantum transformations for unitary operations.
Given a quantum gate implementing a d-dimensional unitary operation U_{d}, without any specific description but d, and permitted to use k times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse U_{d}^{-1}, whose failure probability decays exponentially in k. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires that k≥d-1, proven necessary for the exact implementation of U_{d}^{-1} with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, k≥d-1 uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given k and d. The optimal values are computed using semidefinite programing solvers for k≤3 when d=2 and k≤2 for d=3. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.
We study the persistent quantum and classical memory required for exact heralded storage and retrieval of quantum measurements. Given only black-box access to the measurement channel, we construct an exact compression of the port-based program into an outcome-type record and a quantum register, with total dimension polynomial in the query count. For every universal retrieval processor we prove the bounds Q+C≥log2n and 2Q+C≥log2((n−1)d2+1) on the numbers Q of qubits and C of bits of the program, for n-outcome POVMs on Cd with d≥2. For n≥2, no finite classical memory removes the need for quantum memory: any such processor requires a quantum program of dimension at least d, at that dimension its classical alphabet must have at least n symbols, and both minima are attained by a single-query protocol with success 1/d2. Combining direct-program compression with a converse from approximate measurement programming gives logarithmic total-memory scaling in 1/(1−p) as the uniform success probability p approaches one, at fixed d,n≥2. At fixed input dimension and target success below one, the optimal total-memory scaling is logarithmic in n. We also construct self-contained programs under branch-decomposition access and compare the quantum and classical costs of all constructions, including where the outcome-type record is kept: for POVMs with n nonzero rank-one effects the direct program admits a purely quantum allocation whose register is never larger than that of the minimal-Naimark unitary program and which succeeds more often whenever n>d.
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ényi 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.
Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions, improving the efficiency of such protocols remains an open question. In this work, we present efficient quantum algorithms for inverting unitaries with specific Hamiltonian structures, achieving significant reductions in both ancilla qubit requirements and unitary query complexity. We identify cases where unitaries encoding exponentially many parameters can be inverted using only a single query. We further extend our framework to implement unitary complex conjugation and transposition operations, and develop modified protocols capable of inverting more general classes of Hamiltonians. We have also demonstrated the efficacy and robustness of our algorithms via numerical simulations under realistic noise conditions of superconducting quantum hardware. Our results establish more efficient protocols that improve the resources required for quantum unitary inversion when prior information about the quantum system is available, and provide practical methods for implementing these operations on near-term quantum devices.