Showing quant-phShow all
3 papers · 1 filter
quant-ph2008
Relating computational complexity and quantum spectral complexity
David R. Mitchell
It is found that the statistical level fluctuations of the AQC 3-SAT problem undergo a transition from a poisson (regular) fluctuation form to a form consistent with the prediction…
quant-ph2005
Geometric Phase Based Quantum Computation Applied to an NP-Complete Problem
David R. Mitchell
We present a new approach to quantum computation involving the geometric phase. In this approach, an entire computation is performed by adiabatically evolving a suitably chosen qua…
quant-ph2004
A Random Matrix Model of Adiabatic Quantum Computing
David R. Mitchell, Christoph Adami, Waynn Lue +1
We present an analysis of the quantum adiabatic algorithm for solving hard instances of 3-SAT (an NP-complete problem) in terms of Random Matrix Theory (RMT). We determine the glob…