# Techniques: Verifiable blind quantum computing with trapped ions and single photons

## What the paper contributes (one paragraph)
This paper reports the first hybrid matter-photon implementation of verifiable blind quantum computing. A trapped-ion server (a memory qubit in calcium plus a network qubit in strontium) is networked to a client that holds only a photonic polarisation measurement device, linked by an optical fibre. The client steers the network qubit by measuring photons, performing remote state preparation so that inputs, outputs, and circuit are hidden from the server with information-theoretic blindness, quantified here at about 0.03 leaked classical bits per qubit. The client verifies that the computation was not tampered with by secretly interleaving test rounds that contain trap and dummy qubits and have classically predictable outcomes; a statistical argument bounds the security and robustness of accepting a result for bounded-error quantum polynomial time decision problems. Deterministic gates and a quantum memory remove the post-selection that limited earlier purely photonic demonstrations.

## Techniques offered
- **Blind (delegated) quantum computation** - hides a client's input, output, and algorithm from an untrusted quantum server by encrypting measurement angles via remote state preparation, supplying information-theoretic privacy for delegated computation.
  - guarantee: information-theoretic security (blindness), measured leakage of about 0.031(4) classical bits per interaction step.
  - quote: "Remarkably, the same phenomena that enable quantum computing can leave the server \enquote{blind} in a way that conceals the client's input, output, and algorithm~\cite{broadbent_universal_2009, fitzsimons_unconditionally_2017, gheorghiu_verification_2019};"
- **Trap-based verification via interleaved test rounds** - secretly interleaves computation and test rounds containing trap and dummy qubits whose outcomes the client can predict, so a noisy or malicious server's deviations are detected by the failed-test fraction.
  - guarantee: statistical bound; the probability of accepting an incorrect result decreases exponentially with the number of rounds below threshold omega_max.
  - quote: "The protocol implemented here achieves this by interleaving \enquote{computation} and \enquote{test} rounds."
- **Remote state preparation by steering** - the client prepares an arbitrary single-qubit state on the server by measuring a server-supplied entangled photon and returning a classical correction, needing only one-way quantum communication from server to client.
  - guarantee: interactive soundness; proven to implement the remote-state-preparation resource with perfect security against a malicious server, with untrusted entangled-pair preparation.
  - quote: "Protocol~\ref{protocol:rsp-steering} implements Resource~\ref{resource:rsp} with perfect security against a malicious server."

## Where it could apply
- Target primitive(s): any measurement-based (one-way) computation expressed on graph or cluster states; BQP decision problems; single-qubit-rotation circuits demonstrated as H Z(alpha1) and X(alpha2) Z(alpha1).
- Target application group(s): platforms_tooling; security and privacy for cloud or delegated quantum computing.
- Code family / hardware assumptions: trapped-ion server (calcium memory qubit, strontium network qubit) with a single-photon fibre link to a photonic client; no error correction in the implemented protocol.

## Caveats
The verification and blindness are demonstrated on short linear cluster states only; verification succeeds for a two-node cluster but fails for the three-node case, largely owing to the about 0.91 fidelity iSWAP gate. The implemented protocol incorporates no error correction, so verifying larger clusters requires lower per-step error. The security and robustness bounds and the remote-state-preparation security proof are taken from or proven against the cited theory of Leichtle et al.; the experimental contribution is the hybrid matter-photon realisation rather than the theoretical guarantees themselves.