Benchmarking D-Wave quantum annealing systems: some challenges
暂无分享,去创建一个
[1] Daniel A. Lidar,et al. Adiabatic quantum optimization with the wrong Hamiltonian , 2013, 1310.0529.
[2] Vicky Choi,et al. Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design , 2010, Quantum Inf. Process..
[3] Masoud Mohseni,et al. Computational Role of Multiqubit Tunneling in a Quantum Annealer , 2015 .
[4] Thomas Bartz-Beielstein,et al. Experimental Methods for the Analysis of Optimization Algorithms , 2010 .
[5] M. W. Johnson,et al. Entanglement in a Quantum Annealing Processor , 2014, 1401.3500.
[6] Daniel A. Lidar,et al. Experimental signature of programmable quantum annealing , 2012, Nature Communications.
[7] M. W. Johnson,et al. Thermally assisted quantum annealing of a 16-qubit problem , 2013, Nature Communications.
[8] David S. Johnson,et al. A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.
[9] David H. Bailey. Misleading Performance Reporting in the Supercomputing Field , 1992, Sci. Program..
[10] Richard S. Barr,et al. Feature Article - Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions , 1993, INFORMS J. Comput..
[11] Mark W. Johnson,et al. Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor , 2014, IEEE Transactions on Applied Superconductivity.
[12] H. Nishimori,et al. Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.
[13] Daniel A. Lidar,et al. Defining and detecting quantum speedup , 2014, Science.
[14] Marc E. Posner,et al. The Generation of Experimental Data for Computational Testing in Optimization , 2010, Experimental Methods for the Analysis of Optimization Algorithms.
[15] E. Farhi,et al. A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.
[16] Jeremy D. Wendt,et al. Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis , 2015, 1604.00319.
[17] Roger W. Hockney. The science of computer benchmarking , 1995, Software, environments, tools.
[18] David A. Bader,et al. Algorithm Engineering for Parallel Computation , 2000, Experimental Algorithmics.
[19] Mauricio G. C. Resende,et al. Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.
[20] Daniel A. Lidar,et al. Quantum annealing correction for random Ising problems , 2014, 1408.4382.
[21] Seth Lloyd,et al. Adiabatic quantum computation is equivalent to standard quantum computation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[22] Seth Lloyd,et al. Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation , 2007, SIAM J. Comput..
[23] Ines Gloeckner,et al. Experimental Algorithmics From Algorithm Design To Robust And Efficient Software , 2016 .
[24] Vasil S. Denchev,et al. Computational multiqubit tunnelling in programmable quantum annealers , 2015, Nature Communications.
[25] S. Knysh,et al. Quantum Optimization of Fully-Connected Spin Glasses , 2014, 1406.7553.
[26] Catherine C. McGeoch. A Guide to Experimental Algorithmics , 2012 .
[27] Rupak Biswas,et al. A Performance Estimator for Quantum Annealers: Gauge selection and Parameter Setting , 2015, 1503.01083.
[28] Daniel A. Lidar,et al. Evidence for quantum annealing with more than one hundred qubits , 2013, Nature Physics.
[29] Cong Wang,et al. Experimental evaluation of an adiabiatic quantum system for combinatorial optimization , 2013, CF '13.
[30] M. Amin. Searching for quantum speedup in quasistatic quantum annealers , 2015, 1503.04216.
[31] Daniel A. Lidar,et al. Probing for quantum speedup in spin-glass problems with planted solutions , 2015, 1502.01663.