The Deutsch-Jozsa problem: de-quantisation and entanglement
From MaRDI portal
Publication:1761700
DOI10.1007/s11047-011-9276-7zbMath1251.68114arXiv0910.1990OpenAlexW3098605797MaRDI QIDQ1761700
Publication date: 15 November 2012
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.1990
Analysis of algorithms (68W40) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (3)
Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms ⋮ The Road to Quantum Computational Supremacy ⋮ De-quantisation of the quantum Fourier transform
Cites Work
- Quantum computing without entanglement
- Quantum algorithms: entanglement–enhanced information processing
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum algorithms revisited
- Oracle Quantum Computing
- On the role of entanglement in quantum-computational speed-up
- DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM
- Quantum Computer Science
- SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS
This page was built for publication: The Deutsch-Jozsa problem: de-quantisation and entanglement
