Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms

DOI10.1007/S11128-023-04134-7MaRDI QIDQ6139225zbMATH OpenOpenAlexFDO

Authors C. A. S. Batista, Tiago M. L. de Veras, Leon D. da Silva, Adenilton J. 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

zbMATH Keywords

quantum computationDeutsch-Jozsa algorithmSimon's algorithmquantum simulation logic

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• Simulating quantum computers with probabilistic methods
• An observer-based de-quantisation of Deutsch's algorithm
• A LOGIC FOR QUANTUM COMPUTATION AND CLASSICAL SIMULATION OF QUANTUM ALGORITHMS
• Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Breaking symmetric cryptosystems using quantum period finding
• DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM
• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• On the Power of Quantum Computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Rapid solution of problems by quantum computation
• The Deutsch-Jozsa problem: de-quantisation and entanglement

This page was built for publication: Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139225)