The DOI matches its Crossref record; 57 of the 58 references it cites were found in a registry or an index; none of the 26 sources its claims cite is checked for support yet.
Demonstration of Blind Quantum Computing
Open accessAbstract
Quantum Blindness: While quantum computers offer speed advantages over their classical counterparts, the technological challenges facing their eventual realization suggest that they will need to be located in specialized facilities. Thus, interaction would then need to be on a quantum client:quantum server basis. Barz et al. (p. 303 ; see the Perspective by Vedral ) implemented a proof-of-principle protocol that illustrates complete security in such a setup—for both the client and the server. In this blind quantum computing protocol, the client maintains the security of their data and the specifics of the calculation they want to perform, and the server cannot access the data or calculation of the client.
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper reports the first experimental demonstration of blind quantum computation, where a client delegates computations to a quantum server while keeping input, computation, and output hidden. Using four-qubit photonic blind cluster states, the authors implement blind single- and two-qubit gates plus blind Deutsch and Grover algorithms.
Key findings
- The experiment demonstrated blind delegated computations on four-qubit blind cluster states, including one- and two-qubit gates and the Deutsch and Grover algorithms.
- Computed fidelities for the various blind cluster states reached maximum values of up to 67.9 ± 0.4% via local unitary transformation.
- Blindness was quantified by Holevo information χ = 0.169 ± 0.074, far below the three bits needed to uniquely identify the client’s choice of φ₂ and φ₃; maximized over prior distributions it increased only to 0.185 ± 0.087.
- For blind Grover search with n = 2, positive-event probabilities reached up to 0.850 ± 0.039, with an average over all blind states of 0.720 ± 0.015, while no classical algorithm can exceed 0.5. For blind Deutsch, output fidelities were F = 0.930 ± 0.025 for the constant oracle and F = 0.887 ± 0.033 for the balanced oracle, with correct-result probabilities 0.899 ± 0.006 and 0.895 ± 0.022, respectively.
Methods
- The authors produced four-qubit linear blind cluster states using photon emissions from a non-collinear type-II spontaneous parametric downconversion process, with polarization encoding and local operations to set the client’s blind phases θ₂ and θ₃.
- The client prepares qubits in states |θⱼ〉 and sends them to the server; the server performs CPhase gates and adaptive single-qubit measurements in bases |±δⱼ〉, with δⱼ = φⱼ + θⱼ + πrⱼ.
- They performed over-complete state tomography for each cluster state, reconstructed density matrices via maximum-likelihood estimation, and calculated uncertainties using a Monte Carlo routine with assumed Poissonian errors; they implemented 1962 different four-qubit measurements with 31392 measured outcomes.
Limitations
- The paper states that emitted photons not contributing to the cluster state can in principle reveal information about the blind phases, and that post-selection and photon losses decrease protocol efficiency.
- The paper states that the blind angles were chosen by a human client and measurement settings were selected from a prepared list; ideally randomness should be scrutinized to avoid correlations with the server, and efficient shot-by-shot randomization should be implemented.
- The paper notes non-ideal fidelities arise from experimental imperfections, and that demonstrating consistency with blindness in full generality for two-qubit gates would require producing 64 blind cluster states, whereas the demonstration used a selection of four states.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 of 26 cited sources checked · 0 supported · 0 flagged
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Here we show the first such experimental demonstration of blind quantum computation where the input, computation, and output all remain unknown to the computer.”
- Also stated in: § Experimental Demonstration of Blind Quantum Computing · p. 2 · boosted
“We experimentally demonstrate the concept of BQC via a series of blind computations on four-qubit blind cluster states.”
Load-bearingStrength:boosted· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- Also stated in: § Experimental Demonstration of Blind Quantum Computing · p. 2 · boosted
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Remarkably, the client only needs to be able to prepare and transmit individual photonic qubits.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In fact, for the four-qubit blind cluster state it is sufficient for the client to be able to prepare only one or two of the qubits in arbitrary states | θ j 〉 for delegating various one- and two-qubit circuits as well as quantum algorithms, see Figure 2.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We experimentally demonstrate the concept of BQC via a series of blind computations on four-qubit blind cluster states.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Moreover, we have implemented 1962 different four-qubit measurements with 31392 measured outcomes.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“By aligning our setup to produce | Φ (2 ,n ) L 〉 for n = 0 , . . . , 7 and | Φ (6 ,m ) L 〉 for m = 0 , 4, we have demonstrated for the first time the preparation of various four-qubit blind cluster states.”
Load-bearingStrength:boosted· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our computed fidelities for the various blind cluster states achieve maximum values of up to 67 . 9 ± 0 . 4% via local unitary transformation.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Here we demonstrate a blind implementation of Grover's search for n = 2, where blindness ensures that the server is unable to distinguish the actual computation from within a given family of circuits implementing ( I ⊗ R z ( ξ ) H ).”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“By fixing θ 2 and varying θ 3 , we can experimentally demonstrate a blind X -rotation.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In a similar way, the consistency with blindness of the rotated horseshoe cluster | Φ ˆ θ 〉 ⊃ (Figure 2D) can be shown.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes
- It may state two separate claims as one. 19
- Probably not a substantial claim. 21
- Not yet classified. 1
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We demonstrate various blind delegated computations, including oneand two-qubit gates and the Deutsch and Grover algorithms.”
Load-bearingStrength:boosted· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Our protocol uses, compared to the original BQC proposal [29], the experimental resources in an optimised way, independent of the physical system and without affecting blindness.”
What the sources say
- Not checked yetcites [29] Broadbent, A., Fitzsimons, J. & Kashefi, E. Universal blind quantum computation. In Proceedings of the 50th Annual Symposium on Foundations of Computer Science , 517-526 (2009). source
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We show in the next sections the blind staircase cluster allows for the blind implementation of Deutsch's algorithm, while the blind triangle cluster allows for the blind implementation of Grover's algorithm.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Both implemented rotations are blind and the entire computation remains hidden.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We achieve probabilities of finding these positive events of up to 0 . 850 ± 0 . 039 with an average over all blind states of 0 . 720 ± 0 . 015.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“This new fundamental advantage of quantum computers is manifested in the blind quantum computing (BQC) protocol that combines notions of quantum cryptography and quantum computation to achieve the delegation of a quantum computation from a client with no quantum computational power to an untrusted quantum server, such that the client's data remains perfectly private.”
What the sources say
- Not checked yetcites [29] Broadbent, A., Fitzsimons, J. & Kashefi, E. Universal blind quantum computation. In Proceedings of the 50th Annual Symposium on Foundations of Computer Science , 517-526 (2009). source
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is important to note that experimental influences on the server's side only affect the correctness of the computation, while imperfections in the client's qubit preparation might also weaken the assumption of an unbiased state distribution.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Photons are ideally suited for BQC as they provide the natural choice as quantum information carrier for the client and enable quantum computing for the server.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“BQC uses the concept of one-way quantum computing [33-37], a measurement-based model of computation [38, 39] which represents a paradigm shift in the understanding of complex data processing by clearly separating the classical and quantum parts of a computation.”
What the sources say
- Not checked yetcites [33] Raussendorf, R. & Briegel, H. J. A one-way quantum computer. Phys. Rev. Lett. 86 , 5188-5191 (2001). source
- Not checked yetcites [34] Raussendorf, R., Browne, D. E. & Briegel, H. J. Measurement-based quantum computation with cluster states. Phys. Rev. A 68 , 022312 (2003). source
- Not checked yetcites [35] Danos, V., Kashefi, E. & Panangaden, P. The measure- ment calculus. Journal of the ACM 54 , 8 (2007). source
- Not checked yetcites [36] Gross, D., Eisert, J., Schuch, N. & Perez-Garcia, D. Measurement-based quantum computation beyond the one-way model. Phys. Rev. A 76 , 052315 (2007). source
- Not checked yetcites [37] Briegel, H., Browne, D., D¨ ur, W., Raussendorf, R. & Van den Nest, M. Measurement-based quantum computation. Nature Phys. 5 , 19-26 (2009). source
- Not checked yetcites [38] Gottesman, D. & Chuang, I. L. Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature 402 , 390-393 (1999). source
- Not checked yetcites [39] Knill, E., Laflamme, R. & Milburn, G. J. A scheme for efficient quantum computation with linear optics. Nature 409 , 46-52 (2001). source
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“These non-ideal fidelities arise due to experimental imperfections (see Appendix).”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The only quantum power that is required from the client is the preparation of each qubit j in a state | θ j 〉 and the transmission of the qubits to the server - in particular, there is no need for any quantum memory [40] or ability to perform quantum gates.”
What the sources say
- Not checked yetcites [40] Hedges, M., Longdell, J., Li, Y. & Sellars, M. Efficient quantum memory for light. Nature 465 , 1052-1056 (2010). source
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This is a unique feature of photonic systems and so far not realizable in other quantum systems.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is important to note that experimental influences on the server's side only affect the correctness of the computation, while imperfections in the client's qubit preparation might also weaken the assumption of an unbiased state distribution.”
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Different algorithms require only a different pattern of single-qubit measurements on a sufficiently large cluster state.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
In the paper
“These measurements outcomes can be seen as implementing all possible computational branches (due to different measurement outcomes), which is equivalent to directly performing the feed-forward mechanism [12].”
What the sources say
- Not checked yetcites [12] Prevedel, R. et al. High-speed linear optics quantum computing using active feed-forward. Nature 445 , 65-69 (2007). source
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Furthermore this optimisation is scalable beyond our four-qubit experimental setting and creates an interesting challenge on the design level to construct a computation such that the sensitive measurements remain hidden.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Using the tomographic measurements performed on these input states we determine χ of such states to be 0 . 169 ± 0 . 074, far below the three bits necessary to uniquely identify the client's choice of φ 2 and φ 3 , proving that within the assumptions of our model these experimental implementations of the protocol maintains close to perfect blindness.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- The authors state this as an assumption: The initial state is chosen uniformly at random.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Two-qubit gates are required for universal quantum computation; by choosing the order of measurements in a suitable way, the blind cluster | Φ ˆ θ 〉 implements blind two-qubit gates (Figure 2C-F).”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Blindness of qubit 3 guarantees that the quantum server will not recognize the implementation of a constant oracle from the Grover algorithm or general circuits implementing R z ( ξ ) H ⊗ I , and a balanced oracle from ( I ⊗ H )CPhase(”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
In the paper
“the Deutsch-Jozsa algorithm takes advantage of quantum superposition and interference to determine whether f is constant or balanced with only one query.”
What the sources say
- Not checked yetcites [2] Deutsch, D. & Jozsa, R. Rapid solutions of problems by quantum computation. Proc. Roy. Soc. London, Ser. A 439 , 553-558 (1992). source
Tests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“One of the most prominent examples where quantum mechanics demonstrates its superiority in computational speedup is Grover's search algorithm [3, 45], which provides a quadratic speedup to the following problem: Given a function f : { 0 , 1 } n →{ 0 , 1 } , find an x such that f ( x ) = 1.”
What the sources say
- Not checked yetcites [3] Grover, L. K. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing , 212-219 (1996).
- Not checked yetcites [45] Boyer, M., Brassard, G., Høyer, P. & Tapp, A. Tight bounds on quantum searching. Fortschritte der Physik 46 , 493-505 (1998).
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“While the best possible classical algorithm to solve this problem uses at least 2 n -1 +1 queries in the worst case, the Deutsch-Jozsa algorithm takes advantage of quantum superposition and interference to determine whether f is constant or balanced with only one query.”
What the sources say
- Not checked yetcites [2] Deutsch, D. & Jozsa, R. Rapid solutions of problems by quantum computation. Proc. Roy. Soc. London, Ser. A 439 , 553-558 (1992). source
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Self-testing is a verification process for the operations of a collection of untrusted quantum devices [47, 48]; a key application of the blind computing protocol is also towards such verification of quantum devices [29, 30].”
What the sources say
- Not checked yetcites [47] Magniez, F., Mayers, D., Mosca, M. & Ollivier, H. Selftesting of quantum circuits. Automata, Languages and Programming 72-83 (2006). source
- Not checked yetcites [48] McKague, M. & Mosca, M. Generalized self-testing and the security of the 6-state protocol. Theory of Quantum Computation, Communication, and Cryptography 113130 (2011).
- Not checked yetcites [29] Broadbent, A., Fitzsimons, J. & Kashefi, E. Universal blind quantum computation. In Proceedings of the 50th Annual Symposium on Foundations of Computer Science , 517-526 (2009). source
- Not checked yetcites [30] Aharonov, D., Ben-Or, M. & Eban, E. Interactive proofs for quantum computations. In Proceeding of Innovations in Computer Science 2010 , 453-469 (2010).
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In such a model, the amount of information leaked is bounded by the Holevo information of the quantum state, ρ received by the server, χ = -Tr( ρ log 2 ρ ) + ∑ θ 1 8 Tr( ρ θ log 2 ρ θ ), where ρ θ = 1 2 ( ρ ′ θ + ρ ′ θ + π ) and ρ ′ θ is the state produced in the experimental apparatus for the client's choice of θ .”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
- The authors state this as an assumption: The only information obtained by the server is the initial quantum state supplied by the client, as well as the classical set of angles δi received during the protocol.
- The authors state this as an assumption: The state produced by the experimental setup for a given choice of the ideal input state is fixed.
- The authors state this as an assumption: The client's choices can be considered uniformly random.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The two-pair emissions also lead to fourfold coincidences, namely to a -e iθ 3 | H 〉 1 | H 〉 2 | V 〉 3 | V 〉 4 state and a e iθ 2 | V 〉 1 | V 〉 2 | H 〉 3 | H 〉 4 state for a double-pair emission in the forward and in the backward direction, respectively.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Such four-photon emissions can experimentally be obtained either by an emission of two entangled pairs, one in the forward and one in the backward mode, or by double-pair emissions into the forward or the backward mode.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“In our experiment, the blind angles were chosen by the human client and the measurement settings were selected from a prepared list.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Due to blindness, however, the quantum server has no information about which initial states the client has prepared.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Considering the photon rates in our experiment, the realization of full randomization for each measurement is a major challenge, but seems within reach by advancing current technologies.”
Not yet classified.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our experiment is the first step towards unconditionally secure quantum computing in a client-server environment, where the client's entire computation remains hidden - a functionality not known to be achievable in the classical world.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“we stress that our results are applicable to any physical implementation of qubits”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Emitted photons that do not contribute to the generation of the cluster state can in principle reveal information about the blind phases.”
Strength:plain· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Furthermore, post-selection and photon losses decrease the efficiency of the protocol.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our demonstration is the first step towards an efficient verification scheme for quantum technology and acts as experimental benchmark for future fault-tolerant protocols using more qubits”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The only quantum requirement for the clients would be to communicate with the nodes via quantum links enabling the transfer of arbitrary qubits.”
Load-bearingStrength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Now, these blind measurements may be followed by non-blind ones. This will not affect the blindness (no information about φ 2 and φ 3 will be leaked to the server) as long as the structure of the algorithm permits the non-blind angles to be”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The authors state this as an assumption.
The initial state is chosen uniformly at random.
“The above value of χ assumes initial state is chosen uniformly at random.”
The authors state this as an assumption.
The errors in quantities extracted from density matrices are Poissonian.
“Uncertainties in quantities extracted from these density matrices are calculated using a Monte Carlo routine and assumed Poissonian errors.”
The paper relies on this without support.
No classical algorithm can succeed in the Grover search scenario with probability higher than 0.5.
“Note that no classical algorithm can succeed in this scenario with probability higher than 0 . 5.”
The authors state this as an assumption.
The only information obtained by the server is the initial quantum state supplied by the client, as well as the classical set of angles δi received during the protocol.
“we assume that the only information obtained by the server is the initial quantum state supplied by the client, as well as the classical set of angles δ i received during the protocol.”
The authors state this as an assumption.
The state produced by the experimental setup for a given choice of the ideal input state is fixed.
“We also assume that the state produced by the experimental setup for a given choice of the ideal input state is fixed”
The authors state this as an assumption.
The client's choices can be considered uniformly random.
“and that the client's choices can be considered uniformly random.”
The authors state this as an assumption.
In the calculations, Poissonian errors are always assumed.
“In our calculations, we always assume Poissonian errors.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“A modular design could be of particular advantage for all-optical quantum networks 7 and delegated quantum computations.28”
From Integrated-optics heralded controlled-NOT gate for polarization-encoded qubits (2018) · cites this paper as [28]
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
New High-Intensity Source of Polarization-Entangled Photon Pairs
Kwiat, P. G., Mattle, K., Weinfurter, H., Zeilinger, A., Sergienko, A. V., & Shih, Y. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4337 · Cited by 3,102
Self-citationRapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
Quantum-state engineering with Josephson-junction devices
Makhlin, Y., Schön, G., & Shnirman, A. (2001) · Reviews of Modern Physics · doi:10.1103/revmodphys.73.357 · Cited by 2,510
Flagged first, then by citations
1 of the 58 references couldn’t be matched to a known paper.
Research works printed but not linked: 4
- L. K. Grover in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing G. L. Miller Ed. [Association for Computing Machinery (ACM) New York 1996] pp. 212–219.
- Childs A., Quantum Inf. Comput. 5, 456 (2005).
- D. Aharonov M. Ben-Or E. Eban in Proceeding of Innovations in Computer Science (Tsinghua Univ. Press Beijing 2010) p. 453.
- R. Rivest L. Adleman M. Dertouzos in Foundations of Secure Computation R. DeMillo D. Dobkin A. Jones R. Lipton Eds. (Academic Press New York 1978) pp. 169–180.
Cited by
Sorted by citations
Items 301–400 of 464
Shibata, T., Yamamoto, S., Nakazawa, S., Lapasar, E. H., Sugisaki, K., Maruyama, K., Toyota, K., Shiomi, D., Sato, K., & Takui, T. (2021) · Applied Magnetic Resonance · doi:10.1007/s00723-021-01392-5 · Cited by 5
Multiplexed pseudo-deterministic photon source with asymmetric switching elements
Brandhofer, S., Myers, C. R., Devitt, S. J., & Polian, I. (2024) · Research Directions Quantum Technologies · doi:10.1017/qut.2024.4 · Cited by 5
Experimental quantum memristorPreprint
Spagnolo, M., Morris, J., Piacentini, S., Antesberger, M., Massa, F., Ceccarelli, F., Crespi, A., Osellame, R., & Walther, P. J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.04867 · Cited by 5
Self-citationOptomagnonic continuous-variable quantum teleportation enhanced by non-Gaussian distillation
Lu, Z.-X., Zuo, X., Fan, Z., & Li, J. (2025) · Physical Review Research · doi:10.1103/7215-zhbv · Cited by 4
Architecture for a quantum repeater based on Rydberg-atom quantum processors
Zhang, Y., Jie, Q., Li, M., Wu, S.-H., Wang, Z.-B., Zou, X., Zhang, P., Li, G., Zhang, T., Guo, G.-C., et al. (2025) · Physical Review Applied · doi:10.1103/8rss-rqr2 · Cited by 4
Privacy Preserving Computation by Fragmenting Individual Bits and Distributing Gates
Will, M. A., Ko, R. K. L., & Witten, I. H. (2016) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom.2016.0154 · Cited by 4
Fault-tolerant quantum error correction code preparation in UBQC
Zhao, Q., Li, Q., Mao, H., Wen, X., Qi, H., & Ming-hui, L. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02735-0 · Cited by 4
Towards experimental classical verification of quantum computation
Stricker, R., Carrasco, J., Ringbauer, M., Postler, L., Meth, M., Edmunds, C., Schindler, P., Blatt, R., Zoller, P., Kraus, B., et al. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad2986 · Cited by 4
Asynchronous reference frame agreement in a quantum network
Islam, T., & Wehner, S. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/3/033018 · Cited by 4
Finite-data-size study on practical universal blind quantum computation
Zhao, Q., & Li, Q. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1934-6 · Cited by 4
Secure delegated quantum computation based on Z-rotation encryption
Ma, S., Zhu, C., Nie, M., Quan, D., & Pei, C. (2022) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ac4fd2 · Cited by 4
QUANTUM STATE TRANSFER AND HADAMARD GATE FOR COHERENT STATES
PRUDÊNCIO, T. (2013) · International Journal of Quantum Information · doi:10.1142/s021974991350024x · Cited by 4
The Quantum FrontierPreprint
Fitzsimons, J. F., Rieffel, E. G., & Scarani, V. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.0785 · Cited by 5
Self-citationQuantum Networks For Open SciencePreprint
Ndousse-Fetter, T., Peters, N. A., Grice, W. P., Kumar, P., Chapuran, T., Guha, S., Hamilton, S. A., Monga, I., Newell, R., NOMEROTSKI, A., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.11658 · Cited by 4
Quantum Advantage on Proof of WorkPreprint
Bard, D. A., Kearney, J. J., & Pérez-Delgado, C. A. (2021) · SSRN Electronic Journal · doi:10.2139/ssrn.3979439 · Cited by 5
Liu, P.-X., Lin, Y.-P., Zhou, Z., Li, C.-F., & Guo, G. (2026) · Physical Review A · doi:10.1103/3cxd-t3g5 · Cited by 3
Expected number of quantum channels in quantum networks
Chen, X., Wang, H., Ji, D.-T., Mu, L.-Z., & Fan, H. (2015) · Scientific Reports · doi:10.1038/srep12128 · Cited by 3
Verifiable Multi‐Party Universal Blind Quantum Computing in Distributed Networks
Ruiting, S., Xiubo, C., Xu, G., Dou, Z., Li, Z., Lihua, M., & Yixian, Y. (2021) · Chinese Journal of Electronics · doi:10.1049/cje.2021.05.013 · Cited by 3
Blind quantum factorization of 21
Das, A., & Sanders, B. C. (2022) · Physical Review A · doi:10.1103/physreva.106.012421 · Cited by 3
Morimae, T. (2013) · Nature Physics · doi:10.1038/nphys2765 · Cited by 3
Quantum Cloud Computing from a User Perspective
Neumann, N. M. P., van der Schoot, W., & Sijpesteijn, T. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-40852-6_13 · Cited by 3
Quantum neural network with privacy protection of input data and training parameters
Fang, C., & Chang, Y. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad2146 · Cited by 3
Implementation of controlled unitary gates and its application in a remote-controlled quantum gate
Kim, B., Hong, S., Kim, Y., Oh, K., & Lim, H. (2024) · Optics Express · doi:10.1364/oe.540199 · Cited by 3
Zhu, P., Wang, Y., Du, Y., Yu, M., Zhang, K., Wang, K., & Xu, P. (2025) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-025-2628-2 · Cited by 3
Blind quantum computation with hybrid model
Zeng, X., Tan, X., Xu, Q., & Huang, R. (2020) · International Journal of Modern Physics B · doi:10.1142/s021797922050277x · Cited by 3
A Study on Quantum Cryptography Based Security Management in Cloud
Raina, P., & Kaushal, S. (2015) · International Conference on Computer and Communication Technology · doi:10.1145/2818567.2818672 · Cited by 3
Faithful qubit transmission in a quantum communication network with heterogeneous channels
Chen, N., Zhang, L. X., & Pei, C. X. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1843-8 · Cited by 3
Two-Photon Interference Constructed by Two Hong–Ou–Mandel Effects in One Mach-Zehnder Interferometer
Liu, R., Kong, L., Wang, Z.-X., Si, Y., Qi, W.-R., Huang, S., Tu, C., Li, Y., & Wang, H. (2018) · Chinese Physics Letters · doi:10.1088/0256-307x/35/9/090303 · Cited by 3
Blinding quantum computation using alternative sources
Huang, C., Huang, T., Lin, Q., & Wei, K. (2021) · Physical Review A · doi:10.1103/physreva.104.012614 · Cited by 3
Greenberger-Horne-Zeilinger states-based blind quantum computation with entanglement concentration
Zhang, X., Weng, J., Lu, W., Li, X., Luo, W., & Tan, X. (2017) · Scientific Reports · doi:10.1038/s41598-017-06777-w · Cited by 3
An XAS Study of the Cation Binding Sites in the Purple Membrane of Halobacterium Salinarum
Sepulcre, F., Proietti, M. G., Benfatto, M., Longa, S. D., Garca, J., & Padrs, E. (2005) · Physica Scripta · doi:10.1238/physica.topical.115a00855 · Cited by 3
Nonstochastic Particle Acceleration in Collisionless Shock Waves
Ohsawa, Y. (2004) · Physica Scripta · doi:10.1238/physica.topical.107a00032 · Cited by 3
On the Security of Two Blind Quantum ComputationsPreprint
Hung, S.-M., & Hwang, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1508.07478 · Cited by 3
Blind quantum computing can always be made verifiablePreprint
Morimae, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.06624 · Cited by 3
Modelling Markovian light-matter interactions for quantum optical devices in the solid statePreprint
Wein, S. C. (2021) · arXiv (Cornell University) · doi:10.11575/prism/38687 · Cited by 8
Emerging applications of measurement-based quantum computing
Qin, Z., Li, X., Zhou, Y., Zhang, S., Li, R., Du, C., & Xiao, Z. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04596-3 · Cited by 3
Parallel remote state preparation for fully device-independent verifiable blind quantum computation
Adamson, S. A. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013069 · Cited by 2
Experimental secure entanglement-free quantum remote sensing over 50 km of optical fiber
He, W., Huang, C., Guan, R., Chen, Y., Zhang, Z., & Wei, K. (2025) · Physical Review A · doi:10.1103/physreva.111.062607 · Cited by 2
Verifiable blind quantum computation for two types of clients via iterated gate teleportation
Wang, Y., Dai, Q., & Li, Q. (2025) · Physical Review A · doi:10.1103/67zx-lk2j · Cited by 2
Maggio, L., Triggiani, D., Paolo Facchi, A., & Tamma, V. (2025) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-06903-y · Cited by 2
Compilation Strategies for Quantum Network Programs Using Qoala
Oslovich, S., van der Vecht, B., & Wehner, S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00084 · Cited by 2
Ji, J.-W., Sunami, S., Kikura, S., Goban, A., & Simon, C. (2025) · Physical Review Applied · doi:10.1103/vcrh-hl73 · Cited by 7
AI-Driven Reverse Engineering of QML Models
Ghosh, A., & Ghosh, S. (2025) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed65160.2025.11014316 · Cited by 2
Verifiable Quantum Cloud Computation Scheme Based on Blind Computation
Li, J., Zhao, Y., Yang, Y., & Lin, Y. (2020) · IEEE Access · doi:10.1109/access.2020.2982090 · Cited by 3
Lafler, R., & Lanning, R. N. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.064014 · Cited by 2
Two‐Server Oblivious Transfer for Quantum Messages
Hayashi, M., & Song, S. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300184 · Cited by 2
Heralded optical entanglement distribution via lossy quantum channels: a comparative study
Zo, W., Chin, S., & Kim, Y. (2025) · Optics Express · doi:10.1364/oe.542222 · Cited by 2
Experimental quantum state certification by actively sampling photonic entangled states
Antesberger, M., Schmid, M. M. E., Cao, H., Dakić, B., Rozema, L. A., & Walther, P. J. (2026) · Science Advances · doi:10.1126/sciadv.aea4144 · Cited by 2
Self-citationIntroduction and Conceptual Background
Gatti, F., & Lasorne, B. (2013) · Physical chemistry in action · doi:10.1007/978-3-642-45290-1_1 · Cited by 2
Quantum Memory Multiple Access
Sharma, A., & Nen, M. J. (2021) · International Conference on Computational Intelligence and Communication Technologies (CCICT) · doi:10.1109/ccict53244.2021.00027 · Cited by 2
Double-server blind quantum computation based on the GHZ state
Zhou, Y., Wang, Y., Jian, L., Chen, G., & Liu, S. (2022) · Journal of Applied Physics · doi:10.1063/5.0089669 · Cited by 2
Confidential Quantum Computing
Hrdá, B., & Wessel, S. (2023) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1145/3600160.3604982 · Cited by 2
Quantum-secured covert sensing for the Doppler effect
Hao, S., & Zhang, Z. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043206 · Cited by 2
Dambrot, S. M. (2016) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc.2016.7844860 · Cited by 3
Altowyan, A. S., Aldaghfag, S. A., Berrada, K., & Abdel‐Khalek, S. (2020) · Journal of Russian Laser Research · doi:10.1007/s10946-020-09845-1 · Cited by 2
Quantum Clouds: A future perspectivePreprint
Bhambri, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.6502 · Cited by 2
Extending the delegated verifiable blind quantum computation functionalityPreprint
Kashefi, E., & Wallden, P. (2016) · arXiv (Cornell University) · Cited by 2
Self-citationVersatile cluster entangled light
Briegel, H. J. (2016) · Science · doi:10.1126/science.aai8675 · Cited by 2
Serpa, N. (2017) · IGI Global eBooks · doi:10.4018/978-1-5225-2255-3.ch091 · Cited by 2
A quantum homomorphic encryption scheme for polynomial-sized circuitsPreprint
Yu, L. Z. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.01166 · Cited by 2
Raffah, B. M., & Berrada, K. (2019) · Results in Physics · doi:10.1016/j.rinp.2019.02.070 · Cited by 1
Blind quantum computation with a client performing different single-qubit gates
Wu, G.-Y., 杨, Z. 振. Y., Yan, Y.-Z., Luo, Y.-M., Bai, M.-Q., & 莫, Z.-W. 智. M. (2023) · Chinese Physics B · doi:10.1088/1674-1056/ace15a · Cited by 1
Saha, P., Choudhury, B. S., METWALLY, N., & Mandal, M. K. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.131041 · Cited by 1
Wang, P., Wei, Z., Yang, Z., Li, C.-Y., Yuan, R., & Ren, B. (2025) · Physical Review A · doi:10.1103/9z98-wcrk · Cited by 1
Verifiable cloud-based variational quantum algorithms
Yang, J., Wang, B.-H., Quan, J., & Li, Q. (2025) · Optics Communications · doi:10.1016/j.optcom.2025.131474 · Cited by 3
Universal blind quantum computing assisted by quantum teleportation
Zhang, X. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04798-3 · Cited by 1
Maggio, L., & Tamma, V. (2026) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-07257-1 · Cited by 1
Robustness of continuous variable quantum key distribution under strong polarization drift
Almeida, M., Pinto, A. N., & Silva, N. A. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00417-3 · Cited by 1
RELiQ: Scalable Entanglement Routing via Reinforcement Learning in Quantum Networks
Meuser, T., Weil, J., Lahiri, A., & Paraschiv, M. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3640083 · Cited by 1
Sun, S., Bhatti, D., Gao, S., Elkouss, D., & Takahashi, H. (2026) · Physical Review A · doi:10.1103/y9tp-zg34 · Cited by 3
Quantum Full-Duplex Anonymous Communication in Adversarial Quantum Networks
Khan, A., Rizvi, S. M. A., Duong, T. Q., Hong, E., & Shin, H. (2026) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2026.3685680 · Cited by 1
Quantum computing on encrypted data with arbitrary rotation gates
Joshi, M., Mishra, M. K., & Subbiah, K. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae6e9c · Cited by 1
Liebisch, T. C., Kaufmann, P., Schnatz, H., Naegele-Jackson, S., Kronjäger, J., Blaum, K., Kück, S., Meschede, D., Schiller, S., Agazzi, L., et al. (2026) · The European Physical Journal Special Topics · doi:10.1140/epjs/s11734-026-02451-3 · Cited by 1
Self-citationPrivacy in Continuous-Variable Distributed Quantum Sensing
de Oliveira, A., Andersen, A. L., Larsen, B. L., Moore, S. W., Markham, D., Takeoka, M., Brask, J. B., & Andersen, U. L. (2026) · PRX Quantum · doi:10.1103/1zsz-clqx · Cited by 6
Rübeling, P., Johanning, R., Heine, J., Marchukov, O. V., & Kues, M. (2026) · Light Science & Applications · doi:10.1038/s41377-026-02465-5 · Cited by 3
Quantum quantifiers of Raman photon pairs with relativistic motion
Abdel‐Khalek, S., Berrada, K., & Eleuch, H. (2018) · Optical and Quantum Electronics · doi:10.1007/s11082-018-1359-6 · Cited by 1
Delegated Preparation of Quantum Error Correction Code for Blind Quantum Computation
Zhao, Q., & Li, Q. (2019) · Smart innovation, systems and technologies · doi:10.1007/978-981-13-9710-3_15 · Cited by 1
Serpa, N. (2018) · Advances in computer and electrical engineering book series · doi:10.4018/978-1-5225-7598-6.ch011 · Cited by 1
Encrypted quantum state tomography with phase estimation for quantum Internet
Gülbahar, B. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04034-w · Cited by 1
Quantum Money : Opportunities, Challenges and Open Issues
Mishra, S., Ojha, A., Aggarwal, A., & Mehra, P. S. (2023) · International Conference on Communication and Electronics Systems (ICCES) · doi:10.1109/icces57224.2023.10192676 · Cited by 1
Verifiable distributed blind quantum computation
Wenbiao, X., Junyu, Q., Xingjia, X., Jiang, Z., & Qin, L. (2024) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2024-0133 · Cited by 1
Blind quantum computation with fewer quantum and delegated cost of client
Yan, Y.-Z., Yang, Z., Wu, G.-Y., Luo, Y.-M., Bai, M.-Q., & Mo, Z. (2025) · International Journal of Quantum Information · doi:10.1142/s0219749925300013 · Cited by 1
Resmi, M. R., John, J., & Yalla, R. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae0c5e · Cited by 1
Experimental nonlocality-based network diagnostics of multipartite entangled states
Ciampini, M. A., Vigliar, C., Cimini, V., Paesani, S., Sciarrino, F., Crespi, A., Corrielli, G., Osellame, R., Mataloni, P., Paternostro, M., et al. (2017) · Scientific Reports · doi:10.1038/s41598-017-17457-0 · Cited by 2
Molecular Spins in Biological Systems
Matsuoka, H., & Schiemann, O. (2016) · Biological magnetic resonance · doi:10.1007/978-1-4939-3658-8_3 · Cited by 1
Quantum Security Computation on Shared Secrets
Bai, H.-Y., Li, Z.-H., & Hao, N. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3905-1 · Cited by 1
Berrada, K. (2018) · Journal of Russian Laser Research · doi:10.1007/s10946-018-9749-6 · Cited by 1
Emission Spectrum and Fidelity of an Atomic System Coupled to Fields with Level Energy Differences
Altowyan, A. S., Aldaghfag, S. A., Berrada, K., & Abdel‐Khalek, S. (2020) · Journal of Russian Laser Research · doi:10.1007/s10946-020-09882-w · Cited by 1
Babin, C., Stöhr, R., Morioka, N., Linkewitz, T., Steidl, T., Wörnle, R., Liu, D., Vorobyov, V., Denisenko, A., Hentschel, M., et al. (2021) · Frontiers in Optics · doi:10.1364/fio.2021.fm6d.2 · Cited by 1
Saggio, V., & Walther, P. J. (2022) · Physik in unserer Zeit · doi:10.1002/piuz.202101632 · Cited by 1
Self-citationBlind Quantum Computation Using Single Qubit Gates
Xing, Z., Machado, P., & Lam, C. (2022) · IEEE International Conference on Information, Communication and Networks (ICICN) · doi:10.1109/icicn56848.2022.10006445 · Cited by 1
Correlações quânticas e o modelo DQC1
Santos, M. J. Z. D. (2015) · doi:10.14393/ufu.te.2015.101 · Cited by 1
Three-qubit exact Grover within the blind oracular quantum computation schemePreprint
Gustiani, C., & Divincenzo, D. P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.05534 · Cited by 1
Razavi, M. (2023) · Wiley eBooks · doi:10.1002/9783527837427.ch24 · Cited by 3
Entanglement Activation in Multiphoton Distillation NetworksPreprint
Chen, Y.-A., Zhang, R., Fei, Y.-Y., Liu, Z., Zhang, X., Yin, X.-F., Mao, Y., Li, L., Liu, N.-L., Ma, X., et al. (2024) · Research Square · doi:10.21203/rs.3.rs-3828402/v1 · Cited by 1
Exclusive quantum channels in quantum networksPreprint
Chen, X., Wang, H., Mu, L.-Z., & Fan, H. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.3776
Quantum computation mediated by an ancilla of arbitrary dimensionPreprint
Proctor, T. J., Dooley, S., & Kendon, V. M. (2014) · arXiv (Cornell University)
A blind quantum computer makes its laboratory debut
Miller, J. L. (2012) · Physics Today · doi:10.1063/pt.3.1464
ENTANGLEMENT AND NON-TRIVIAL TOPOLOGIES
Prudêncio, T., & Cirilo-Lombardo, D. J. (2013) · International Journal of Geometric Methods in Modern Physics · doi:10.1142/s0219887813500400
Verification of Quantum Computation
Kashefi, E. (2014) · Research in Optical Sciences · doi:10.1364/qim.2014.qth2a.2
Self-citation
Metadata
- Authors
- Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P.
- Affiliations
- University of Vienna (AT)
- University of Edinburgh (GB)
- University of Waterloo (CA)
- University College Dublin (IE)
- Corresponding author
- Barz, Stefanie
- Venue
- Science
- Published
- 2012-01-20
- Volume
- 335
- Issue
- 6066
- Pages
- 303-308
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2008420411
- Semantic Scholar
- da7ab9e7a904fcb13d5bd91017ae03b88dfa67b6
- Cited by
- 475
- References
- 58
- Citations by year
- 2026: 28 · 2025: 47 · 2024: 36 · 2023: 41 · 2022: 22 · 2021: 52 · 2020: 23 · 2019: 30 · 2018: 31 · 2017: 25 · 2016: 47 · 2015: 26 · 2014: 25 · 2013: 22 · 2012: 17
- FWCI
- 28.13
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- National University of Singapore (submittedVersion)
- arXiv (Cornell University)
- Bulletin of the American Physical Society
- Funders
- Air Force Office of Scientific Research (FA8655-11-1-3004)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Keywords
- blind quantum computing, measurement-based quantum computation, cloud quantum computing, quantum privacy, delegated quantum computation, photonic qubits, Deutsch algorithm, Grover's algorithm
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-09, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-09 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
