Quantum State Continuity Witness (QSCW)

• Quantum State Continuity Witness (QSCW) is a quantum-assisted primitive that ensures a continuous, unbroken evolution of quantum states, countering fork attacks.
• It employs a GHZ-based instantiation with sequential unitary updates and randomized audits to verify that each state reliably follows its predecessor.
• The protocol achieves exponential suppression of fork attack success through cumulative evidence and robust measurement strategies under realistic noise conditions.

The Quantum State Continuity Witness (QSCW) is a quantum-assisted primitive designed to address the Quantum State Continuity Problem (QSCP), which centers on guaranteeing that a system's current quantum execution is a legitimate continuation of a unique, uninterrupted quantum history. Unlike traditional authentication, QSCW enforces temporal linkage through stateful quantum evolution and cumulative auditing, detecting and suppressing fork attacks that attempt to create multiple diverging quantum states from a single origin. This approach capitalizes on quantum mechanical constraints—especially no-cloning and measurement disturbance—and features a minimal instantiation based on GHZ states, demonstrating formal fork resistance and robustness to realistic noise conditions (Ünsal, 30 Dec 2025).

1. Quantum State Continuity Problem (QSCP): Definition and Formulation

QSCP asks whether, during multiple interactive rounds between a quantum-aware prover and a verifier, the evidence produced at each round is the result of a sequential, honest quantum evolution, as opposed to multiple "forked" executions arising from any earlier state. Let the prover's internal quantum state at round $t$ be $\rho_t \in \mathcal{H}$, with $\mathcal{H}$ a Hilbert space. Continuity is present if the sequence $(\rho_0, \rho_1, ..., \rho_T)$ evolves by prescribed rules, and each piece of evidence derives from the immediate predecessor $\rho_{t-1}$.

A fork attack occurs at time $t_\mathrm{fork}$ if the adversary branches the prover into two or more quantum states, $\rho_{t_\mathrm{fork}}^{(0)}$, $\rho_{t_\mathrm{fork}}^{(1)}$, which then independently attempt to pass future verifications. QSCP is satisfied when the probability that all forked branches pass a finite window of $W$ audit rounds is negligible:

$$P_\mathrm{win}(\mathcal{A}) = \Pr[\mathcal{A} \text{ wins } \mathcal{G}_\mathrm{QSCP}(\lambda, W)] \leq \mathrm{negl}(\lambda)$$

where $\lambda$ is a security parameter and $\mathcal{G}_\mathrm{QSCP}$ is a canonical security game defining the adversarial challenge.

2. Adversarial Model and Security Objective

The adversarial model grants full classical control to $\mathcal{A}$: memory resets, state snapshotting, and adaptive interaction with the prover. Physical quantum constraints impose the no-cloning theorem and measurement disturbance. At the fork point, the adversary may attempt to measure or approximate the witness quantum state and then create $k$ branches that each seek to pass future audits.

The principal security objective is fork resistance: for any efficient adversary, the probability that all forked branches pass all $W$ audit rounds is bounded by

$$P_\mathrm{win}(\mathcal{A}) \leq 2^{-W} + \mathrm{negl}(\lambda)$$

This exponential decay in fork success probability across the audit window $W$ is a distinguishing property of the QSCW primitive.

3. QSCW Primitive: Structure and Procedures

QSCW is characterized by three quantum procedures:

• Init: Prepares an initial witness state $\rho_0$ on $\mathcal{H}$.
• Update($c_t$): Applies a unitary $U(c_t)$, depending on the challenge $c_t$, to the previous state, generating $\rho_t = U(c_t)\rho_{t-1}U(c_t)^\dagger$. Ancilla may be introduced.
• Audit: Measures a selected register of $\rho_t$ in a verifier-chosen basis, producing classical evidence $E_t$. Audit evaluates statistical consistency against predefined thresholds.

The defining property is that each update encodes the entire challenge history, so $\rho_t$ implicitly "remembers" all prior $c_1, ..., c_t$. Any attempt to clone or branch $\rho_{t-1}$ disturbs this cumulative memory, an effect cumulatively detectable via sequential audits.

Stateful Evolution and Cumulative Auditing

Unitary updates based on successive challenges $U(c_t)$ ensure the quantum state at time $t$, $\rho_t$, is a global encoding of the challenge trajectory. Forked attempts cannot produce multiple high-fidelity $\rho_t$ instances due to quantum no-cloning. The audit procedure leverages randomized basis choice (e.g., X vs. Z) on the audit register, where the adversary's deviation from the honest state becomes statistically exposed with each additional audit round.

4. GHZ-Based Instantiation and Protocol Dynamics

The reference implementation initializes an $n$-qubit GHZ state:

$$|GHZ_n\rangle = \frac{|0\rangle^{\otimes n} + |1\rangle^{\otimes n}}{\sqrt{2}}$$

At each round $t$:

1. Challenge: Verifier sends $c_t \in \{0, 1\}^k$.
2. Update: Prover computes parity $p_t = \mathrm{parity}(c_t)$ and applies $U(c_t) = Z_1^{p_t}$, flipping GHZ global phase to record cumulative parity history.
3. Audit:
   • Verifier randomly selects $B_t \in \{X, Z\}$.
   • Prover measures all qubits in basis $B_t$, outputting $m_t \in \{0,1\}^n$.
   • Parity $\pi(m_t) = \bigoplus_{i=1}^n m_t[i]$ evaluated.
   • For $B_t=Z$, all outcomes are consistent; for $B_t=X$, parity matches phase: $GHZ^+$ yields even, $GHZ^-$ odd parity.
   • Accept only if $\pi(m_t) = \varphi_t$ (where $\varphi_t = \sum_{j=1}^{t} p_j \bmod 2$) when $B_t=X$.

Any disturbance or approximation introduced during forking leads to a mismatch in parity on $X$-audited rounds with probability $1$.

5. Security Analysis: Exponential Suppression of Fork Attacks

Post-fork, for each audit round $i$:

• If $B_i = Z$, both branches always pass.
• If $B_i = X$, at least one branch faces ambiguity in correctly reconstructing the global phase, so the probability of both passing is at most $1/2$.

The roundwise average:

$$\Pr[\text{both branches pass round } i ] \leq \frac{1}{2} \cdot 1 + \frac{1}{2} \cdot \frac{1}{2} = \frac{3}{4}$$

Over $W$ independent rounds:

$$P_\mathrm{win} \leq \left(\frac{3}{4}\right)^W \leq 2^{-W}$$

Thus, fork success probability decreases exponentially with window size $W$. This decisiveness is amplified when the proportion of $X$-basis audits is increased or when using trace-distance bounds for tighter analysis.

6. Robustness and Parameter Dependence

Simulation in the NISQ regime (depolarizing noise $p$ per qubit per round) demonstrates:

• Audit Pass Rate (APR) for honest executions remains above $90\%$ up to $p \approx 1$-$2\%$.
• Fork Success Rate (FSR) is unaffected by noise, qubit count $n$, measurement shots $S$, or audit thresholds $\tau_x$.
• FSR as a function of audit window $W$ is linear in the logarithmic scale, consistent with $2^{-W}$ decay.
• Adjusting the fraction of $X$-basis audits or threshold $\tau_x$ trades off APR and FSR; there exists a broad parameter "sweet spot" with APR $\approx 99\%$ and FSR $\approx 2^{-W}$.

This suggests that continuity enforcement is robust to realistic noise and does not require large quantum resources or fine parameter tuning.

7. Significance and Future Directions

QSCW introduces a distinct security dimension—temporal continuity—orthogonal to authentication or classical state integrity. By leveraging quantum mechanical properties, QSCW is demonstrably resistant to fork attacks with a rigorous, exponentially decaying failure probability. The GHZ-based instantiation provides both conceptual clarity and practical simulation evidence for its core mechanisms.

A plausible implication is that continuity enforcement via QSCW could become a foundational primitive in quantum-secure protocols, particularly as quantum devices scale and fork attacks target evolving quantum credentials or states. Further exploration may address optimized witness constructions, audit basis selection strategies, and integration into broader quantum system architectures (Ünsal, 30 Dec 2025).