Skip to main content
Top
Published in: Quantum Information Processing 11/2023

01-11-2023

Comments on “Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms”

Authors: Carlos A. Batista, Tiago M. L. de Veras, Leon D. da Silva, Adenilton J. da Silva

Published in: Quantum Information Processing | Issue 11/2023

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

A recent paper (Quantum Info. Process 16.9, 2017) proposes a classical framework named Quantum Simulation Logic (QSL) capable of an efficient classical simulation of Deutsch–Jozsa and Simon algorithms. In this comment, we show instances of the Deutsch–Jozsa (DJ) and the Simon quantum algorithms that generate incorrect results with the QSL version, contradicting the proposal and the main results of the original paper.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. In: Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences 439(1907), 553–558 (1992) Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. In: Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences 439(1907), 553–558 (1992)
3.
go back to reference Kuwakado, H., Morii, M.: Quantum distinguisher between the 3-round feistel cipher and the random permutation. In: 2010 IEEE International Symposium on Information Theory, pp. 2682–2685 (2010). IEEE Kuwakado, H., Morii, M.: Quantum distinguisher between the 3-round feistel cipher and the random permutation. In: 2010 IEEE International Symposium on Information Theory, pp. 2682–2685 (2010). IEEE
4.
go back to reference Kuwakado, H., Morii, M.: Security on the quantum-type even-mansour cipher. In: 2012 International Symposium on Information Theory and Its Applications, pp. 312–316 (2012). IEEE Kuwakado, H., Morii, M.: Security on the quantum-type even-mansour cipher. In: 2012 International Symposium on Information Theory and Its Applications, pp. 312–316 (2012). IEEE
5.
go back to reference Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Breaking symmetric cryptosystems using quantum period finding. In: Annual International Cryptology Conference, pp. 207–237 (2016). Springer Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Breaking symmetric cryptosystems using quantum period finding. In: Annual International Cryptology Conference, pp. 207–237 (2016). Springer
6.
go back to reference Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999)ADSMathSciNetCrossRefMATH Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999)ADSMathSciNetCrossRefMATH
7.
go back to reference Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 212–219 (1996) Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 212–219 (1996)
8.
go back to reference Johansson, N., Larsson, J.-Å.: Efficient classical simulation of the Deutsch-Jozsa and Simon’s algorithms. Quant. Inf. Process. 16(9), 233 (2017)ADSMathSciNetCrossRefMATH Johansson, N., Larsson, J.-Å.: Efficient classical simulation of the Deutsch-Jozsa and Simon’s algorithms. Quant. Inf. Process. 16(9), 233 (2017)ADSMathSciNetCrossRefMATH
9.
go back to reference Calude, C.S.: De-quantizing the solution of Deutsch’s problem. Int. J. Quant. Inf. 5(03), 409–415 (2007)CrossRefMATH Calude, C.S.: De-quantizing the solution of Deutsch’s problem. Int. J. Quant. Inf. 5(03), 409–415 (2007)CrossRefMATH
Metadata
Title
Comments on “Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms”
Authors
Carlos A. Batista
Tiago M. L. de Veras
Leon D. da Silva
Adenilton J. da Silva
Publication date
01-11-2023
Publisher
Springer US
Published in
Quantum Information Processing / Issue 11/2023
Print ISSN: 1570-0755
Electronic ISSN: 1573-1332
DOI
https://doi.org/10.1007/s11128-023-04134-7

Other articles of this Issue 11/2023

Quantum Information Processing 11/2023 Go to the issue