Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
Top Cited Papers
- 17 September 2008
- journal article
- Published by Springer Science and Business Media LLC in Quantum Information Processing
- Vol. 7 (5), 193-209
- https://doi.org/10.1007/s11128-008-0082-9
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Thermally Assisted Adiabatic Quantum ComputationPhysical Review Letters, 2008
- The Complexity of the Local Hamiltonian ProblemSIAM Journal on Computing, 2006
- The quantum adiabatic optimization algorithm and local minimaPublished by Association for Computing Machinery (ACM) ,2004
- Short paths in expander graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Pseudo-Boolean optimizationDiscrete Applied Mathematics, 2002
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001
- How powerful is adiabatic quantum computation?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982