CoChat
Sign Up
Cited by 157

The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.

Quantum computing on encrypted data

Fisher, K. A. G., Broadbent, A., Shalm, L. K., Yan, Z., Lavoie, J., Prevedel, R., Jennewein, T., Resch, K. J.·2014·Nature Communications
DOI 10.1038/ncomms4074
Open this paper in CoChat — free account

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/ncomms4074

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • When two particles are sent into a multiport, the transmission can be described as a complex bi-partite quantum walk.

    “When two particles for example are sent into a multiport, e.g.multimode waveguide [153,154], multimode fiber [155] or integrated waveguide structures [156], the transmission can be described as a complex bi-partite quantum walk”

    From Two-photon interference: the Hong–Ou–Mandel effect (2021) · cites this paper as [156]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 20

  1. Deutsch, D. & Jozsa, R. Rapid solution of problems by quantum computation. Proc. R. Soc. A 439, 553–558 (1992). · DOI · Paper page
  2. Gentry, C. Fully homomorphic encryption using ideal lattices. InProceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC) 169–178ACM Press (2009). · DOI · Paper page
  3. Gentry, C., Halevi, S. & Smart, N. Fully homomorphic encryption with polylog overhead. InProceedings of the 31st Annual Conference Theory and Applications of Cryptographic Techniques (EUROCRYPT) 465–482Springer-Verlag Berlin (2012). · DOI
  4. Broadbent, A., Fitzsimons, J. & Kashefi, E. Universal blind quantum computation. InProceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 517–526IEEE Press (2009). · DOI · Paper page
  5. Childs, A. Secure assisted quantum computation. Quantum Inform. Comput. 5, 456–466 (2005). · DOI
  6. Aharonov, D., Ben-Or, M. & Eban, E. Interactive proofs for quantum computations. Proc. Innov. Comp. Sci. 2010, 453–469 (2010).
  7. Dupuis, F., Nielsen, J. B. & Salvail, L. Actively secure two-party evaluation of any quantum operation. InAdvances in Cryptology—CRYPTO 2012. 794–811 (Lecture Notes in Computer Sciencevol. 7417, Springer (2012). · DOI
  8. Broadbent, A., Gutoski, G. & Stebila, D. Quantum one-time programs. InAdvances in Cryptology – CRYPTO 2013. 344–360 (Lecture Notes in Computer Sciencevol. 8043, Springer (2013). · DOI
  9. Ambainis, A., Mosca, M., Tapp, A. & Wolf, R. D. Private quantum channels. InProceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS) 547–553IEEE Press (2000). · DOI
  10. Nielsen, M. & Chuang, I. Quantum Computation and Quantum Information Cambridge Univ. Press (2000).
  11. Gottesman, D. The Heisenberg representation of quantum computers. InGroup 22: Proceedings of the 22nd International Colloquium on Group Theoretical Methods in Physics 32–43International Press (1998).
  12. Zhou, X., Leung, D. & Chuang, I. Methodology for quantum logic gate construction. Phys. Rev. A 62, 052316 (2000). · DOI · Paper page
  13. Childs, A., Leung, D. & Nielsen, M. Unified derivations of measurement-based schemes for quantum computation. Phys. Rev. A 71, 032318 (2005). · DOI
  14. Shor, P. & Preskill, J. Simple proof of security of the BB84 quantum key distribution protocol. Phys. Rev. Lett. 85, 441–444 (2000). · DOI · Paper page
  15. Kiesel, N., Schmid, C., Weber, U., Ursin, R. & Weinfurter, H. Linear optics controlled-phase gate made simple. Phys. Rev. Lett. 95, 210505 (2005). · DOI · Paper page
  16. Okamoto, R., Hofmann, H., Takeuchi, S. & Sasaki, K. Demonstration of an optical quantum controlled-not gate without path interference. Phys. Rev. Lett. 95, 210506 (2005). · DOI · Paper page
  17. Pittman, T., Jacobs, B. & Franson, J. Demonstration of feed-forward control for linear optics quantum computation. Phys. Rev. A 66, 052305 (2002). · DOI
  18. Ma, X.-S. et al. Quantum teleportation over 143 kilometres using active feed-forward. Nature 489, 269–273 (2012). · DOI · Paper page
  19. Poyatos, J., Cirac, J. & Zoller, P. Complete characterization of a quantum process: The two-bit quantum gate. Phys. Rev. Lett. 78, 390–393 (1997). · DOI · Paper page
  20. Chow, J. et al. Randomized benchmarking and process tomography for gate errors in a solid-state qubit. Phys. Rev. Lett. 102, 090502 (2009). · DOI

Cited by

Sorted by citations

Metadata

Authors
Fisher, K. A. G., Broadbent, A., Shalm, L. K., Yan, Z., Lavoie, J., Prevedel, R., Jennewein, T., & Resch, K. J.
Venue
Nature Communications
Publisher
Springer Science and Business Media LLC
Published
2014-01-21
Volume
5
Issue
1
ISSN
2041-1723
DOI
10.1038/ncomms4074
Cited by
157
References
11
Language
en
Licence

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.

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