De-quantisation of the quantum Fourier transform

DOI10.1016/j.amc.2011.06.057zbMath1448.68241arXiv1006.3989OpenAlexW2048949258MaRDI QIDQ2249000

Alastair A. Abbott

Publication date: 27 June 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.3989

zbMATH Keywords

quantum computingquantum Fourier transformclassical simulationde-quantisation

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

The Road to Quantum Computational Supremacy

Cites Work

• Unnamed Item
• The Deutsch-Jozsa problem: de-quantisation and entanglement
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum algorithms and the Fourier transform
• Quantum algorithms revisited
• On the role of entanglement in quantum-computational speed-up
• DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM
• SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS

This page was built for publication: De-quantisation of the quantum Fourier transform