Fetching the paper…
Reading the bibliography…
With today's quantum processors venturing into regimes beyond the capabilities of classical devices [1-3], we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers [4,5].
1904
Earlier work this paper cites.
1904
Earlier work this paper cites.
R. P. Feynman, Quantum Mechanical Computers , Foundations of Physics 16
1986
Earlier work this paper cites.
R. P. Feynman, Quantum Mechanical Computers , Foundations of Physics 16
1986
Earlier work this paper cites.
S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems , SIAM J. Comput. 18
1989
Earlier work this paper cites.
S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems , SIAM J. Comput. 18
1989
Earlier work this paper cites.
Y. Shi, Both Toffoli and Controlled-NOT need little help to do universal quantum computation , (2002), arXiv:quant-ph/0205115 [quant-ph]
2002
Earlier work this paper cites.
Y. Shi, Both Toffoli and Controlled-NOT need little help to do universal quantum computation , (2002), arXiv:quant-ph/0205115 [quant-ph]
2002
Earlier work this paper cites.
J. Emerson, R. Alicki, and K. Życzkowski, Scalable noise estimation with random unitary operators , J. Opt. B 7
2005
Earlier work this paper cites.
O. Regev, On Lattices, Learning with Errors, Random Linear Codes, and Cryptography , in Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing , STOC ’05 (2005) pp. 84–93
2005
Earlier work this paper cites.
J. Kempe, A. Kitaev, and O. Regev, The complexity of the local Hamiltonian problem , SIAM J. Comput. 35(5)
2005
Earlier work this paper cites.
J. Emerson, R. Alicki, and K. Życzkowski, Scalable noise estimation with random unitary operators , J. Opt. B 7
2005
Earlier work this paper cites.
O. Regev, On Lattices, Learning with Errors, Random Linear Codes, and Cryptography , in Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing , STOC ’05 (2005) pp. 84–93
2005
Earlier work this paper cites.
J. Kempe, A. Kitaev, and O. Regev, The complexity of the local Hamiltonian problem , SIAM J. Comput. 35(5)
2005
Earlier work this paper cites.
W. Press, S. Teukolsky, W. Vetterling, and B. Flannery, Numerical recipes 3rd edition: the art of scientific computing, Section 22.3 , 3rd ed. (Cambridge University Press, Cambridge, UK, 2007)
2007
Earlier work this paper cites.
W. Press, S. Teukolsky, W. Vetterling, and B. Flannery, Numerical recipes 3rd edition: the art of scientific computing, Section 22.3 , 3rd ed. (Cambridge University Press, Cambridge, UK, 2007)
2007
Earlier work this paper cites.
J. Biamonte and P. Love, Realizable Hamiltonians for universal adiabatic quantum computers , Phys. Rev. A 78
2008
Earlier work this paper cites.
J. Biamonte and P. Love, Realizable Hamiltonians for universal adiabatic quantum computers , Phys. Rev. A 78
2008
Earlier work this paper cites.
S. Barz, E. Kashefi, A. Broadbent, J. Fitzsimons, A. Zeilinger, and P. Walther, Demonstration of Blind Quantum Computing , Science (New York, N.Y.) 335
2012
Earlier work this paper cites.
S. Barz, E. Kashefi, A. Broadbent, J. Fitzsimons, A. Zeilinger, and P. Walther, Demonstration of Blind Quantum Computing , Science (New York, N.Y.) 335
2012
Earlier work this paper cites.
P. Schindler, D. Nigg, T. Monz, J. T. Barreiro, E. Martinez, S. X. Wang, S. Quint, M. F. Brandl, V. Nebendahl, C. F. Roos, M. Chwalla, M. Hennrich, and R. Blatt, A quantum information processor with trapped ions , New J. Phys. 15
2013
Earlier work this paper cites.
P. Schindler, D. Nigg, T. Monz, J. T. Barreiro, E. Martinez, S. X. Wang, S. Quint, M. F. Brandl, V. Nebendahl, C. F. Roos, M. Chwalla, M. Hennrich, and R. Blatt, A quantum information processor with trapped ions , New J. Phys. 15
2013
Cited alongside, same era.
M. Hayashi and T. Morimae, Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing , Phys. Rev. Lett. 115
2015
Cited alongside, same era.
A. Gheorghiu, E. Kashefi, and P. Wallden, Robustness and device independence of verifiable blind quantum computing , New J. Phys. 17
2015
Cited alongside, same era.
M. Hayashi and T. Morimae, Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing , Phys. Rev. Lett. 115
2015
Cited alongside, same era.
A. Gheorghiu, E. Kashefi, and P. Wallden, Robustness and device independence of verifiable blind quantum computing , New J. Phys. 17
Z. Brakerski, V. Koppula, U. Vazirani, and T. Vidick, Simpler Proofs of Quantumness , in 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 158, edited by S. T. Flammia (2020) pp. 8:1–8:14
2020
Later among the works it cites.
A. Elben, B. Vermersch, R. van Bijnen, C. Kokail, T. Brydges, C. Maier, M. K. Joshi, R. Blatt, C. F. Roos, and P. Zoller, Cross-Platform Verification of Intermediate Scale Quantum Devices , Phys. Rev. Lett. 124
2020
Later among the works it cites.
H.-S. Zhong, H. Wang, Y.-H. Deng, M.-C. Chen, L.-C. Peng, Y.-H. Luo, J. Qin, D. Wu, X. Ding, Y. Hu, et al. , Quantum computational advantage using photons , Science 370
2020
Later among the works it cites.
J. Eisert, D. Hangleiter, N. Walk, I. Roth, D. Markham, R. Parekh, U. Chabaud, and E. Kashefi, Quantum certification and benchmarking , Nat. Rev. Phys. 2
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
T. Morimae, D. Nagaj, and N. Schuch, Quantum proofs can be verified using only single-qubit measurements , Phys. Rev. A 93
2016
Cited alongside, same era.
T. Morimae, D. Nagaj, and N. Schuch, Quantum proofs can be verified using only single-qubit measurements , Phys. Rev. A 93
2016
Cited alongside, same era.
J. F. Fitzsimons and E. Kashefi, Unconditionally verifiable blind quantum computation , Phys. Rev. A 96
2017
Cited alongside, same era.
J. F. Fitzsimons and E. Kashefi, Unconditionally verifiable blind quantum computation , Phys. Rev. A 96
2017
Cited alongside, same era.
U. Mahadev, Classical Verification of Quantum Computations , in IEEE 59th Annu. Symp. Found. Comput. Sci. (2018) pp. 259–267
2018
Cited alongside, same era.
J. F. Fitzsimons, M. Hajdušek, and T. Morimae, Post hoc Verification of Quantum Computation , Phys. Rev. Lett. 120
2018
Cited alongside, same era.
U. Mahadev, Classical Verification of Quantum Computations , in IEEE 59th Annu. Symp. Found. Comput. Sci. (2018) pp. 259–267
2018
Cited alongside, same era.
Z. Brakerski, V. Koppula, U. Vazirani, and T. Vidick, Simpler Proofs of Quantumness , in 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 158, edited by S. T. Flammia (2020) pp. 8:1–8:14
2020
Later among the works it cites.
A. Elben, B. Vermersch, R. van Bijnen, C. Kokail, T. Brydges, C. Maier, M. K. Joshi, R. Blatt, C. F. Roos, and P. Zoller, Cross-Platform Verification of Intermediate Scale Quantum Devices , Phys. Rev. Lett. 124
2020
Later among the works it cites.
Y. Wu, W.-S. Bao, S. Cao, F. Chen, M.-C. Chen, X. Chen, T.-H. Chung, H. Deng, Y. Du, D. Fan, et al. , Strong quantum computational advantage using a superconducting quantum processor , Physical review letters 127
2021
Later among the works it cites.
Z. Brakerski, P. Christiano, U. Mahadev, U. Vazirani, and T. Vidick, A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device , J. ACM 68
2021
Later among the works it cites.
J. Carrasco, A. Elben, C. Kokail, B. Kraus, and P. Zoller, Theoretical and Experimental Perspectives of Quantum Verification , PRX Quantum 2
2021
Later among the works it cites.
M. M. Jacak, P. Jóźwiak, J. Niemczuk, and J. E. Jacak, Quantum generators of random numbers , Scientific Reports 11
2021
Later among the works it cites.
C. Greganti, T. F. Demarie, M. Ringbauer, J. A. Jones, V. Saggio, I. A. Calafell, L. A. Rozema, A. Erhard, M. Meth, L. Postler, R. Stricker, P. Schindler, R. Blatt, T. Monz, P. Walther, and J. F. Fitzsimons, Cross-Verification of Independent Quantum Devices , Phys. Rev. X 11
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
Y. Wu, W.-S. Bao, S. Cao, F. Chen, M.-C. Chen, X. Chen, T.-H. Chung, H. Deng, Y. Du, D. Fan, et al. , Strong quantum computational advantage using a superconducting quantum processor , Physical review letters 127
2021
Later among the works it cites.
Z. Brakerski, P. Christiano, U. Mahadev, U. Vazirani, and T. Vidick, A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device , J. ACM 68
2021
Later among the works it cites.
J. Carrasco, A. Elben, C. Kokail, B. Kraus, and P. Zoller, Theoretical and Experimental Perspectives of Quantum Verification , PRX Quantum 2
2021
Later among the works it cites.
M. M. Jacak, P. Jóźwiak, J. Niemczuk, and J. E. Jacak, Quantum generators of random numbers , Scientific Reports 11
2021
Later among the works it cites.
C. Greganti, T. F. Demarie, M. Ringbauer, J. A. Jones, V. Saggio, I. A. Calafell, L. A. Rozema, A. Erhard, M. Meth, L. Postler, R. Stricker, P. Schindler, R. Blatt, T. Monz, P. Walther, and J. F. Fitzsimons, Cross-Verification of Independent Quantum Devices , Phys. Rev. X 11
2021
Later among the works it cites.
2021
Later among the works it cites.