A quantum macro assembler
暂无分享,去创建一个
[1] Aidan Roy,et al. A practical heuristic for finding graph minors , 2014, ArXiv.
[2] S. Lloyd. Quantum-Mechanical Computers , 1995 .
[3] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[4] Hiroyuki Mizuno,et al. A 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS Annealing , 2016, IEEE Journal of Solid-State Circuits.
[5] S. Dreyfus,et al. Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .
[6] B. Cipra. The Ising Model Is NP-Complete , 2000 .
[7] von NeumannJohn. First Draft of a Report on the EDVAC , 1993 .
[8] M. W. Johnson,et al. Quantum annealing with manufactured spins , 2011, Nature.
[9] John von Neumann,et al. First draft of a report on the EDVAC , 1993, IEEE Annals of the History of Computing.
[10] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[11] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[12] Mark W. Johnson,et al. Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor , 2014, IEEE Transactions on Applied Superconductivity.
[13] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .