Quantum algorithm for Petz recovery channels and pretty good measurements

@article{Gilyen2022QuantumAF,
  title={Quantum algorithm for Petz recovery channels and pretty good measurements},
  author={Andr'as Gily'en and Seth Lloyd and Iman Marvian and Yihui Quek and Mark M. Wilde},
  journal={Physical review letters},
  year={2022},
  volume={128 22},
  pages={
          220502
        }
}
The Petz recovery channel plays an important role in quantum information science as an operation that approximately reverses the effect of a quantum channel. The pretty good measurement is a special case of the Petz recovery channel, and it allows for near-optimal state discrimination. A hurdle to the experimental realization of these vaunted theoretical tools is the lack of a systematic and efficient method to implement them. This Letter sets out to rectify this lack: Using the recently… 

Infinite quantum signal processing

Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2 × 2 , parameterized by ( d +1) real numbers called the phase factors.

Quantum Error Correction: Noise-Adapted Techniques and Applications

The quantum computing devices of today have tens to hundreds of qubits that are highly susceptible to noise due to unwanted interactions with their environment. The theory of quantum error correction

Multivariate trace estimation in constant quantum depth

TLDR
This work constructs a constant quantum-depth circuit for the task of multivariate trace estimation, inspired by the method of Shor error correction, and instantiates the latter application with a theorem on estimating nonlinear functions of quantum states with “well-behaved” polynomial approximations.

Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle

Recent work shows that quantum signal processing (QSP) and its multi-qubit lifted version, quantum singular value transformation (QSVT), unify and improve the presentation of most quantum algorithms.

Reversing Lindblad Dynamics via Continuous Petz Recovery Map.

An important issue in developing quantum technology is that quantum states are so sensitive to noise. We propose a protocol that introduces reverse dynamics, in order to precisely control quantum

Grand Unification of Quantum Algorithms

John M. Martyn, 2 Zane M. Rossi, Andrew K. Tan, and Isaac L. Chuang 4 Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA Department of Physics,

One-shot quantum error correction of classical and quantum information

TLDR
A capacity theorem is provided when the information to be protected is both classical and quantum, i.e., hybrid information, with assistance of a limited resource of entanglement in one-shot scenario to bridge a gap between the theoretical progress and the near-future quantum technology in quantum channel coding.

Fluctuation theorems from Bayesian retrodiction.

TLDR
It is shown that the reverse channel very naturally arises from Bayesian retrodiction, in both classical and quantum theories, and fluctuation relations acquire a much broader form and scope.

Effective entropy of quantum fields coupled with gravity

Abstract Entanglement entropy, or von Neumann entropy, quantifies the amount of uncertainty of a quantum state. For quantum fields in curved space, entanglement entropy of the quantum field theory

References

SHOWING 1-10 OF 48 REFERENCES

Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics

TLDR
A new “Quantum singular value transformation” algorithm is developed that can directly harness the advantages of exponential dimensionality by applying polynomial transformations to the singular values of a block of a unitary operator.

Quantum Singular Value Transformation & Its Algorithmic Applications

TLDR
A generic quantum algorithmic framework, capable of working with exponentially large matrices, that can apply polynomial transformations to the singular values of a block of a unitary is developed, and unifies a large number of prominent quantum algorithms.

On Asymptotically Optimal Hypothesis Testing in Quantum Statistics

Optimal multiple quantum statistical hypothesis testing

This paper is concerned with the problem of optimal M-alternative determination of quantum statistical states. A review of newest achievement of solving this problem is given. A notion of an

Classical information capacity of a quantum channel.

TLDR
If the sender uses a block coding scheme consisting of a choice of code words that respects the a priori probabilities of the letter states, and the receiver distinguishes whole words rather than individual letters, then the information transmitted can be made arbitrarily close to H and never exceeds H, providing a precise information-theoretic interpretation of von Neumann entropy in quantum mechanics.

Petz reconstruction in random tensor networks

TLDR
This paper demonstrates how the Petz reconstruction map works to obtain bulk operators from the boundary data by exploiting the replica trick in the context of random tensor network toy models of holography.

Approximate Recovery and Relative Entropy I: General von Neumann Subalgebras

We prove the existence of a universal recovery channel that approximately recovers states on a von Neumann subalgebra when the change in relative entropy, with respect to a fixed reference state, is

Quantum polar decomposition algorithm

The polar decomposition for a matrix $A$ is $A=UB$, where $B$ is a positive Hermitian matrix and $U$ is unitary (or, if $A$ is not square, an isometry). This paper shows that the ability to apply a

Replica wormholes and the black hole interior

Recent work has shown how to obtain the Page curve of an evaporating black hole from holographic computations of entanglement entropy. We show how these computations can be justified using the

Quantum computations: algorithms and error correction

TLDR
This book discusses classical models of computations, quantum formalism, symplecto-classical cases, and error correction in the computation process: general principles.