Approximate Private Channels

• Approximate private channels are quantum channels that replace exact randomization with a controlled approximation to the maximally mixed state, measured by Schatten norms.
• In fermionic Gaussian systems, Majorana-based random unitaries reduce the required ensemble size from 4M² to O(M log M), enabling efficient privacy.
• This framework integrates various notions of approximate privacy—including degradability defects and contraction bounds—offering robust insights for quantum communication and cryptography.

Searching arXiv for relevant papers on approximate private quantum channels, fermionic Gaussian systems, and related private-capacity frameworks. Approximate private channels are quantum channels that replace exact output randomization by a controlled approximation to the maximally mixed state. In the finite-dimensional formulation, a private quantum channel (PQC) maps every input state to $I_d/d$, while an $\varepsilon$-private quantum channel requires the output to be within a prescribed Schatten $p$-norm distance of that state. In fermionic Gaussian systems, this idea becomes the fermionic $\varepsilon$-private quantum channel, or $\varepsilon$-FPQC: a randomizing channel on $M$-mode fermionic Gaussian states that is close to maximally mixed rather than exactly maximally mixed. The central construction in the fermionic setting uses Majorana-based random unitaries and shows that approximate privacy can be achieved with substantially fewer unitaries than exact privacy, reducing the required cardinality from about $4M^2$ in the exact case to $O(M\log M)$ in the approximate regime (Jeong, 2020).

1. Exact and approximate privacy criteria

A standard PQC is defined by the exact relation

$\Lambda(\varrho)=\frac{I_d}{d}.$

This is the quantum analogue of perfect one-time-pad secrecy: all inputs are rendered indistinguishable at the output. The approximate version replaces equality by norm control. For an operator $A$, the Schatten $\varepsilon$0-norm is

$\varepsilon$1

and a channel $\varepsilon$2 is an $\varepsilon$3-PQC if, for every state $\varepsilon$4,

$\varepsilon$5

In the trace-norm case $\varepsilon$6, this reduces to

$\varepsilon$7

The fermionic paper adopts the same pattern for $\varepsilon$8-mode fermionic Gaussian states and calls the resulting object an $\varepsilon$9-FPQC (Jeong, 2020).

This definition places approximate private channels in the family of norm-controlled privacy primitives: privacy is not represented by zero leakage in an absolute sense, but by bounded deviation from an ideal randomizing map. A recurrent misconception is that there is a unique approximation notion for privacy channels. The literature instead uses several inequivalent metrics depending on the task: trace or Schatten norms for output randomization, diamond norm for approximate degradability, fidelity for approximate private states, and QLDP inequalities for local privacy constraints. This suggests that “approximate private channel” is not a single universal definition but a task-dependent family of relaxations (Sutter et al., 2014).

2. Fermionic Gaussian formulation

The fermionic construction is formulated on an $p$0-mode system with annihilation and creation operators $p$1, and more conveniently with Majorana operators

$p$2

satisfying the canonical anti-commutation relations

$p$3

A fermionic Gaussian state is generated by a quadratic Hamiltonian,

$p$4

with $p$5. The paper then restricts attention to the even Gaussian case,

$p$6

which is the natural sector for the explicit privacy construction (Jeong, 2020).

The corresponding normal form is

$p$7

with $p$8. Pure fermionic Gaussian states are obtained when $p$9 for all $\varepsilon$0. This parametrization makes clear that fermionic Gaussian randomization is structurally analogous to discrete and bosonic Gaussian randomization, but it is built from CAR algebra and antisymmetric covariance data rather than Pauli operators or CCR-based phase-space variables (Jeong, 2020).

3. Explicit fermionic private-channel construction

The explicit fermionic private channel is a random unitary channel

$\varepsilon$1

with fermionic unitaries chosen as

$\varepsilon$2

and parity operator

$\varepsilon$3

This is the concrete Majorana-based construction introduced for fermionic Gaussian privacy (Jeong, 2020).

Its role is directly comparable to Pauli twirling in qubit systems: conjugation by these unitaries randomizes fermionic Gaussian states so that the output is driven toward the maximally mixed state. The paper stresses that this similarity should not obscure the algebraic distinction. Fermionic channels are organized by Majorana operators and CAR structure, whereas bosonic Gaussian channels use displacement and squeezing transformations over CCR phase space. The resemblance is therefore operational rather than algebraically literal (Jeong, 2020).

The same broad random-unitary paradigm appears in earlier approximate randomization results outside the fermionic setting. In approximate quantum state sharing, for example, random unitary channels of the form

$\varepsilon$4

are used as approximate private quantum channels, with the trace-distance condition

$\varepsilon$5

playing the same operational role (Chi et al., 2010). The fermionic construction can be viewed as the Gaussian-CAR specialization of this general randomization paradigm.

4. Resource scaling and proof architecture

A principal result of the fermionic paper is the gap between exact and approximate privacy cost. The exact fermionic PQC requires about

$\varepsilon$6

unitaries in the optimal exact case, whereas approximate fermionic privacy can be achieved with only

$\varepsilon$7

unitaries (Jeong, 2020). In the trace-norm case, the highlighted proposition states that

$\varepsilon$8

is an $\varepsilon$9-FPQC if

$\varepsilon$0

with the proof carrying an additional $\varepsilon$1 factor. The emphasized message is therefore linear scaling in $\varepsilon$2 up to constants and logarithms, rather than quadratic scaling (Jeong, 2020).

The proof strategy is a standard randomization argument adapted to pure fermionic Gaussian states. First, an $\varepsilon$3-net $\varepsilon$4 of pure fermionic states is used, with size bound

$\varepsilon$5

Second, for

$\varepsilon$6

the bounded-difference estimate

$\varepsilon$7

allows McDiarmid concentration,

$\varepsilon$8

Third, unitary invariance and the triangle inequality extend the estimate from net points to all pure states. Finally, a union bound over the net yields exponentially small failure probability once the ensemble size scales as above (Jeong, 2020).

This proof architecture mirrors earlier discrete and bosonic approximate randomization arguments, but the fermionic specialization is technically nontrivial because the geometry of the state space and the randomizing ensemble are Majorana-based rather than Pauli- or displacement-based. A plausible implication is that the $\varepsilon$9 phenomenon is less about any one operator basis than about the generic effectiveness of random-unitary coverings in Gaussian state families.

5. Relation to private capacity and approximate channel structure

The fermionic paper motivates FPQCs by the same two themes that drive the broader PQC literature: quantum cryptographic tasks and quantum channel capacity problems (Jeong, 2020). In that wider literature, approximate structure often appears not through output randomization but through approximate degradability. A channel $M$0 is $M$1-degradable if there exists a degrading channel $M$2 such that

$M$3

and this condition yields explicit upper bounds on both quantum capacity and private classical capacity (Sutter et al., 2014). This is a different relaxation from $M$4-PQC randomization, but both frameworks replace exact structural equalities by norm-bounded defects.

For bosonic Gaussian channels, approximate privacy is usually discussed through private-capacity converses rather than randomization. One work derives upper bounds on the energy-constrained private capacity of single-mode bosonic Gaussian channels using the conditional quantum entropy power inequality, including the attenuator bound

$M$5

and analogous amplifier bounds for thermal and general Gaussian environmental noise (Jeong, 2020). Another develops energy-constrained $M$6-degradable and $M$7-close-degradable bounds for phase-insensitive bosonic Gaussian channels, placing explicit upper limits on private communication rates in thermal, amplifier, and additive-noise models (Sharma et al., 2017). These results do not define approximate private channels via randomization, but they show how approximate structure governs private communication in continuous-variable settings.

A related exact-capacity perspective is supplied by the notions of more capable and less noisy channels. If the complementary channel has zero private capacity, then the main channel is less noisy and satisfies

$M$8

while the more capable condition gives

$M$9

(Watanabe, 2011). This provides a distinct benchmark: instead of approximating an ideal private channel, one identifies channel classes for which the environment is fundamentally too weak to sustain private or quantum communication.

6. Structural extensions and adjacent notions of approximate privacy

Approximate privacy also appears at the state level. An $4M^2$0-approximate private state $4M^2$1 is one that is close in fidelity to an exact private state $4M^2$2, and its key size is bounded by squashed entanglement through

$4M^2$3

with an error term depending only on $4M^2$4 and $4M^2$5, not on shield dimension (Wilde, 2016). This establishes a converse principle parallel to approximate private channels: approximate secrecy remains quantitatively constrained by a robust entanglement measure.

At the opposite end of the spectrum, exact PQCs admit an operator-algebraic characterization. For a conditional expectation channel $4M^2$6, a triple $4M^2$7 is a private quantum channel if and only if $4M^2$8 is a set of trace vectors of $4M^2$9 with respect to $O(M\log M)$0 (Church et al., 2012). The paper is explicitly exact rather than approximate, but it suggests a structural route to approximation: replace exact trace-vector identities by norm- or expectation-controlled perturbations.

More recently, privacy-constrained quantum channels have also been analyzed through QLDP and contraction coefficients. Under $O(M\log M)$1-QLDP, the exact trace-distance contraction coefficient is

$O(M\log M)$2

and under $O(M\log M)$3-QLDP it becomes

$O(M\log M)$4

(Nuradha et al., 2024). These results concern local privacy rather than output randomization to the maximally mixed state, but they reinforce the same general lesson: approximate privacy is naturally expressed through quantitative contraction or closeness bounds, and those bounds propagate to operational tasks such as hypothesis testing, fairness, and Holevo-information stability.

Taken together, these developments indicate that approximate private channels form a broad research area rather than a single formalism. In the fermionic Gaussian setting, the defining achievement is the explicit $O(M\log M)$5-FPQC construction from Majorana-derived unitaries together with the sharp reduction in randomization cost from $O(M\log M)$6 to $O(M\log M)$7 (Jeong, 2020). In adjacent settings, approximation is captured instead by degradability defects, finite-energy simulation errors, state fidelity to private states, or privacy-constrained contraction coefficients. This suggests that approximate privacy is best understood as a family of controlled relaxations of exact secrecy, tailored to the algebraic structure of the system and the operational quantity being optimized.