Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
From MaRDI portal
Publication:6139225
DOI10.1007/s11128-023-04134-7OpenAlexW4388303809MaRDI QIDQ6139225
Adenilton J. da Silva, Tiago M. L. de Veras, C. A. S. Batista, Leon D. da Silva
Publication date: 16 January 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-023-04134-7
Cites Work
- Unnamed Item
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- The Deutsch-Jozsa problem: de-quantisation and entanglement
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM
This page was built for publication: Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms