De-quantisation in Quantum Computation

@inproceedings{Abbott2009DequantisationIQ,
  title={De-quantisation in Quantum Computation},
  author={Alastair A. Abbott and Cristian S. Calude},
  year={2009}
}
Quantum computation has shown much promise at providing, at least in some cases, a significant advantage over classical computation. However, the nature of quantum computation is still far from being well understood. In order to develop quantum algorithms effectively, it is important to understand the true nature of the differences between classical and quantum computation. We investigate these differences more closely by looking at de-quantising quantum algorithms into classical counterparts… CONTINUE READING
1 Extracted Citations
25 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 25 references

1998(454):339–354

  • R. Cleve, A. Ekert, C. Macchiavello, A M.Mosca.Quantumalgorithmsrevisited.Proceedingsofth
  • Jan
  • 1997
Highly Influential
4 Excerpts

Quantum Computer Science

  • N. D. Mermin
  • Cambridge University Press,
  • 2007
Highly Influential
3 Excerpts

Proceedings: Mathematical

  • R. Jozsa, N. Linden. On the role of entanglement in quantumcomp speed-up
  • Physical and Engineering Sciences, 459(2036):2011…
  • 2003
Highly Influential
3 Excerpts

76(4):042321

  • N. Yoran, A A.J.Short.Efficientclassicalsimulationoftheapproxi
  • Oct
  • 2007
1 Excerpt

9(5):146

  • D. E. Browne. Efficient classical simulation of the q Physics
  • May
  • 2007

arXiv:quant-ph/0611156v2

  • D. Aharonov, Z. Landau, J. Makowsky. The quantum FFT can be classically simulated
  • Jan
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…