One cbit and one ebit exactly simulate one cobit
ProvedQAlgorithms.Papers.Independent.Support50.P37.exact_cbit_ebit_cobitA forward cbit is the dephasing channel obtained from with inaccessible environment . A forward cobit is the coherent isometry , for . An ebit is the normalized shared pair .
Using free local quantum operations, one use of the cbit channel and one supplied ebit exactly simulate one cobit:
The conversion holds in either direction. It is a finite single-bit transformation, with equality on every input operator and hence every reference extension. No other nonlocal call or borrowed catalyst is supplied. This conversion permits replacing consumed cobits by explicitly charged classical communication and entanglement.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P37
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P37
open QAlgorithms.Papers.Independent.Support21.P19
open QAlgorithms.Papers.Independent.Renew46.P34 (rateConstraint)
open scoped Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.8, Eq.(30): exact finite simulation of a cobit using one cbit and one
supplied EPR pair, in either direction. Every other nonlocal call count is zero.
Exact requires equality on all input operators, hence on all reference extensions. -/
theorem exact_cbit_ebit_cobit :
Exact (idle 1 1) (budget 0 1 0 0 0 0 1 0) (cobitChannel 2) ∧
Exact (idle 1 1) (budget 0 1 0 0 0 0 0 1) (reverse (cobitChannel 2)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P37
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
There exists a finite sequential protocol implementing the forward coherent resource exactly, using local product channels, at most one preparation of the entangled state , and at most one forward classical communication resource, with zero calls to the main resource or any other communication kind; and there exists such a protocol implementing the backward coherent resource using instead at most one backward classical communication resource and at most one entangled-pair preparation. A classical communication resource transfers a two-dimensional register to the other party after deleting its off-diagonal entries, and backward resources exchange Alice and Bob. In each assertion the nominal main resource is the identity on one-dimensional registers at both parties, but its allowed call count is zero. A sequential protocol is built from local products of channels, individual resource calls alongside arbitrary finite local memory, and finite composition; channels have finite Kraus representations with , and resource counts add under composition. Exact implementation means equality of the implemented and target matrix maps on every input matrix, with counts bounded above by the stated allowances.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.