Invertible Quantum Operations and Perfect Encryption of Quantum States
Ashwin Nayak (1), Pranab Sen (2) ((1) U. Waterloo & Perimeter, (2), TIFR)

TL;DR
This paper characterizes invertible quantum operations as unitary transformations with ancillas, impacting quantum encryption by slightly broadening existing schemes while reaffirming key size lower bounds.
Contribution
It provides a precise characterization of invertible quantum operations and extends known encryption bounds to more general schemes.
Findings
Invertible quantum operations are unitary transformations with ancillas.
One-way quantum encryption schemes can be more general than previously thought.
The 2n-bit key lower bound for encrypting n qubits still applies.
Abstract
In this note, we characterize the form of an invertible quantum operation, i.e., a completely positive trace preserving linear transformation (a CPTP map) whose inverse is also a CPTP map. The precise form of such maps becomes important in contexts such as self-testing and encryption. We show that these maps correspond to applying a unitary transformation to the state along with an ancilla initialized to a fixed state, which may be mixed. The characterization of invertible quantum operations implies that one-way schemes for encrypting quantum states using a classical key may be slightly more general than the ``private quantum channels'' studied by Ambainis, Mosca, Tapp and de Wolf (FOCS 2000). Nonetheless, we show that their results, most notably a lower bound of 2n bits of key to encrypt n quantum bits, extend in a straightforward manner to the general case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Cryptography and Data Security
