Understanding the quantum computational speed-up via de-quantisation

MaRDI QIDQ5151012zbMATH OpenFDO

Authors Alastair A. Abbott, Cristian S. Calude

Publication date 16 February 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCM2010.1

Mathematics Subject Classification ID

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

Recommendations

• An observer-based de-quantisation of Deutsch's algorithm
• MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP
• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• The Deutsch-Jozsa problem: de-quantisation and entanglement
• Quantum advantage with shallow circuits

Cited in

(8)

• Quantum computers speed up classical with probability zero
• A little bit of classical magic to achieve (super-)quantum speedup
• De-quantisation of the quantum Fourier transform
• The road to quantum computational supremacy
• CONTROLLING THE QUANTUM COMPUTATIONAL SPEED
• MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP
• Fourier 1-norm and quantum speed-up
• Quantum circuit optimization via graph partitioning by quantum annealing

This page was built for publication: Understanding the quantum computational speed-up via de-quantisation

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