After applying our gate sequence to the qubit initialized in |e2, e1, n1⟩ = |+ + +⟩, we get |Oi⟩ = 1 2n/2+1 X x={0,1}n |x⟩c |+⟩a + (−1)f (x) |x⟩c |−⟩a (S28)

Experimental data To characterize our gate performance, we first check the parity of the three spin qubits after applying our protocol

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

Universal distributed blind quantum computing with solid-state qubits

quant-ph · 2024-12-04 · conditional · novelty 7.0

A two-node network of silicon-vacancy spin qubits performs single- and two-qubit blind quantum gates and a Deutsch-Jozsa-type algorithm with hidden oracles.

citing papers explorer

Showing 1 of 1 citing paper.

Universal distributed blind quantum computing with solid-state qubits quant-ph · 2024-12-04 · conditional · none · ref 5
A two-node network of silicon-vacancy spin qubits performs single- and two-qubit blind quantum gates and a Deutsch-Jozsa-type algorithm with hidden oracles.

After applying our gate sequence to the qubit initialized in |e2, e1, n1⟩ = |+ + +⟩, we get |Oi⟩ = 1 2n/2+1 X x={0,1}n |x⟩c |+⟩a + (−1)f (x) |x⟩c |−⟩a (S28)

fields

years

verdicts

representative citing papers

citing papers explorer