Definitions for Low dimensional bound entanglement with one-way distillable cryptographic key
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P37The objects the formalized statements of Low dimensional bound entanglement with one-way distillable cryptographic key (arXiv:quant-ph/0506203) are stated in. Each was checked against the paper by a blind read-back and a moderator.
flipAlice: PDF p.1, Eq.(1): conjugation by the Pauli X on Alice's KEY qubit only.privateMixture: PDF p.1, Eq.(1): biased even/odd private-bit mixture.physicalFin: PDF pp.1--3: same physical AA':BB' matrix, enumerating each party's key/shield pair with the accepted fixed local enumeration.measuredSource: PDF pp.1--2: the actual measured ccq source, reparenthesized A:(B:E). The shield remains unavailable to Eve; it is traced out by associatedCCQ.measuredBE: PDF p.1, Eq.(2): unnormalized conditional BE block for Alice's measured bit.measuredAliceLaw: PDF pp.1--2: Alice's actual measured-bit law.HasMeasuredOneWayRate: PDF pp.1--2: forward public discussion after the specified key measurement. One sequence is chosen before EVERY finite purifying Eve. The accepted protocol includes its public transcript in Eve's output; errors vanish on i.i.d. copies. Zero-mass conditional states use the accepted normalized fallback.weightedSwap: PDF p.2, Eq.(10): the computed weighted swap W_U, with row (i,j), column (j,i).entrySum: PDF p.2: the entrywise l1 sum equals the trace norm of W_U.weightOne: PDF p.2, Eq.(11): the first mixing weight, computed from U.weightTwo: PDF p.2, Eq.(11): the second mixing weight, computed from U.rhoUnitary: PDF p.2, Eqs.(9)--(11): exactly the two X-form blocks of the construction. The two square roots in xForm are kept distinct, as required for complex U. The partial transpose in X2 acts on B' alone. Because flipAlice exchanges 00 with 10 and 11 with 01, its private-bit argument must be xForm (X2 adjoint) to put X2 in the (01,10) block required by Eq.(9).nonzeroEntries: PDF p.2 after Eq.(12): number of nonzero matrix entries in the named basis.IsFlatUnitary: PDF pp.2--3, Observation 1: source's normalized meaning of unimodular.rhoHadamard: PDF p.3, Eqs.(13)--(16): the particular computed 4 by 4 bipartite resource.hadamardRate: PDF p.3, Eq.(16): exact yield in bits per independent input copy. The printed decimal is rounded, not an equality to a terminating decimal.pairKet: PDF p.2, Eqs.(4)--(5): normalized Bell-type vector. For the odd pair the second ket is |10>, correcting the duplicated |01> printed in Eq.(5).chiKet: PDF p.3, Eq.(15): the two normalized chi vectors; true selects chi minus.hadamardFlag: PDF p.3, Eq.(14): shield flags in the four Bell branches.hadamardWeight: PDF p.3, below Eq.(15): the four fixed preparation probabilities.pptSet: PDF p.3, Observation 2: all normalized PPT states, not a mixing line.IsPPTWithKey: PDF p.3, Observation 3: physical PPT states with positive distillable key.squaredDistance: PDF p.3, volume argument: squared Hilbert--Schmidt distance, giving full balls in the real affine space of Hermitian trace-one matrices.embeddedHadamard: PDF p.3, higher-dimensional extension: local isometric embedding of the 4 by 4 example, with zero outside the first four basis labels at each party.noisyEmbeddedHadamard: PDF p.3, Observation 3 proof: add full-dimensional white noise with signal weight q close to one. A ball is centered at this noisy state.IsCCQ: PDF pp.1,3, Eqs.(2),(17): A and B are classical in the named basis.dephaseAB: PDF pp.3--4: computational-basis measurement of both honest key registers.bellPinching: PDF p.4, Eq.(18): actual pinching in the four standard Bell projectors.twirledExpression: PDF p.4, Eq.(18): the experimentally estimated lower-bound expression.realCoherence: PDF p.4, Eq.(19): real-coherence Bell-projector difference.imagCoherence: PDF p.4, Eq.(19): imaginary-coherence difference. We fix the first tilde Bell ket to phase -i and the second to +i; its mean is +2 Im sigma_(first,second).keyObservable: PDF p.4, Eq.(19): all five specified key observables in one finite family.physicalObservable: PDF p.4, Eq.(19): conjugated physical observable on ABA'B'.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_BipartiteSeparability
import Definitions.Def_QAlgorithms_Defs_Ensemble
import Definitions.Def_QAlgorithms_Defs_Gates
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P24
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier30_P12
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P42
/-!
Horodecki--Pankowski--Horodecki--Horodecki, quant-ph/0506203v1, PDF pp.1--4.
Coordinates are ABA'B'; physical entanglement always uses AA':BB'.
All operational interfaces are from the pinned accepted library. New definitions
are confined to this module. Twisting is an analytical operation, never a claimed
LOCC implementation. Printed corrections and deferred nodes are in the unit's
MODERATION_NOTES.md and HARD.md. Compilation is pending batch handoff.
-/
noncomputable section
open scoped Matrix BigOperators ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Intakenext100.P37
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Dependency50.P24
(Key IsPrivate xForm twist twistingMatrix associatedCCQ transposeSecond transposeBob partyCut)
/-- PDF p.1, Eq.(1): conjugation by the Pauli X on Alice's KEY qubit only. -/
def flipAlice {a b : ℕ} (rho : Op (Key 2 × (Fin a × Fin b))) : Op (Key 2 × (Fin a × Fin b)) :=
fun x y => rho
(((if x.1.1 = 0 then 1 else 0), x.1.2), x.2)
(((if y.1.1 = 0 then 1 else 0), y.1.2), y.2)
/-- PDF p.1, Eq.(1): biased even/odd private-bit mixture. -/
def privateMixture {a b : ℕ} (p1 p2 : ℝ) (gamma1 gamma2 : Op (Key 2 × (Fin a × Fin b))) :
Op (Key 2 × (Fin a × Fin b)) := (p1 : ℂ) • gamma1 + (p2 : ℂ) • flipAlice gamma2
/-- PDF pp.1--3: same physical AA':BB' matrix, enumerating each party's
key/shield pair with the accepted fixed local enumeration. -/
def physicalFin {a b : ℕ} (rho : Op (Key 2 × (Fin a × Fin b))) : Op (Fin (2*a) × Fin (2*b)) :=
fun x y => partyCut rho
((Gap48.P42.localIndex 2 a).symm x.1, (Gap48.P42.localIndex 2 b).symm x.2)
((Gap48.P42.localIndex 2 a).symm y.1, (Gap48.P42.localIndex 2 b).symm y.2)
/-- PDF pp.1--2: the actual measured ccq source, reparenthesized A:(B:E).
The shield remains unavailable to Eve; it is traced out by associatedCCQ. -/
def measuredSource {a b e : ℕ} (psi : EuclideanSpace ℂ ((Key 2 × (Fin a × Fin b)) × Fin e)) :
Op (Fin 2 × (Fin 2 × Fin e)) :=
fun x y => associatedCCQ psi ((x.1,x.2.1),x.2.2) ((y.1,y.2.1),y.2.2)
/-- PDF p.1, Eq.(2): unnormalized conditional BE block for Alice's measured bit. -/
def measuredBE {a b e : ℕ} (psi : EuclideanSpace ℂ ((Key 2 × (Fin a × Fin b)) × Fin e))
(i : Fin 2) : Op (Fin 2 × Fin e) :=
fun x y => measuredSource psi (i,x) (i,y)
/-- PDF pp.1--2: Alice's actual measured-bit law. -/
def measuredAliceLaw {a b e : ℕ} (psi : EuclideanSpace ℂ ((Key 2 × (Fin a × Fin b)) × Fin e))
(i : Fin 2) : ℝ := (measuredBE psi i).trace.re
/-- PDF pp.1--2: forward public discussion after the specified key measurement.
One sequence is chosen before EVERY finite purifying Eve. The accepted protocol
includes its public transcript in Eve's output; errors vanish on i.i.d. copies.
Zero-mass conditional states use the accepted normalized fallback. -/
def HasMeasuredOneWayRate {a b : ℕ} (rho : Op (Key 2 × (Fin a × Fin b))) (r : ℝ) : Prop :=
∃ P : (n : ℕ) → Frontier30.P12.CqqProtocol (Fin 2) (Fin 2) n,
∀ e : ℕ, 0 < e → ∀ psi : EuclideanSpace ℂ ((Key 2 × (Fin a × Fin b)) × Fin e),
‖psi‖ = 1 → traceRight (pureDensity psi) = rho →
Frontier30.P12.CqqAchieves (measuredAliceLaw psi)
(fun i => Frontier30.P12.normalized (measuredBE psi i)) P r
/-- PDF p.2, Eq.(10): the computed weighted swap W_U, with row (i,j), column (j,i). -/
def weightedSwap {d : ℕ} (U : Op (Fin d)) : Op (Fin d × Fin d) :=
fun x y => if x.1 = y.2 ∧ x.2 = y.1 then U x.1 x.2 else 0
/-- PDF p.2: the entrywise l1 sum equals the trace norm of W_U. -/
def entrySum {d : ℕ} (U : Op (Fin d)) : ℝ := ∑ i, ∑ j, ‖U i j‖
/-- PDF p.2, Eq.(11): the first mixing weight, computed from U. -/
def weightOne {d : ℕ} (U : Op (Fin d)) : ℝ := entrySum U / (entrySum U + d)
/-- PDF p.2, Eq.(11): the second mixing weight, computed from U. -/
def weightTwo {d : ℕ} (U : Op (Fin d)) : ℝ := (d : ℝ) / (entrySum U + d)
/-- PDF p.2, Eqs.(9)--(11): exactly the two X-form blocks of the construction.
The two square roots in xForm are kept distinct, as required for complex U.
The partial transpose in X2 acts on B' alone. Because flipAlice exchanges
00 with 10 and 11 with 01, its private-bit argument must be xForm (X2 adjoint)
to put X2 in the (01,10) block required by Eq.(9). -/
def rhoUnitary {d : ℕ} (U : Op (Fin d)) : Op (Key 2 × (Fin d × Fin d)) :=
privateMixture (weightOne U) (weightTwo U)
(xForm (((entrySum U)⁻¹ : ℂ) • weightedSwap U))
(xForm ((((d : ℝ)⁻¹ : ℂ) • transposeSecond (weightedSwap U))ᴴ))
/-- PDF p.2 after Eq.(12): number of nonzero matrix entries in the named basis. -/
def nonzeroEntries {d : ℕ} (U : Op (Fin d)) : ℕ :=
(Finset.univ.filter fun ij : Fin d × Fin d => U ij.1 ij.2 ≠ 0).card
/-- PDF pp.2--3, Observation 1: source's normalized meaning of unimodular. -/
def IsFlatUnitary {d : ℕ} (U : Op (Fin d)) : Prop :=
∀ i j, ‖U i j‖ = 1 / Real.sqrt d
/-- PDF p.3, Eqs.(13)--(16): the particular computed 4 by 4 bipartite resource. -/
def rhoHadamard : Op (Key 2 × (Fin 2 × Fin 2)) :=
rhoUnitary (fun i j : Fin 2 => QAlgorithms.hadamard (decide (i = 1)) (decide (j = 1)))
/-- PDF p.3, Eq.(16): exact yield in bits per independent input copy.
The printed decimal is rounded, not an equality to a terminating decimal. -/
def hadamardRate : ℝ := 1 - binEntropy2 (Real.sqrt 2 / (1 + Real.sqrt 2))
/-- PDF p.2, Eqs.(4)--(5): normalized Bell-type vector. For the odd pair the
second ket is |10>, correcting the duplicated |01> printed in Eq.(5). -/
def pairKet (odd : Bool) (phase : ℂ) : EuclideanSpace ℂ (Key 2) :=
WithLp.toLp 2 fun x => ((Real.sqrt 2)⁻¹ : ℂ) *
((if x = (0, if odd then 1 else 0) then 1 else 0) +
(if x = (1, if odd then 0 else 1) then phase else 0))
/-- PDF p.3, Eq.(15): the two normalized chi vectors; true selects chi minus. -/
def chiKet (minus : Bool) : EuclideanSpace ℂ (Key 2) :=
WithLp.toLp 2 fun x =>
if x = (0,0) then
((Real.sqrt (2 + (if minus then -Real.sqrt 2 else Real.sqrt 2)) / 2 : ℝ) : ℂ)
else if x = (1,1) then
(((if minus then -1 else 1) *
Real.sqrt (2 - (if minus then -Real.sqrt 2 else Real.sqrt 2)) / 2 : ℝ) : ℂ)
else 0
/-- PDF p.3, Eq.(14): shield flags in the four Bell branches. -/
def hadamardFlag (i : Fin 4) : Op (Key 2) :=
![(1/2 : ℂ) • (pureDensity (ket (0,0)) + pureDensity ((pairKet true 1))),
(1/2 : ℂ) • (pureDensity (ket (1,1)) + pureDensity ((pairKet true (-1)))),
pureDensity (chiKet false), pureDensity (chiKet true)] i
/-- PDF p.3, below Eq.(15): the four fixed preparation probabilities. -/
def hadamardWeight (i : Fin 4) : ℝ :=
![weightOne (fun i j : Fin 2 => QAlgorithms.hadamard (decide (i = 1)) (decide (j = 1))) / 2, weightOne (fun i j : Fin 2 => QAlgorithms.hadamard (decide (i = 1)) (decide (j = 1))) / 2,
weightTwo (fun i j : Fin 2 => QAlgorithms.hadamard (decide (i = 1)) (decide (j = 1))) / 2, weightTwo (fun i j : Fin 2 => QAlgorithms.hadamard (decide (i = 1)) (decide (j = 1))) / 2] i
/-- PDF p.3, Observation 2: all normalized PPT states, not a mixing line. -/
def pptSet {a b : ℕ} : Set (Op (Key 2 × (Fin a × Fin b))) :=
{rho | IsDensityMatrix rho ∧ (transposeBob rho).PosSemidef}
/-- PDF p.3, Observation 3: physical PPT states with positive distillable key. -/
def IsPPTWithKey {m n : ℕ} (rho : Op (Fin m × Fin n)) : Prop :=
IsDensityMatrix rho ∧ (Information100.P21.pt rho).PosSemidef ∧
0 < Gap48.P42.distillableKey rho
/-- PDF p.3, volume argument: squared Hilbert--Schmidt distance, giving full
balls in the real affine space of Hermitian trace-one matrices. -/
def squaredDistance {I : Type} [Fintype I] (rho sigma : Op I) : ℝ :=
∑ i, ∑ j, ‖rho i j - sigma i j‖ ^ 2
/-- PDF p.3, higher-dimensional extension: local isometric embedding of the
4 by 4 example, with zero outside the first four basis labels at each party. -/
def embeddedHadamard (m n : ℕ) : Op (Fin m × Fin n) :=
fun x y => if h : x.1.val < 4 ∧ x.2.val < 4 ∧ y.1.val < 4 ∧ y.2.val < 4 then
physicalFin rhoHadamard
(⟨x.1.val,h.1⟩,⟨x.2.val,h.2.1⟩) (⟨y.1.val,h.2.2.1⟩,⟨y.2.val,h.2.2.2⟩)
else 0
/-- PDF p.3, Observation 3 proof: add full-dimensional white noise with signal
weight q close to one. A ball is centered at this noisy state. -/
def noisyEmbeddedHadamard (m n : ℕ) (q : ℝ) : Op (Fin m × Fin n) :=
(q : ℂ) • embeddedHadamard m n + (((1-q) / (m*n) : ℝ) : ℂ) • 1
/-- PDF pp.1,3, Eqs.(2),(17): A and B are classical in the named basis. -/
def IsCCQ {a b e : ℕ} (rho : Op (Fin a × (Fin b × Fin e))) : Prop :=
∀ x y, x.1 ≠ y.1 ∨ x.2.1 ≠ y.2.1 → rho x y = 0
/-- PDF pp.3--4: computational-basis measurement of both honest key registers. -/
def dephaseAB {a b e : ℕ} (rho : Op (Fin a × (Fin b × Fin e))) :
Op (Fin a × (Fin b × Fin e)) :=
fun x y => if x.1 = y.1 ∧ x.2.1 = y.2.1 then rho x y else 0
/-- PDF p.4, Eq.(18): actual pinching in the four standard Bell projectors. -/
def bellPinching (sigma : Op (Key 2)) : Op (Key 2) :=
∑ i : Fin 4, pureDensity (((![pairKet false 1, pairKet false (-1), pairKet true 1, pairKet true (-1)]) i)) * sigma * pureDensity (((![pairKet false 1, pairKet false (-1), pairKet true 1, pairKet true (-1)]) i))
/-- PDF p.4, Eq.(18): the experimentally estimated lower-bound expression. -/
def twirledExpression (sigma : Op (Key 2)) : ℝ :=
mutualInfoBits (fun k => (sigma k k).re) - vnEntropy (bellPinching sigma)
/-- PDF p.4, Eq.(19): real-coherence Bell-projector difference. -/
def realCoherence (odd : Bool) : Op (Key 2) :=
pureDensity (pairKet odd 1) - pureDensity (pairKet odd (-1))
/-- PDF p.4, Eq.(19): imaginary-coherence difference. We fix the first tilde
Bell ket to phase -i and the second to +i; its mean is +2 Im sigma_(first,second). -/
def imagCoherence (odd : Bool) : Op (Key 2) :=
pureDensity (pairKet odd (-Complex.I)) - pureDensity (pairKet odd Complex.I)
/-- PDF p.4, Eq.(19): all five specified key observables in one finite family. -/
def keyObservable (i : Fin 5) : Op (Key 2) :=
![(Matrix.diagonal (fun k : Key 2 => if k.1 = k.2 then (1 : ℂ) else -1)), realCoherence false, imagCoherence false,
realCoherence true, imagCoherence true] i
/-- PDF p.4, Eq.(19): conjugated physical observable on ABA'B'. -/
def physicalObservable {a b : ℕ}
(U : Key 2 → Matrix.unitaryGroup (Fin a × Fin b) ℂ) (O : Op (Key 2)) :
Op (Key 2 × (Fin a × Fin b)) :=
(twistingMatrix U)ᴴ * Matrix.kronecker O (1 : Op (Fin a × Fin b)) * twistingMatrix U
/-- Sanity: W_I has unit (00,00) entry, pinning the row/column convention. -/
example : weightedSwap (1 : Op (Fin 2)) (0,0) (0,0) = 1 := by
simp [weightedSwap]
/-- Sanity: the flip acts on Alice's key and leaves Bob and both shields fixed. -/
example {a b : ℕ} (rho : Op (Key 2 × (Fin a × Fin b))) (s t : Fin a × Fin b) :
flipAlice rho ((0,0),s) ((1,1),t) = rho ((1,0),s) ((0,1),t) := by rfl
/-- Sanity: chi has no odd-parity shield amplitude. -/
example (minus : Bool) : chiKet minus (0,1) = 0 := by
simp [chiKet]
/-- Sanity: an identical matrix has zero squared Hilbert--Schmidt distance. -/
example {I : Type} [Fintype I] (rho : Op I) : squaredDistance rho rho = 0 := by
simp [squaredDistance]
end QAlgorithms.Papers.Independent.Intakenext100.P37
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P37.HasMeasuredOneWayRate
For arbitrary natural numbers , an arbitrary complex matrix on , and a real number , this property means that there exists one sequence of protocols , for every natural number , with the following requirement for every positive natural number and every unit vector on satisfying . Define matrices on by when , and otherwise by ; put , and when , while when . Each consists of natural numbers , an encoding array for binary words of length , , , and matrices on binary words of length . There must exist numbers and a real , possibly depending on , such that for every , , each is nonnegative and sums to one, each family is positive semidefinite and sums to the identity, and . Writing , , , , and , define
The requirements are , , and the existence, for each , of density matrices and one common density matrix on such that and for every . Here a density matrix is positive semidefinite with trace one, and . Finally, and as . These conditions include , using empty products equal to one and the total real division convention . There is no explicit assumption that is a density matrix or that ; if no qualifying purification exists, the universal requirement on purifications is vacuous.
QAlgorithms.Papers.Independent.Intakenext100.P37.IsCCQ
For arbitrary natural numbers and an arbitrary complex square matrix indexed by , this predicate means that
It imposes no restriction on entries within a fixed pair , and requires neither positivity nor trace one. If any dimension is zero, there are no matrix entries and the condition holds vacuously.
QAlgorithms.Papers.Independent.Intakenext100.P37.IsFlatUnitary
For every natural number and complex matrix , this predicate means that
It imposes no additional condition that be unitary. When , there are no indices, so the predicate holds vacuously.
QAlgorithms.Papers.Independent.Intakenext100.P37.IsPPTWithKey
For every pair of natural numbers and complex matrix on , this predicate requires to be positive semidefinite with trace , requires the matrix to be positive semidefinite, and requires . Here is the supremum in of over real satisfying the following condition: , and for every , there is such that for every integer with , there exist positive integers , a positive semidefinite trace-one matrix on , unitaries on that space for , and a finite local-operations-and-classical-communication map from local dimensions to local dimensions , for which
The copies are reindexed by fixed bijections between length- index tuples and indices of sizes , and, after identifying the output indices locally with key and shield indices,
The permitted maps are built recursively from identity maps by finite complete local Kraus operations, with subsequent maps allowed to depend on the outcome and the branches summed. The norm is . If or , the density-matrix requirement cannot hold.
QAlgorithms.Papers.Independent.Intakenext100.P37.bellPinching
For any complex square matrix indexed by , this defines
Here each computational basis vector has amplitude one at its indicated index and zero elsewhere, and . The definition does not require to be Hermitian, positive, or normalized.
QAlgorithms.Papers.Independent.Intakenext100.P37.chiKet
For every Boolean , this defines a vector in the complex Euclidean space indexed by , namely
Here is the coordinate unit vector at ; both other coordinates are zero.
QAlgorithms.Papers.Independent.Intakenext100.P37.dephaseAB
For arbitrary natural numbers and an arbitrary complex square matrix indexed by , this defines the matrix
Thus it retains every entry within each fixed pair of first and second register indices and removes all entries between different such pairs. No positivity or normalization hypothesis is imposed; zero dimensions are allowed.
QAlgorithms.Papers.Independent.Intakenext100.P37.embeddedHadamard
For every pair of natural numbers , this defines a complex matrix on by when all four indices are less than , and otherwise. The bipartite matrix is specified as follows: split each local index into a key bit and a shield bit using the fixed bijection chosen from equality of cardinalities, and regroup the two key bits before the two shield bits. Set , when and otherwise, when and otherwise, and let be the diagonal matrix with entry at shield indices and at . In key order ,
There is no assumption that : smaller dimensions retain only entries whose indices exist, and if either dimension is zero the resulting matrix has an empty index set.
QAlgorithms.Papers.Independent.Intakenext100.P37.entrySum
For every natural number and every complex matrix , this defines
The norm in each summand is the complex modulus. No unitarity is assumed; for , both index sets are empty and the value is zero.
QAlgorithms.Papers.Independent.Intakenext100.P37.flipAlice
For arbitrary natural numbers , including zero, and any complex matrix indexed by , this defines a matrix on the same index set by
Thus the first binary coordinate is flipped in both matrix indices, while every other coordinate is retained. No positivity or normalization is required; if or , the matrix index set is empty.
QAlgorithms.Papers.Independent.Intakenext100.P37.hadamardFlag
For every , this defines a complex matrix on . Write , let denote the coordinate unit vectors, and put
The four values, in index order, are
QAlgorithms.Papers.Independent.Intakenext100.P37.hadamardRate
This defines the real number
where is the natural logarithm.
QAlgorithms.Papers.Independent.Intakenext100.P37.hadamardWeight
For every , this defines the corresponding entry of the real vector
These values use the sum of the absolute values of all entries of the matrix , which is , in the ratios defining the weights.
QAlgorithms.Papers.Independent.Intakenext100.P37.imagCoherence
For either Boolean value , let when is false and when it is true. This defines the complex matrix
on , where and the indicated computational basis vectors have one nonzero amplitude, equal to one.
QAlgorithms.Papers.Independent.Intakenext100.P37.keyObservable
For an index , this selects the corresponding complex matrix on the two key indices from the ordered list
The diagonal is written in computational basis order , and has entry one in row , column , and zero elsewhere. The index is restricted to these five values.
QAlgorithms.Papers.Independent.Intakenext100.P37.measuredAliceLaw
For arbitrary natural numbers , any complex Euclidean vector indexed by , and any , this defines the real number
This is the real part of the trace of the matrix whose entry is zero for and otherwise is the shield sum of . No unit norm assumption is imposed, so the two values need not sum to one; any empty summation index set makes the value zero.
QAlgorithms.Papers.Independent.Intakenext100.P37.measuredBE
For arbitrary natural numbers , any complex Euclidean vector indexed by , and any , this defines a matrix on by
No normalization of is required. The matrix is zero if either shield index set is empty, and has an empty index set if .
QAlgorithms.Papers.Independent.Intakenext100.P37.measuredSource
For arbitrary natural numbers and any complex Euclidean vector indexed by , this defines a matrix on by
There is no unit norm assumption. Empty shield index sets make the sums zero, and makes the output index set empty.
QAlgorithms.Papers.Independent.Intakenext100.P37.noisyEmbeddedHadamard
For arbitrary natural numbers , including zero, and an arbitrary real number , this defines the complex matrix
on . Here is zero unless both coordinates of both and are less than ; otherwise it is the corresponding entry of the following fixed bipartite state, with each local index split into a key index and a shield index using the fixed chosen bijection . Put
and write . For any shield matrix , define, in key order ,
The fixed state is
where flips Alice’s key index and preserves all other indices. Thus or retains only the entries whose indices exist, while larger dimensions add zero entries. There is no restriction , nor any assertion here that the resulting matrix is a density matrix. Division by zero is defined to be zero; if either dimension is zero, the resulting matrix has an empty index set.
QAlgorithms.Papers.Independent.Intakenext100.P37.nonzeroEntries
For every natural number and complex matrix , this defines the number of its nonzero entries:
No unitarity assumption is imposed. When , the count is .
QAlgorithms.Papers.Independent.Intakenext100.P37.pairKet
For every Boolean and every complex number , this defines the vector
in the complex Euclidean space indexed by pairs from , where has coordinate at and elsewhere. The complex parameter is unrestricted; its modulus need not be .
QAlgorithms.Papers.Independent.Intakenext100.P37.physicalFin
For arbitrary natural numbers and any complex matrix on , let and be the chosen equivalences obtained from equality of finite cardinalities. This defines a matrix on by
The equivalences are the particular cardinality based choices in the definition, with no specified arithmetic enumeration. No positivity or normalization is assumed, and or gives an empty index set.
QAlgorithms.Papers.Independent.Intakenext100.P37.physicalObservable
For arbitrary natural numbers , a family of unitary matrices on the shield space indexed by , one for each key pair , and an arbitrary complex matrix on the key pairs, this defines
Equivalently, its entry in row , column is . Neither Hermiticity nor positivity of is assumed. Zero shield dimensions are allowed, in which case the output matrix has an empty index set.
QAlgorithms.Papers.Independent.Intakenext100.P37.pptSet
For every pair of natural numbers , this defines the set of complex matrices indexed by such that is positive semidefinite, , and the matrix is positive semidefinite, where
Thus the transpose exchanges both the second key coordinate and the second shield coordinate between row and column. If or , the index set is empty and the trace-one requirement makes this set empty.
QAlgorithms.Papers.Independent.Intakenext100.P37.privateMixture
For arbitrary natural numbers , arbitrary real numbers , and arbitrary complex matrices on , this defines
The real coefficients are regarded as complex scalars. They need not be nonnegative or sum to one, and the matrices need not be density matrices or private states. Zero values of or are allowed, giving an empty matrix index set.
QAlgorithms.Papers.Independent.Intakenext100.P37.realCoherence
For either Boolean value , let when is false and when it is true. This defines the complex matrix
on , where the indicated computational basis vectors have one nonzero amplitude, equal to one.
QAlgorithms.Papers.Independent.Intakenext100.P37.rhoHadamard
This defines a complex matrix on . Explicitly, put for , and define matrices on the second pair of indices by
In the order for the first pair of indices, the defined matrix is
QAlgorithms.Papers.Independent.Intakenext100.P37.rhoUnitary
For every natural number , including , and every complex matrix , with no unitarity assumption, this defines a complex matrix on as follows. Put , and define the shield matrix by when and , and otherwise. For any shield matrix , write , and define the following matrix, whose block order on the two key coordinates is :
where the square roots are defined by continuous functional calculus. Let denote the matrix obtained by flipping Alice’s key coordinate in both indices, so that . The defined matrix is
All scalar inverses use the convention . In particular, gives the zero matrix; when , the indexing set is empty, , and both displayed weights are .
QAlgorithms.Papers.Independent.Intakenext100.P37.squaredDistance
For every finite type , equipped with its finite enumeration, and every pair of complex matrices indexed by , this defines
No positivity or trace assumptions are imposed. If is empty, the value is .
QAlgorithms.Papers.Independent.Intakenext100.P37.twirledExpression
For any complex square matrix indexed by , put , , and . This defines
where , , and for , using real spectral functional calculus, whose value is zero on a non-Hermitian matrix. The total logarithm used here is for , with , and division by zero is zero. No hypothesis makes the numbers a probability distribution or makes a density matrix.
QAlgorithms.Papers.Independent.Intakenext100.P37.weightOne
For every natural number and every complex matrix , this defines
No unitarity is required. When , the numerator and denominator are zero and the defined value is zero, using total real division; for , the denominator is positive.
QAlgorithms.Papers.Independent.Intakenext100.P37.weightTwo
For every natural number and every complex matrix , this defines
No unitarity is assumed. When , this is , whose defined real value is zero; for , the denominator is positive.
QAlgorithms.Papers.Independent.Intakenext100.P37.weightedSwap
For every natural number , including zero, and every complex matrix , this defines a matrix on by
No unitarity or other restriction on is assumed. For , the matrix index set is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.