The travelling salesman problem and adiabatic quantum computation: an algorithm (Q670009): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computation and Quantum Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of two different quantum annealing correction codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem and adiabatic quantum computation: an algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy and efficiency of adiabatic quantum search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum speedup in quantum search: \(O\)(1) running time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUANTUM PHASE TRANSITIONS AND ENTANGLEMENT IN J<sub>1</sub>–J<sub>2</sub> MODEL / rank
 
Normal rank

Revision as of 18:17, 18 July 2024

scientific article
Language Label Description Also known as
English
The travelling salesman problem and adiabatic quantum computation: an algorithm
scientific article

    Statements

    The travelling salesman problem and adiabatic quantum computation: an algorithm (English)
    0 references
    0 references
    15 March 2019
    0 references
    travelling salesman problem
    0 references
    quantum algorithms
    0 references
    adiabatic quantum computation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references