We developed a non-Hermitian quantum optimization algorithm to find the ground state of the ferromagnetic Ising model with up to 1024 spins (qubits). Our approach leads to significant reduction of the annealing time. Analytical and numerical results demonstrate that the total annealing time is proportional to lnN, where N is the number of spins. This encouraging result is important in using classical computers in combination with quantum algorithms for the fast solutions of NP-complete problems. Additional research is proposed for extending our dissipative algorithm to more complicated problems. " 2013 American Physical Society.",,,,,,"10.1103/PhysRevA.87.042332",,,"http://hdl.handle.net/20.500.12104/43187","http://www.scopus.com/inward/rec...
We propose a non-Hermitian quantum annealing algorithm which can be useful for solving complex optim...
Low temperature dynamics of Ising ferromagnets under finite magnetic fields are studied in terms of ...
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm devise...
We developed a non-Hermitian quantum optimization algorithm to find the ground state of the ferromag...
Novel magnetic materials are important for future technological advances. Theoretical and numerical ...
A non-Hermitian quantum optimization algorithm is created and used to find the ground state of an an...
We show that the quantum approximate optimization algorithm (QAOA) can construct, with polynomially ...
A non-Hermitian quantum optimization algorithm is created and used to find the ground state of an an...
Thesis (Ph.D.)--University of Washington, 2015In this dissertation we study classical and quantum sp...
In the era of quantum technology, benchmarking classical algorithms is necessary for certifying the ...
We discuss the quantum annealing of the fully-connected ferromagnetic p-spin model in a dissipative ...
We compare the performance of quantum annealing (QA, through Schrodinger dynamics) and simulated ann...
The one-dimensional quantum Ising model is used to describe many physical systems, therefore the cal...
The Potts model is a generalization of the Ising model with $Q>2$ components. In the fully connected...
Low temperature dynamics of Ising ferromagnets under finite magnetic fields are studied in terms of ...
We propose a non-Hermitian quantum annealing algorithm which can be useful for solving complex optim...
Low temperature dynamics of Ising ferromagnets under finite magnetic fields are studied in terms of ...
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm devise...
We developed a non-Hermitian quantum optimization algorithm to find the ground state of the ferromag...
Novel magnetic materials are important for future technological advances. Theoretical and numerical ...
A non-Hermitian quantum optimization algorithm is created and used to find the ground state of an an...
We show that the quantum approximate optimization algorithm (QAOA) can construct, with polynomially ...
A non-Hermitian quantum optimization algorithm is created and used to find the ground state of an an...
Thesis (Ph.D.)--University of Washington, 2015In this dissertation we study classical and quantum sp...
In the era of quantum technology, benchmarking classical algorithms is necessary for certifying the ...
We discuss the quantum annealing of the fully-connected ferromagnetic p-spin model in a dissipative ...
We compare the performance of quantum annealing (QA, through Schrodinger dynamics) and simulated ann...
The one-dimensional quantum Ising model is used to describe many physical systems, therefore the cal...
The Potts model is a generalization of the Ising model with $Q>2$ components. In the fully connected...
Low temperature dynamics of Ising ferromagnets under finite magnetic fields are studied in terms of ...
We propose a non-Hermitian quantum annealing algorithm which can be useful for solving complex optim...
Low temperature dynamics of Ising ferromagnets under finite magnetic fields are studied in terms of ...
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm devise...