Quantencomputer (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Quantencomputer" in German language version.

refsWebsite
Global rank German rank
2nd place
3rd place
69th place
189th place
234th place
203rd place
123rd place
6th place
1,960th place
130th place
1st place
1st place
766th place
46th place
1,065th place
65th place
1,283rd place
1,723rd place
1,272nd place
1,966th place
18th place
181st place
6,413th place
5,804th place
low place
low place
222nd place
272nd place
low place
low place
1,131st place
1,159th place
187th place
662nd place
415th place
779th place
84th place
513th place
low place
8,716th place
low place
2,679th place
low place
low place
274th place
152nd place
low place
low place
2,106th place
139th place
low place
low place
low place
low place
66th place
4th place
267th place
15th place
low place
low place
low place
low place
2,869th place
313th place
11th place
1,120th place
580th place
1,106th place
1,067th place
2,868th place
4,983rd place
low place
418th place
22nd place
low place
2,256th place
105th place
819th place
1,747th place
1,498th place
4,511th place
9,982nd place
9,571st place
1,225th place
7,983rd place
704th place
5,704th place
362nd place
34th place
113th place
7,231st place
low place
low place
4,610th place
466th place
1,495th place
1,943rd place
4,790th place
279th place
42nd place
884th place
51st place
4th place
7th place
4,051st place
264th place
774th place
980th place
low place
4,643rd place
1,185th place
2,009th place
low place
low place

acm.org

dl.acm.org

  • Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl: Quantum Annealing versus Digital Computing: An Experimental Comparison. In: ACM Journal of Experimental Algorithmics. Band 26, 31. Dezember 2021, ISSN 1084-6654, S. 1–30, doi:10.1145/3459606 (acm.org [abgerufen am 17. November 2022]).

admin.ch

amazon.com

aws.amazon.com

americanscientist.org

arxiv.org

berkeley.edu

people.eecs.berkeley.edu

bmbf.de

com-magazin.de

cond-mat.de

derstandard.de

doi.org

  • Paul Benioff: Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines. In: International Journal of Theoretical Physics. Band 21, Nr. 3, 1. April 1982, ISSN 1572-9575, S. 177–201, doi:10.1007/BF01857725.
  • Focus on quantum science and technology initiatives around the world. In: Rob Thew, Thomas Jennewein and Masahide Sasaki (Hrsg.): Quantum Science and Technology. Band 5, Nr. 1, 2019, doi:10.1088/2058-9565/ab5992 (special issue zu verschiedenen nationalen „Quanten-Initiativen“).
  • Gary Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, Yang Wang: The unconstrained binary quadratic programming problem: a survey. In: Journal of Combinatorial Optimization. Band 28, Nr. 1, Juli 2014, ISSN 1382-6905, S. 58–81, doi:10.1007/s10878-014-9734-0 (springer.com [abgerufen am 9. Januar 2024]).
  • Joseph F. Fitzsimons: Private quantum computation: an introduction to blind quantum computing and related protocols. In: npj Quantum Inf. Band 3, 2017, S. 23, doi:10.1038/s41534-017-0025-3 (englisch).
  • Paul Benioff: The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. In: Journal of Statistical Physics. 22. Jahrgang, Nr. 5, 1980, S. 563–591, doi:10.1007/bf01011339, bibcode:1980JSP....22..563B (englisch).
  • P. Benioff: Quantum mechanical hamiltonian models of turing machines. In: Journal of Statistical Physics. 29. Jahrgang, Nr. 3, 1982, S. 515–546, doi:10.1007/BF01342185, bibcode:1982JSP....29..515B (englisch).
  • E. Bernstein, U. Vazirani: Quantum Complexity Theory. In: SIAM Journal on Computing. Band 26, Nr. 5, 1997, S. 1411, doi:10.1137/S0097539796300921 (berkeley.edu [PDF] Theorem 8.2.3).
  • Ran Raz, Avishay Tal: Oracle separation of BQP and PH. In: STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. 2019, S. 13–23, doi:10.1145/3313276.3316315 (weizmann.ac.il).
  • Ewin Tang: A quantum-inspired classical algorithm for recommendation systems. In: STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. 2019, S. 217–228, doi:10.1145/3313276.3316310, arxiv:1807.04271.
  • D. Kielpinski, C. Monroe, and D. J. Wineland: Architecture for a large-scale ion-trap quantum computer. In: Nature. Band 417, 13. Juni 2002, S. 709–711, doi:10.1038/nature00784.
  • M. Harlander et al.: Trapped-ion antennae for the transmission of quantum information. In: Nature. Februar 2011, doi:10.1038/nature09800.
  • F. Helmer et al.: Cavity grid for scalable quantum computation with superconducting circuits. In: Europhysics Letters. Band 85, 2009, S. 50007, doi:10.1209/0295-5075/85/50007, arxiv:0706.3625.
  • Peter W. Shor: Scheme for reducing decoherence in quantum computer memory. In: Physical Review A. Band 52, Nr. 4, Oktober 1995, S. R2493–R2496, doi:10.1103/PhysRevA.52.R2493 (miami.edu [PDF]).
  • L. M. K. Vandersypen u. a.: Experimental realization of Shor’s factorizing algorithm using nuclear magnetic resonance. In: letters to nature. Band 414, 20./27. Dezember 2001. S. 883–888 doi:10.1038/414883a
  • H. Häffner, W. Hänsel u. a.: Scalable multiparticle entanglement of trapped ions. In: Nature. 438, 2005, S. 643–646, doi:10.1038/nature04279.
  • L. DiCarlo, J. M. Chow u. a.: Demonstration of two-qubit algorithms with a superconducting quantum processor. In: Nature. 460, 2009, S. 240, doi:10.1038/nature08121. arxiv:0903.2030
  • C. Ospelkaus, U. Warring, Y. Colombe, K. R. Brown, J. M. Amini, D. Leibfried, D. J. Wineland: Microwave quantum logic gates for trapped ions. In: Nature. 476, 2011, S. 181–184, doi:10.1038/nature10290.
  • Dorothy Denning: Is Quantum Computing a Cybersecurity Threat? In: American Scientist. Band 107, Nr. 2, 2019, S. 83, doi:10.1511/2019.107.2.83 (englisch, americanscientist.org).
  • Han-Sen Zhong u. a.: Quantum computational advantage using photons. In: Science. Band 370, Nr. 6523, 18. Dezember 2020, S. 1460–1463, doi:10.1126/science.abe8770, PMID 33273064.
  • Michael E. Beverland et al.: Assessing requirements to scale to practical quantum advantage. In: arxiv.org arXiv:2211.07629,doi:10.48550/arXiv.2211.07629.
  • Craig Gidney, Martin Ekerå: How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. In: Quantum Band 5, 2021, S. 433, doi:10.22331/q-2021-04-15-433
  • Michael Brooks: Quantum computers: what are they good for? In: Nature. Band 617, 2023, S1-S3, doi:10.1038/d41586-023-01692-9
  • Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl: Quantum Annealing versus Digital Computing: An Experimental Comparison. In: ACM Journal of Experimental Algorithmics. Band 26, 31. Dezember 2021, ISSN 1084-6654, S. 1–30, doi:10.1145/3459606 (acm.org [abgerufen am 17. November 2022]).

dwavesys.com

elpais.com

engadget.com

fz-juelich.de

google.de

books.google.de

  • Matthias Homeister: Quantum Computing verstehen, 6. Auflage, 2022, S. 26 f

googleblog.com

ai.googleblog.com

handelsblatt.com

harvard.edu

ui.adsabs.harvard.edu

  • Paul Benioff: The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. In: Journal of Statistical Physics. 22. Jahrgang, Nr. 5, 1980, S. 563–591, doi:10.1007/bf01011339, bibcode:1980JSP....22..563B (englisch).
  • P. Benioff: Quantum mechanical hamiltonian models of turing machines. In: Journal of Statistical Physics. 29. Jahrgang, Nr. 3, 1982, S. 515–546, doi:10.1007/BF01342185, bibcode:1982JSP....29..515B (englisch).

heise.de

hpcwire.com

hu-berlin.de

informatik.hu-berlin.de

  • Johannes Köbler, Olaf Beyersdorff: Von der Turingmaschine zum Quantencomputer – ein Gang durch die Geschichte der Komplexitätstheorie. In: Wolfgang Reisig und Johann-Christoph Freytag (Hrsg.): Informatik: aktuelle Themen im historischen Kontext. Springer, Heidelberg Berlin 2006, ISBN 3-540-32742-8, S. 165–195. Veröfflicht bei Humboldt Universität, Berlin dort S.24

ibm.com

idw-online.de

miami.edu

cs.miami.edu

mit.edu

ocw.mit.edu

news.mit.edu

nature.com

newscientist.com

nih.gov

ncbi.nlm.nih.gov

orf.at

sciencev2.orf.at

phys.org

pro-physik.de

qiskit.org

quantamagazine.org

quantencomputer-info.de

quantumalgorithmzoo.org

quantumoptics.at

  • Hanns-Christoph Nägerl: Ion Strings for Quantum Computation(Dissertation Innsbruck 1998) Online
  • S. Gulde u. a.: Implementation of the Deutsch-Jozsa algorithm on an ion-trap quantum computer. In: Nature. Band 421, 2003, 48. Online

rub.de

hgi.rub.de

semanticscholar.org

  • D. Deutsch: Quantum theory, the Church-Turing principle and the universal quantum computer. Band 400. Proceedings of the Royal Society, London 1985, S. 97–117 (semanticscholar.org).

spektrum.de

spiegel.de

springer.com

link.springer.com

  • Gary Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, Yang Wang: The unconstrained binary quadratic programming problem: a survey. In: Journal of Combinatorial Optimization. Band 28, Nr. 1, Juli 2014, ISSN 1382-6905, S. 58–81, doi:10.1007/s10878-014-9734-0 (springer.com [abgerufen am 9. Januar 2024]).

tagesschau.de

techcrunch.com

techhq.com

technologyreview.com

th-brandenburg.de

informatik.th-brandenburg.de

  • Burkhard Lenze: Mathematik und Quantum Computing, Logos Verlag Berlin S. 8 Online

uibk.ac.at

umd.edu

iontrap.umd.edu

  • J. I. Cirac und P. Zoller: Quantum Computations with Cold Trapped Ions In: Phys. Rev. Lett. Band 74 Nr. 20 S. 4091–4095 1995 Online

uni-mainz.de

quantenbit.physik.uni-mainz.de

  • Thomas W. Deuschle: Kalte Ionenkristalle in einer segmentierten Paul-Falle (Dissertation Ulm 2007) S. 3Online

washington.edu

courses.cs.washington.edu

  • D. R. Simon, On the Power of Quantum Computation, SIAM Journal on Computing, Band 26, 1997, S. 1474–1483 Online

washingtonpost.com

web.archive.org

weizmann.ac.il

eccc.weizmann.ac.il

  • Ran Raz, Avishay Tal: Oracle separation of BQP and PH. In: STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. 2019, S. 13–23, doi:10.1145/3313276.3316315 (weizmann.ac.il).

wiley.com

onlinelibrary.wiley.com

zdb-katalog.de

  • Paul Benioff: Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines. In: International Journal of Theoretical Physics. Band 21, Nr. 3, 1. April 1982, ISSN 1572-9575, S. 177–201, doi:10.1007/BF01857725.
  • Gary Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, Yang Wang: The unconstrained binary quadratic programming problem: a survey. In: Journal of Combinatorial Optimization. Band 28, Nr. 1, Juli 2014, ISSN 1382-6905, S. 58–81, doi:10.1007/s10878-014-9734-0 (springer.com [abgerufen am 9. Januar 2024]).
  • A. Erhard, H. P. Nautrup et al.: Entangling logical qubits with lattice surgery. In: Nature. Band 581, 13. Januar 2021, ISSN 1476-4687, S. 220–224 (nature.com).
  • Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl: Quantum Annealing versus Digital Computing: An Experimental Comparison. In: ACM Journal of Experimental Algorithmics. Band 26, 31. Dezember 2021, ISSN 1084-6654, S. 1–30, doi:10.1145/3459606 (acm.org [abgerufen am 17. November 2022]).

zeit.de