VERDICT
[verified-at-source] The "more than half" threshold applies to coherence recovery only in the complement-side sense: V_max(F) is controlled by whether the inaccessible remainder R can distinguish the two branch states, and Haar/decoupling results put the transition at dim(F) roughly exceeding dim(R), i.e. k > n/2, with the usual one-logical-qubit/O(1) offsets for full quantum decoding. Dupuis-Berta-Wullschleger-Renner state explicitly that for m qubits randomly evolved and then partially traced, the remaining m' qubits decouple from a reference when m' < m/2 and otherwise retain correlation; Hayden-Preskill state the same threshold operationally for recovery from radiation after the halfway point. [verified-at-source] This is not the same as "F is decoupled from the reference": recovery from F is equivalent in the QEC literature to the complement R being private/decoupled, while the prompt's V_max(F) is a two-branch coherence/fidelity quantity and is weaker than full qubit recovery. [verified-at-source] I did not find a paper giving an exact closed form for E ||Tr_R |E0><E1|||_1 for a Haar-random orthonormal branch pair; the closest exact literature computes average fidelity of independent random induced states, not this correlated orthogonal-pair ensemble. [verified-at-source] For local random circuits, I found operator-spreading/OTOC fronts and separate erasure-threshold decoding papers, but not a direct computation of this recoverable-coherence trace norm V_max(F,d).
A. DECOUPLING OF F FROM REFERENCE VS SMALL V_MAX(F)
[verified-at-source] They are different conditions. The quantum-error-correction/decoupling statement is: information is recoverable from a subsystem when the complementary subsystem is private/decoupled from the logical/reference system. Kretschmann, Kribs, and Spekkens, "Complementarity of Private and Correctable Subsystems in Quantum Cryptography and Error Correction," arXiv:0711.3438, Phys. Rev. A 78, 032330 (2008), DOI 10.1103/PhysRevA.78.032330, state in the abstract: "We show that a subsystem is private for a channel precisely when it is correctable for a complementary channel." Their Theorem 5 states: "If a subsystem B is epsilon-correctable (respectively epsilon-private) for E, then it is 2 sqrt(epsilon)-private (respectively 2 sqrt(epsilon)-correctable) for E^sharp. The ideal result, obtained by setting epsilon=0 implies that B is a correctable subsystem for E if and only if B is a private subsystem for E^sharp."
[verified-at-source] Bény and Oreshkov give the fidelity version of the same recovery/complement duality. C. Bény and O. Oreshkov, "General conditions for approximate quantum error correction and near-optimal recovery channels," arXiv:0907.5391, Phys. Rev. Lett. 104, 120501 (2010), DOI 10.1103/PhysRevLett.104.120501, write: "We show that the optimal recovery fidelity can be predicted exactly from a dual optimization problem on the environment causing the noise." Their Theorem 1 states: "max_R F(R N, M) = max_R' F(N^, R' M^)," where N^ and M^ are complementary channels.
[verified-at-source] This is not the same as decoupling of F from the reference. Dupuis, Berta, Wullschleger, and Renner define decoupling as product form of the system being tested with the reference: "We call a system, B, decoupled from another system, E, if the joint state of the two systems, rho_BE, has product form rho_B tensor rho_E. Operationally, this means that the outcome of any measurement on B is statistically independent of the outcome of any measurement on E." Source: F. Dupuis, M. Berta, J. Wullschleger, R. Renner, "One-shot decoupling," arXiv:1012.6044, Commun. Math. Phys. 328, 251 (2014), DOI 10.1007/s00220-014-1990-4.
[verified-at-source] The prompt's V_max(F) is instead a recoverable interference/branch-coherence quantity. Bény-Oreshkov explicitly invoke Uhlmann's theorem as converting a recovery fidelity to an "overlap maximized over unitary operators"; in two-branch language, Uhlmann's theorem identifies the optimal branch-overlap recoverable by acting on F with the fidelity of the inaccessible branch states on R. This connects V_max(F) to how well R can distinguish the branches, not to whether F itself is uncorrelated with the reference.
[verified-at-source] Clean answer to A: I found no paper stating, in exactly the notation V_max(F)=||Tr_R |E0><E1|||_1, that "decoupling of F from the reference" is the same condition as small V_max(F). The literature states the complementary-channel recovery/privacy theorem and the interferometric visibility/path-information theorem; translating between them requires identifying R as the which-path detector/complement, not F.
B. HAAR-SCRAMBLED ENVIRONMENT: EXPECTED RECOVERABLE COHERENCE VS k
[verified-at-source] The Page/decoupling threshold is source-verified. Page, "Average Entropy of a Subsystem," arXiv:gr-qc/9305007, Phys. Rev. Lett. 71, 1291-1294 (1993), DOI 10.1103/PhysRevLett.71.1291, gives: "If a quantum system of Hilbert space dimension mn is in a random pure state, the average entropy of a subsystem of dimension m <= n is ... ~= ln m - m/(2n). Thus there is less than one-half unit of information, on average, in the smaller subsystem of a total system in a random pure state."
[verified-at-source] The one-shot decoupling paper gives the exact half-system partial-trace example. Dupuis et al. write: "As a typical example for decoupling, consider m qubits, A, that are classically maximally correlated to E... assume that A undergoes a reversible evolution, U, after which we discard m-m' qubits, corresponding to a partial trace... Our criterion then says that the remaining m' qubits will, for most evolutions U, be decoupled from E whenever m' < m/2. Conversely, if this condition is not satisfied, some correlation will necessarily be retained." This is the cleanest exact literature statement of the half threshold for random unitary plus partial trace.
[verified-at-source] Hayden and Preskill give the black-hole operational version. P. Hayden and J. Preskill, "Black holes as mirrors: quantum information in random subsystems," arXiv:0708.4025, JHEP 0709:120 (2007), DOI 10.1088/1126-6708/2007/09/120, abstract: "If the evaporation of the black hole has already proceeded past the 'half-way' point, where half of the initial entropy has been radiated away, then additional quantum information deposited in the black hole is revealed in the Hawking radiation very rapidly. Information deposited prior to the half-way point remains concealed until the half-way point, and then emerges quickly."
[verified-at-source] Hayden, Leung, and Winter supply the generic-entanglement/concentration background, not the exact V_max average. P. Hayden, D. W. Leung, A. Winter, "Aspects of generic entanglement," arXiv:quant-ph/0407049, Commun. Math. Phys. 265, 95-117 (2006), DOI 10.1007/s00220-006-1535-6, abstract: "We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the 'concentration of measure' phenomenon." They quote Page's entropy formula as Lemma II.4.
[verified-at-source] The closest direct average-fidelity paper is not the exact ensemble in the prompt. K. Zyczkowski and H.-J. Sommers, "Average fidelity between random quantum states," arXiv:quant-ph/0311117, Phys. Rev. A 71, 032313 (2005), DOI 10.1103/PhysRevA.71.032313, abstract: "We analyze mean fidelity between random density matrices of size N, generated with respect to various probability measures... the measures induced by partial trace... In certain cases explicit probability distributions for fidelity are derived." The paper says induced measures apply when a mixed state arises "by the partial tracing over a K dimensional environment," but it studies two independent random states; the prompt's rho_R^0 and rho_R^1 are correlated because |E0>, |E1> are orthogonal columns of one Haar isometry.
[verified-at-source] Therefore the sharp literature-backed scaling is: for Haar scrambling, branch coherence recoverable from F becomes large once the complement R is smaller than F, i.e. k > n/2 up to O(1) logical-size/error terms; full qubit decoding uses the stronger complementary-channel decoupling condition, while the two-branch V_max asks only for high fidelity/low distinguishability of the two R branch states. I did not locate a closed-form expectation or concentration theorem for exactly E ||Tr_R |E0><E1|||_1.
C. LOCAL RANDOM CIRCUITS OF DEPTH d
[verified-at-source] Nahum, Vijay, and Haah compute operator spreading and OTOC fronts, not V_max. A. Nahum, S. Vijay, J. Haah, "Operator Spreading in Random Unitary Circuits," arXiv:1705.08975, Phys. Rev. X 8, 021014 (2018), DOI 10.1103/PhysRevX.8.021014, abstract: "We provide exact results and coarse-grained models for the spreading of operators by quantum circuits made of Haar-random unitaries." They state that in 1+1D "the out-of-time-order correlator (OTOC) satisfies a biased diffusion equation" and the front broadens as t^{1/2}.
[verified-at-source] von Keyserlingk, Rakovszky, Pollmann, and Sondhi likewise compute OTOCs and entanglement growth. C. W. von Keyserlingk et al., "Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws," arXiv:1705.08910, Phys. Rev. X 8, 021013 (2018), DOI 10.1103/PhysRevX.8.021013, abstract: "quantum information travels in a front with a 'butterfly velocity' v_B that is smaller than the light cone velocity of the system, while the front itself broadens diffusively in time."
[verified-at-source] Brown and Fawzi give a random-circuit decoupling theorem, but for all-to-all/local-random circuit complexity rather than fragment V_max(k,d). W. Brown and O. Fawzi, "Decoupling with random quantum circuits," arXiv:1307.0632, Commun. Math. Phys. 340, 867-900 (2015), DOI 10.1007/s00220-015-2470-1, abstract: "random quantum circuits with O(n log^2 n) gates satisfy an essentially optimal decoupling theorem" and can be implemented in depth O(log^3 n) when all particles are allowed to interact.
[verified-at-source] There are newer local-circuit erasure-threshold results, but they are about QEC decoding failure probability, not branch-coherence trace norm. M. J. Gullans et al., "Quantum coding with low-depth random circuits," arXiv:2010.09775, Phys. Rev. X 11, 031066 (2021), DOI 10.1103/PhysRevX.11.031066, abstract: for random stabilizer codes and erasure channel, "a depth O(log N) random circuit is necessary and sufficient to converge... to zero failure probability for any finite amount below the optimal erasure threshold," with D=1 moderate-deviation depth O(sqrt(N)).
[verified-at-source] A direct Hayden-Preskill-in-circuits paper exists, but again it tracks recovery fidelity/protocols rather than the prompt's V_max. S. W. Li et al., "Hayden-Preskill recovery in chaotic and integrable unitary circuit dynamics," Quantum 8, 1434 (2024), DOI 10.22331/q-2024-08-08-1434, says: "The Hayden-Preskill protocol probes the capability of information recovery from local subsystems after unitary dynamics" and presents "exact results on the use of Hayden-Preskill recovery as a dynamical probe of scrambling" in dual-unitary and Haar-random circuits.
[verified-at-source] Clean answer to C: I found no local-random-circuit paper computing k*(d) for V_max(F)=||Tr_R |E0><E1|||_1. The available literature supports the qualitative picture that the threshold front moves ballistically with the operator/butterfly light cone and broadens diffusively in 1D random circuits, but the exact recoverable-coherence fragment threshold is not stated in the checked sources.
D. FRAGMENT COMPLEMENTARITY
[verified-at-source] Englert is directly on point for visibility versus which-way information. B.-G. Englert, "Fringe Visibility and Which-Way Information: An Inequality," Phys. Rev. Lett. 77, 2154 (1996), DOI 10.1103/PhysRevLett.77.2154, abstract: "An inequality is derived according to which the fringe visibility in a two-way interferometer sets an absolute upper bound on the amount of which-way information that is potentially stored in a which-way detector."
[verified-at-source] Bagan, Bergou, Cottrell, and Hillery generalize to coherence/path information. E. Bagan, J. A. Bergou, S. S. Cottrell, M. Hillery, "Relations between coherence and path information," arXiv:1509.04592, Phys. Rev. Lett. 116, 160406 (2016), DOI 10.1103/PhysRevLett.116.160406, abstract: "We find two relations between coherence and path-information in a multi-path interferometer." They state that for two-path interferometers Englert "introduced detectors into the problem in order to define the path information" and that path information is related to distinguishability of detector states. Their Eq. (3) is "(P_s - 1/N)^2 + X^2 <= (1 - 1/N)^2," where X is an l1 coherence measure and P_s is minimum-error path-discrimination success probability.
[verified-at-source] Bera, Qureshi, Siddiqui, and Pati give another multipath/generalized duality. M. N. Bera, T. Qureshi, M. A. Siddiqui, A. K. Pati, "Duality of Quantum Coherence and Path Distinguishability," arXiv:1503.02990, Phys. Rev. A 92, 012118 (2015), DOI 10.1103/PhysRevA.92.012118, abstract: "For two-path interference, the quantum coherence is identical to the interference fringe visibility, and the relation reduces to the well-known complementarity relation. The duality relation continues to hold in the case where mixedness is introduced due to possible decoherence effects."
[verified-at-source] Fragment-resolved translation: take R as the which-path detector. Then V_max(F) is the recoverable visibility after access to F, and the which-path information unavailable to the agent is the distinguishability of the two R states. The rigorous fragment version I found is not stated with arbitrary environment fragments F/R, but it is exactly the same detector/complement structure used in Englert-style and QEC-complementarity papers.
WHERE I LOOKED AND FOUND NOTHING
[verified-at-source] Searched for exact phrases and variants: "average trace norm partial trace rank one operator Haar random states", "trace norm partial trace |psi><phi| Haar random orthogonal states average singular values", "singular values of partial trace of random rank one operator random quantum states induced fidelity", and "average fidelity between reduced density matrices of two random orthogonal pure states". Result: no exact formula for E ||Tr_R |E0><E1|||_1 in the prompt's correlated Haar-orthogonal branch ensemble.
[verified-at-source] Checked Page arXiv:gr-qc/9305007, Hayden-Preskill arXiv:0708.4025, Dupuis-Berta-Wullschleger-Renner arXiv:1012.6044, Hayden-Leung-Winter arXiv:quant-ph/0407049, Zyczkowski-Sommers arXiv:quant-ph/0311117, Kretschmann-Kribs-Spekkens arXiv:0711.3438, Bény-Oreshkov arXiv:0907.5391, Brown-Fawzi arXiv:1307.0632, Nahum-Vijay-Haah arXiv:1705.08975, von Keyserlingk-Rakovszky-Pollmann-Sondhi arXiv:1705.08910, Gullans et al. arXiv:2010.09775, Englert PRL DOI page, Bagan-Bergou-Cottrell-Hillery arXiv:1509.04592, and Bera-Qureshi-Siddiqui-Pati arXiv:1503.02990.
[verified-at-source] PDF extraction was unavailable in this environment, so verification used arXiv abstract pages, arXiv HTML conversions, APS DOI pages, Quantum journal page text, and local grep/sed over fetched arXiv HTML spill files.
View exactly as delivered (raw text)
# VERDICT
[verified-at-source] The "more than half" threshold applies to coherence recovery only in the complement-side sense: V_max(F) is controlled by whether the inaccessible remainder R can distinguish the two branch states, and Haar/decoupling results put the transition at dim(F) roughly exceeding dim(R), i.e. k > n/2, with the usual one-logical-qubit/O(1) offsets for full quantum decoding. Dupuis-Berta-Wullschleger-Renner state explicitly that for m qubits randomly evolved and then partially traced, the remaining m' qubits decouple from a reference when m' < m/2 and otherwise retain correlation; Hayden-Preskill state the same threshold operationally for recovery from radiation after the halfway point. [verified-at-source] This is not the same as "F is decoupled from the reference": recovery from F is equivalent in the QEC literature to the complement R being private/decoupled, while the prompt's V_max(F) is a two-branch coherence/fidelity quantity and is weaker than full qubit recovery. [verified-at-source] I did not find a paper giving an exact closed form for E ||Tr_R |E0><E1|||_1 for a Haar-random orthonormal branch pair; the closest exact literature computes average fidelity of independent random induced states, not this correlated orthogonal-pair ensemble. [verified-at-source] For local random circuits, I found operator-spreading/OTOC fronts and separate erasure-threshold decoding papers, but not a direct computation of this recoverable-coherence trace norm V_max(F,d).
# A. DECOUPLING OF F FROM REFERENCE VS SMALL V_MAX(F)
[verified-at-source] They are different conditions. The quantum-error-correction/decoupling statement is: information is recoverable from a subsystem when the complementary subsystem is private/decoupled from the logical/reference system. Kretschmann, Kribs, and Spekkens, "Complementarity of Private and Correctable Subsystems in Quantum Cryptography and Error Correction," arXiv:0711.3438, Phys. Rev. A 78, 032330 (2008), DOI 10.1103/PhysRevA.78.032330, state in the abstract: "We show that a subsystem is private for a channel precisely when it is correctable for a complementary channel." Their Theorem 5 states: "If a subsystem B is epsilon-correctable (respectively epsilon-private) for E, then it is 2 sqrt(epsilon)-private (respectively 2 sqrt(epsilon)-correctable) for E^sharp. The ideal result, obtained by setting epsilon=0 implies that B is a correctable subsystem for E if and only if B is a private subsystem for E^sharp."
[verified-at-source] Bény and Oreshkov give the fidelity version of the same recovery/complement duality. C. Bény and O. Oreshkov, "General conditions for approximate quantum error correction and near-optimal recovery channels," arXiv:0907.5391, Phys. Rev. Lett. 104, 120501 (2010), DOI 10.1103/PhysRevLett.104.120501, write: "We show that the optimal recovery fidelity can be predicted exactly from a dual optimization problem on the environment causing the noise." Their Theorem 1 states: "max_R F(R N, M) = max_R' F(N^, R' M^)," where N^ and M^ are complementary channels.
[verified-at-source] This is not the same as decoupling of F from the reference. Dupuis, Berta, Wullschleger, and Renner define decoupling as product form of the system being tested with the reference: "We call a system, B, decoupled from another system, E, if the joint state of the two systems, rho_BE, has product form rho_B tensor rho_E. Operationally, this means that the outcome of any measurement on B is statistically independent of the outcome of any measurement on E." Source: F. Dupuis, M. Berta, J. Wullschleger, R. Renner, "One-shot decoupling," arXiv:1012.6044, Commun. Math. Phys. 328, 251 (2014), DOI 10.1007/s00220-014-1990-4.
[verified-at-source] The prompt's V_max(F) is instead a recoverable interference/branch-coherence quantity. Bény-Oreshkov explicitly invoke Uhlmann's theorem as converting a recovery fidelity to an "overlap maximized over unitary operators"; in two-branch language, Uhlmann's theorem identifies the optimal branch-overlap recoverable by acting on F with the fidelity of the inaccessible branch states on R. This connects V_max(F) to how well R can distinguish the branches, not to whether F itself is uncorrelated with the reference.
[verified-at-source] Clean answer to A: I found no paper stating, in exactly the notation V_max(F)=||Tr_R |E0><E1|||_1, that "decoupling of F from the reference" is the same condition as small V_max(F). The literature states the complementary-channel recovery/privacy theorem and the interferometric visibility/path-information theorem; translating between them requires identifying R as the which-path detector/complement, not F.
# B. HAAR-SCRAMBLED ENVIRONMENT: EXPECTED RECOVERABLE COHERENCE VS k
[verified-at-source] The Page/decoupling threshold is source-verified. Page, "Average Entropy of a Subsystem," arXiv:gr-qc/9305007, Phys. Rev. Lett. 71, 1291-1294 (1993), DOI 10.1103/PhysRevLett.71.1291, gives: "If a quantum system of Hilbert space dimension mn is in a random pure state, the average entropy of a subsystem of dimension m <= n is ... ~= ln m - m/(2n). Thus there is less than one-half unit of information, on average, in the smaller subsystem of a total system in a random pure state."
[verified-at-source] The one-shot decoupling paper gives the exact half-system partial-trace example. Dupuis et al. write: "As a typical example for decoupling, consider m qubits, A, that are classically maximally correlated to E... assume that A undergoes a reversible evolution, U, after which we discard m-m' qubits, corresponding to a partial trace... Our criterion then says that the remaining m' qubits will, for most evolutions U, be decoupled from E whenever m' < m/2. Conversely, if this condition is not satisfied, some correlation will necessarily be retained." This is the cleanest exact literature statement of the half threshold for random unitary plus partial trace.
[verified-at-source] Hayden and Preskill give the black-hole operational version. P. Hayden and J. Preskill, "Black holes as mirrors: quantum information in random subsystems," arXiv:0708.4025, JHEP 0709:120 (2007), DOI 10.1088/1126-6708/2007/09/120, abstract: "If the evaporation of the black hole has already proceeded past the 'half-way' point, where half of the initial entropy has been radiated away, then additional quantum information deposited in the black hole is revealed in the Hawking radiation very rapidly. Information deposited prior to the half-way point remains concealed until the half-way point, and then emerges quickly."
[verified-at-source] Hayden, Leung, and Winter supply the generic-entanglement/concentration background, not the exact V_max average. P. Hayden, D. W. Leung, A. Winter, "Aspects of generic entanglement," arXiv:quant-ph/0407049, Commun. Math. Phys. 265, 95-117 (2006), DOI 10.1007/s00220-006-1535-6, abstract: "We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the 'concentration of measure' phenomenon." They quote Page's entropy formula as Lemma II.4.
[verified-at-source] The closest direct average-fidelity paper is not the exact ensemble in the prompt. K. Zyczkowski and H.-J. Sommers, "Average fidelity between random quantum states," arXiv:quant-ph/0311117, Phys. Rev. A 71, 032313 (2005), DOI 10.1103/PhysRevA.71.032313, abstract: "We analyze mean fidelity between random density matrices of size N, generated with respect to various probability measures... the measures induced by partial trace... In certain cases explicit probability distributions for fidelity are derived." The paper says induced measures apply when a mixed state arises "by the partial tracing over a K dimensional environment," but it studies two independent random states; the prompt's rho_R^0 and rho_R^1 are correlated because |E0>, |E1> are orthogonal columns of one Haar isometry.
[verified-at-source] Therefore the sharp literature-backed scaling is: for Haar scrambling, branch coherence recoverable from F becomes large once the complement R is smaller than F, i.e. k > n/2 up to O(1) logical-size/error terms; full qubit decoding uses the stronger complementary-channel decoupling condition, while the two-branch V_max asks only for high fidelity/low distinguishability of the two R branch states. I did not locate a closed-form expectation or concentration theorem for exactly E ||Tr_R |E0><E1|||_1.
# C. LOCAL RANDOM CIRCUITS OF DEPTH d
[verified-at-source] Nahum, Vijay, and Haah compute operator spreading and OTOC fronts, not V_max. A. Nahum, S. Vijay, J. Haah, "Operator Spreading in Random Unitary Circuits," arXiv:1705.08975, Phys. Rev. X 8, 021014 (2018), DOI 10.1103/PhysRevX.8.021014, abstract: "We provide exact results and coarse-grained models for the spreading of operators by quantum circuits made of Haar-random unitaries." They state that in 1+1D "the out-of-time-order correlator (OTOC) satisfies a biased diffusion equation" and the front broadens as t^{1/2}.
[verified-at-source] von Keyserlingk, Rakovszky, Pollmann, and Sondhi likewise compute OTOCs and entanglement growth. C. W. von Keyserlingk et al., "Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws," arXiv:1705.08910, Phys. Rev. X 8, 021013 (2018), DOI 10.1103/PhysRevX.8.021013, abstract: "quantum information travels in a front with a 'butterfly velocity' v_B that is smaller than the light cone velocity of the system, while the front itself broadens diffusively in time."
[verified-at-source] Brown and Fawzi give a random-circuit decoupling theorem, but for all-to-all/local-random circuit complexity rather than fragment V_max(k,d). W. Brown and O. Fawzi, "Decoupling with random quantum circuits," arXiv:1307.0632, Commun. Math. Phys. 340, 867-900 (2015), DOI 10.1007/s00220-015-2470-1, abstract: "random quantum circuits with O(n log^2 n) gates satisfy an essentially optimal decoupling theorem" and can be implemented in depth O(log^3 n) when all particles are allowed to interact.
[verified-at-source] There are newer local-circuit erasure-threshold results, but they are about QEC decoding failure probability, not branch-coherence trace norm. M. J. Gullans et al., "Quantum coding with low-depth random circuits," arXiv:2010.09775, Phys. Rev. X 11, 031066 (2021), DOI 10.1103/PhysRevX.11.031066, abstract: for random stabilizer codes and erasure channel, "a depth O(log N) random circuit is necessary and sufficient to converge... to zero failure probability for any finite amount below the optimal erasure threshold," with D=1 moderate-deviation depth O(sqrt(N)).
[verified-at-source] A direct Hayden-Preskill-in-circuits paper exists, but again it tracks recovery fidelity/protocols rather than the prompt's V_max. S. W. Li et al., "Hayden-Preskill recovery in chaotic and integrable unitary circuit dynamics," Quantum 8, 1434 (2024), DOI 10.22331/q-2024-08-08-1434, says: "The Hayden-Preskill protocol probes the capability of information recovery from local subsystems after unitary dynamics" and presents "exact results on the use of Hayden-Preskill recovery as a dynamical probe of scrambling" in dual-unitary and Haar-random circuits.
[verified-at-source] Clean answer to C: I found no local-random-circuit paper computing k*(d) for V_max(F)=||Tr_R |E0><E1|||_1. The available literature supports the qualitative picture that the threshold front moves ballistically with the operator/butterfly light cone and broadens diffusively in 1D random circuits, but the exact recoverable-coherence fragment threshold is not stated in the checked sources.
# D. FRAGMENT COMPLEMENTARITY
[verified-at-source] Englert is directly on point for visibility versus which-way information. B.-G. Englert, "Fringe Visibility and Which-Way Information: An Inequality," Phys. Rev. Lett. 77, 2154 (1996), DOI 10.1103/PhysRevLett.77.2154, abstract: "An inequality is derived according to which the fringe visibility in a two-way interferometer sets an absolute upper bound on the amount of which-way information that is potentially stored in a which-way detector."
[verified-at-source] Bagan, Bergou, Cottrell, and Hillery generalize to coherence/path information. E. Bagan, J. A. Bergou, S. S. Cottrell, M. Hillery, "Relations between coherence and path information," arXiv:1509.04592, Phys. Rev. Lett. 116, 160406 (2016), DOI 10.1103/PhysRevLett.116.160406, abstract: "We find two relations between coherence and path-information in a multi-path interferometer." They state that for two-path interferometers Englert "introduced detectors into the problem in order to define the path information" and that path information is related to distinguishability of detector states. Their Eq. (3) is "(P_s - 1/N)^2 + X^2 <= (1 - 1/N)^2," where X is an l1 coherence measure and P_s is minimum-error path-discrimination success probability.
[verified-at-source] Bera, Qureshi, Siddiqui, and Pati give another multipath/generalized duality. M. N. Bera, T. Qureshi, M. A. Siddiqui, A. K. Pati, "Duality of Quantum Coherence and Path Distinguishability," arXiv:1503.02990, Phys. Rev. A 92, 012118 (2015), DOI 10.1103/PhysRevA.92.012118, abstract: "For two-path interference, the quantum coherence is identical to the interference fringe visibility, and the relation reduces to the well-known complementarity relation. The duality relation continues to hold in the case where mixedness is introduced due to possible decoherence effects."
[verified-at-source] Fragment-resolved translation: take R as the which-path detector. Then V_max(F) is the recoverable visibility after access to F, and the which-path information unavailable to the agent is the distinguishability of the two R states. The rigorous fragment version I found is not stated with arbitrary environment fragments F/R, but it is exactly the same detector/complement structure used in Englert-style and QEC-complementarity papers.
# WHERE I LOOKED AND FOUND NOTHING
[verified-at-source] Searched for exact phrases and variants: "average trace norm partial trace rank one operator Haar random states", "trace norm partial trace |psi><phi| Haar random orthogonal states average singular values", "singular values of partial trace of random rank one operator random quantum states induced fidelity", and "average fidelity between reduced density matrices of two random orthogonal pure states". Result: no exact formula for E ||Tr_R |E0><E1|||_1 in the prompt's correlated Haar-orthogonal branch ensemble.
[verified-at-source] Checked Page arXiv:gr-qc/9305007, Hayden-Preskill arXiv:0708.4025, Dupuis-Berta-Wullschleger-Renner arXiv:1012.6044, Hayden-Leung-Winter arXiv:quant-ph/0407049, Zyczkowski-Sommers arXiv:quant-ph/0311117, Kretschmann-Kribs-Spekkens arXiv:0711.3438, Bény-Oreshkov arXiv:0907.5391, Brown-Fawzi arXiv:1307.0632, Nahum-Vijay-Haah arXiv:1705.08975, von Keyserlingk-Rakovszky-Pollmann-Sondhi arXiv:1705.08910, Gullans et al. arXiv:2010.09775, Englert PRL DOI page, Bagan-Bergou-Cottrell-Hillery arXiv:1509.04592, and Bera-Qureshi-Siddiqui-Pati arXiv:1503.02990.
[verified-at-source] PDF extraction was unavailable in this environment, so verification used arXiv abstract pages, arXiv HTML conversions, APS DOI pages, Quantum journal page text, and local grep/sed over fetched arXiv HTML spill files.