Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
From MaRDI portal
Publication:6139225
DOI10.1007/S11128-023-04134-7OpenAlexW4388303809MaRDI QIDQ6139225FDOQ6139225
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
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
- Title not available (Why is that?)
- On the Power of Quantum Computation
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- The Deutsch-Jozsa problem: de-quantisation and entanglement
- DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM
- Breaking symmetric cryptosystems using quantum period finding
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)
