Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

IncoherentCone

Abstract

Finite-dimensional spectral and overlap bounds for antidistinguishability.

Theorem 1.1 (psd closed).

Proof. Machine-checked in Lean as D5/S3/Quantum/Measurement/IncoherentCone.psd_closed (✓ std3). ∎

Source. Repository-derived.

Acknowledgement. Nathaniel Johnston, Vincent Russo, Jamie Sikora (2025). Tight bounds for antidistinguishability and circulant sets of pure quantum states. DOI: 10.22331/q-2025-02-04-1622. URL: https://arxiv.org/abs/2311.17047v2.

Commentary.

The positive semidefinite matrices form a closed set.

Theorem 1.2 (flatten inner).

Proof. Machine-checked in Lean as D5/S3/Quantum/Measurement/IncoherentCone.flatten_inner (✓ std3). ∎

Source. Repository-derived.

Acknowledgement. Nathaniel Johnston, Vincent Russo, Jamie Sikora (2025). Tight bounds for antidistinguishability and circulant sets of pure quantum states. DOI: 10.22331/q-2025-02-04-1622. URL: https://arxiv.org/abs/2311.17047v2.

Commentary.

The real inner product after vectorization equals the real trace pairing.

Theorem 1.3 (trace hermitianPart).

Proof. Machine-checked in Lean as D5/S3/Quantum/Measurement/IncoherentCone.trace_hermitianPart (✓ std3). ∎

Source. Repository-derived.

Acknowledgement. Nathaniel Johnston, Vincent Russo, Jamie Sikora (2025). Tight bounds for antidistinguishability and circulant sets of pure quantum states. DOI: 10.22331/q-2025-02-04-1622. URL: https://arxiv.org/abs/2311.17047v2.

Commentary.

The trace pairing with a Hermitian matrix depends only on the self-adjoint part of the other matrix.

Theorem 1.4 (rankone trace).

Proof. Machine-checked in Lean as D5/S3/Quantum/Measurement/IncoherentCone.rankone_trace (✓ std3). ∎

Source. Repository-derived.

Acknowledgement. Nathaniel Johnston, Vincent Russo, Jamie Sikora (2025). Tight bounds for antidistinguishability and circulant sets of pure quantum states. DOI: 10.22331/q-2025-02-04-1622. URL: https://arxiv.org/abs/2311.17047v2.

Commentary.

The trace pairing with an outer product equals the Hermitian quadratic form.

Theorem 1.5 (psd entry bound of trace).

Proof. Machine-checked in Lean as D5/S3/Quantum/Measurement/IncoherentCone.psd_entry_bound_of_trace (✓ std3). ∎

Source. Repository-derived.

Acknowledgement. Nathaniel Johnston, Vincent Russo, Jamie Sikora (2025). Tight bounds for antidistinguishability and circulant sets of pure quantum states. DOI: 10.22331/q-2025-02-04-1622. URL: https://arxiv.org/abs/2311.17047v2.

Commentary.

A positive semidefinite matrix with real trace at most a positive R has every entry of norm at most R.

Theorem 1.6 (incoherent closed).

Proof. Machine-checked in Lean as D5/S3/Quantum/Measurement/IncoherentCone.incoherent_closed (✓ std3). ∎

Source. Repository-derived.

Acknowledgement. Nathaniel Johnston, Vincent Russo, Jamie Sikora (2025). Tight bounds for antidistinguishability and circulant sets of pure quantum states. DOI: 10.22331/q-2025-02-04-1622. URL: https://arxiv.org/abs/2311.17047v2.

Commentary.

The formula states the complete estimate or implication. Matrix entries, finite index sets, and proof parameters retain their Lean meanings. Proof fields of finite-index constructors are omitted.

Theorem 1.7 (incoherent separation).

Proof. Machine-checked in Lean as D5/S3/Quantum/Measurement/IncoherentCone.incoherent_separation (✓ std3). ∎

Source. Repository-derived.

Acknowledgement. Nathaniel Johnston, Vincent Russo, Jamie Sikora (2025). Tight bounds for antidistinguishability and circulant sets of pure quantum states. DOI: 10.22331/q-2025-02-04-1622. URL: https://arxiv.org/abs/2311.17047v2.

Commentary.

The formula states the complete estimate or implication. Matrix entries, finite index sets, and proof parameters retain their Lean meanings. Proof fields of finite-index constructors are omitted.

References