Modeling an Adiabatic Quantum Computer via an Exact Map to a Gas of Particles
Open Access
- 23 March 2007
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 98 (12) , 120503
Abstract
We map adiabatic quantum evolution on the classical Hamiltonian dynamics of a 1D gas (Pechukas gas) and simulate the latter numerically. This approach turns out to be both insightful and numerically efficient, as seen from our example of a CNOT gate simulation. For a general class of Hamiltonians we show that the escape probability from the initial state scales no faster than , where is the adiabaticity parameter. The scaling exponent for the escape probability is for all levels, except the edge (bottom and top) ones, where . In principle, our method can solve arbitrarily large adiabatic quantum Hamiltonians.
Keywords
This publication has 15 references indexed in Scilit:
- Decoherence in a scalable adiabatic quantum computerPhysical Review A, 2006
- Error-correcting codes for adiabatic quantum computationPhysical Review A, 2006
- Adiabatic Quantum Computation in Open SystemsPhysical Review Letters, 2005
- Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiabilityPhysical Review A, 2005
- Random matrix model of adiabatic quantum computingPhysical Review A, 2005
- Random matrix approach to quantum adiabatic evolution algorithmsPhysical Review A, 2005
- Adiabatic quantum computing for random satisfiability problemsPhysical Review A, 2003
- Experimental Implementation of an Adiabatic Quantum Optimization AlgorithmPhysical Review Letters, 2003
- Robustness of adiabatic quantum computationPhysical Review A, 2001
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001