Exact preparation from finitely many standard singlets
ProvedQAlgorithms.Papers.Independent.Support50.P42.arbitrary_state_preparationLet be any positive semidefinite trace-one density on positive finite local dimensions , including pure and mixed targets. Put . There is an exact local protocol using shared singlets and at most classical bits from Alice to Bob such that
The classical bound is witnessed by a complete Alice instrument with at most communicated outcomes and conditional Bob channels. When , the direct resource count is . This is a sufficient preparation method; it does not assert optimality.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P42
open scoped BigOperators Matrix ComplexConjugate
open MeasureTheory ProbabilityTheory
attribute [local instance] Classical.propDecidable Classical.decEq
-- Reuse the exact accepted objects, without introducing same-name aliases.
open Information100.P21 (Op Vec FiniteLOCC)
open Dependency50.P42 (dimensionedPower singlets)
open Dependency50.P48 (pureFidelity)
open Gap48.P32 (pairOfState)
open Next46.P39 (rectAct)
/-- Abstract and PDF pp.15--17: exact finite preparation of pure or mixed
states. Printed on pp.15--16: log2 b singlets and 2 log2 b cbits. Changed:
choose the explicit qubit embedding q=ceil(log2 b), giving q singlets and at most
2q cbits. This makes the standard-singlet count integral for general b; for
b=2^q the direct count remains exactly q. This is a sufficient budget. -/
theorem arbitrary_state_preparation (a b : ℕ) (ha : 0<a) (hb : 0<b)
(rho : Op (Fin a × Fin b)) (hrho : IsDensityMatrix rho) :
(∃ L : Superop (Fin (2^(Nat.clog 2 b)) × Fin (2^(Nat.clog 2 b))) (Fin a × Fin b),
FiniteLOCC L ∧ OneWayBits (2*Nat.clog 2 b) L ∧ L (singlets (Nat.clog 2 b))=rho) ∧
(∀ q : ℕ, b=2^q → Nat.clog 2 b=q) := by sorry
end QAlgorithms.Papers.Independent.Support50.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of positive natural numbers , and every positive semidefinite matrix of trace one on , put , with this integer understood as the natural-number ceiling logarithm. There exists a map from matrices on to matrices on such that is a finite recursive LOCC map, has the one-way form specified below with a budget of bits, and
Here is the -fold tensor power of the projector onto , reindexed on each side by the fixed equivalence between binary digits and ; is the scalar matrix . Finite recursive LOCC maps are generated by identity maps and by applying a finite complete Kraus family on either party, choosing a further such map according to the outcome, and summing the resulting branches. The one-way requirement means that there exist natural numbers , with , Alice matrices , and Bob channels , such that and, for every matrix ,
Each Bob channel has a finite Kraus representation with completeness sum . Additionally, for every natural number , implies . The case is included, giving , a scalar singlet input, and at most one classical outcome.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.