Ambainis, A. and Smith, A. (2004) Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption. Proceedings of 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 8th International Workshop on Randomization and Computation, Cambridge, 22-24 August 2004, 249-260.
https://doi.org/10.1007/978-3-540-27821-4_23

has been cited by the following article:

• TITLE: Approximate Private Quantum Channels on Fermionic Gaussian Systems

  AUTHORS: Kabgyun Jeong

  KEYWORDS: Fermionic Private Quantum Channel, Approximate FPQC, Isotropic Measure, ε-Net Analysis, McDiarmid’s Inequality

  JOURNAL NAME: Journal of Quantum Information Science, Vol.11 No.1, February 5, 2021

  ABSTRACT: The private quantum channel (PQC) maps any quantum state to the maximally mixed state for the discrete as well as the bosonic Gaussian quantum systems, and it has fundamental meaning on the quantum cryptographic tasks and the quantum channel capacity problems. In this paper, we primally introduce a notion of approximate private quantum channel (ε-PQC) on fermionic Gaussian systems (i.e., ε-FPQC), and construct its explicit form of the fermionic (Gaussian) private quantum channel. First of all, we suggest a general structure for ε-FPQC on the fermionic Gaussian systems with respect to the Schatten p-norm class, and then we give an explicit proof of the statement in the trace norm case. In addition, we study that the cardinality of a set of fermionic unitary operators agrees on the ε-FPQC condition in the trace norm case. This result may give birth to intuition on the construction of emerging fermionic Gaussian quantum communication or computing systems.