Anderson localization makes adiabatic quantum optimization fail (Q3073990): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q34004908, #quickstatements; #temporary_batch_1719270238695 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computational Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The quantum adiabatic optimization algorithm and local minima / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2753356 / rank | |||
Normal rank |
Latest revision as of 17:57, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Anderson localization makes adiabatic quantum optimization fail |
scientific article |
Statements
Anderson localization makes adiabatic quantum optimization fail (English)
0 references
12 February 2011
0 references
0 references
0 references