Keywords
Kvantecomputer
Quantum Advantage
How to Cite
Abstract
Artiklen giver en struktureret gennemgang af de centrale kvantealgoritmer og deres matematiske principper. Med udgangspunkt i Deutsch-Jozsa, Grover og Shor vises, hvordan kvantetilstandes evolution kan manipuleres til at frembringe konstruktiv interferens i de rette svar. Der introduceres også variationelle algoritmer som VQE og QAOA, der kombinerer klassisk optimering med kvantemålinger og er særligt relevante for nær-termiske kvanteprocessorer. Artiklen berører kompleksitetsklasser som BQP og NP og understreger, hvordan kvantealgoritmer ikke blot er hurtigere, men opererer i en helt anden beregningsmæssig struktur. En teknisk velskrevet introduktion til det algoritmiske landskab i kvantecomputing.
References
[1] A. Lovelace, fra blogs.bodleian.ox.ac.uk/adalovelace/about-ada-lovelace/ "Ada Lovelace - celebrating 200 years of a computer visionary," Bodleian Libraries.
[2] J. Preskill (2022) "The Physics of Quantum Information", arxiv.org/abs/2208.08064v1.
[3] S. Aaronsen (2013) "Quantum Computing since Democritus", Cambridge University Press.
https://doi.org/10.1017/CBO9780511979309
[4] J. S. Bell (1964) "On the Einstein Podolsky Rosen paradox", Physics, bind 1, side 195.
https://doi.org/10.1103/PhysicsPhysiqueFizika.1.195
[5] The Nobel Prize in Physics 2022, Popular science background, "How entanglement has become a powerful tool". www.nobelprize.org/uploads/2022/10/popular-physicsprize2022-3.pdf
[6] E. Bernstein og U. Vazirani (1997) "Quantum complexity theory", SIAM J. Comput., bind 26, side 1411-1473.
https://doi.org/10.1137/S0097539796300921
[7] D. P. DiVincenzo (2000) "The physical implementation of quantum computatiuon", Fortschritte der Phyzik: Progress of Physics, bind 48, side 771.
https://doi.org/10.1002/1521-3978(200009)48:9/11<771::AID-PROP771>3.0.CO;2-E
[8] R. Jozsa (1997) "Entanglement and quantum computation", arxiv.org/abs/quant-ph/9707034.
[9] P. W. Shor (2001) "Introduction to quantum algorithms", arxiv.org/pdf/quant-ph/0005003.pdf.
[10] S. Aaronson (2007) "Shor, I'll do it", scottaaronson.blog/?p=208 (blogindlæg).
[11] J. Preskill, "Lecture Notes for Physics 229: Quantum Computation", theory.caltech.edu/∼preskill/ph229/notes/chap6.pdf.
[12] R. Jozsa og N. Linden (2002) "On the role of entanglement in quantum computational speed-up", arxiv.org/pdf/quant-ph/0201143.pdf.
[13] M. A. Nielsen og I. L. Chuang (2000) "Quantum Computation and Quantum Information", Cambridge University Press.
[14] D. Gottesman (1998) "The Heisenberg representation of quantum computers", arxiv.org/pdf/quant-ph/9807006.pdf.
[15] S. Aaronson og D. Gottesman (2004) "Improved simulation of stabilizer circuits", Phys. Rev. Lett., bind 70, side 052328. arxiv.org/abs/quant-ph/0406196.
https://doi.org/10.1103/PhysRevA.70.052328
[16] S. Aaronson, "Stabilizer Formalism", www.scottaaronson.com/qclec/28.pdf (forelæsningsnoter).
[17] F. Arute m.fl. (2019) "Quantum supremacy using a programmable superconducting processor", Nature, bind 574, side 505.
[18] E. Farhi, J. Goldstone og S. Gutmann (2014) "A quantum approximate optimization algorithm", arxiv.org/abs/1411.4028.
[19] A. Peruzzo m.fl. (2014) "A variational eigenvalue solver on a photonic quantum processor", Nature Commun., bind 5, side 4213, arxiv.org/abs/1304.3061.
Counting from volume 37 (2026 -), articles published are licensed under Creative Commons Attribution-NonCommercial CC BY-NC 4.0.
Articles in volume 1-36 (1990 - 2025) are not licensed under Creative Commons. In these volumes, all rights are reserved to the authors of the articles respectively.