248 citations · 497 across the 12 of their papers we have counts for
8 papers · 1 filter
Essentiality of the Non-stoquastic Hamiltonians and Driver Graph Design in Quantum Optimization Annealing
Vicky Choi
One of the distinct features of quantum mechanics is that the probability amplitude can have both positive and negative signs, which has no classical counterpart as the classical p…
The Effects of the Problem Hamiltonian Parameters on the Minimum Spectral Gap in Adiabatic Quantum Optimization
Vicky Choi
We study the relation between the Ising problem Hamiltonian parameters and the minimum spectral gap (min-gap) of the system Hamiltonian in the Ising-based quantum annealer. The mai…
Different Adiabatic Quantum Optimization Algorithms for the NP-Complete Exact Cover and 3SAT Problems
Vicky Choi
One of the most important questions in studying quantum computation is: whether a quantum computer can solve NP-complete problems more efficiently than a classical computer? In 200…
Avoid First Order Quantum Phase Transition by Changing Problem Hamiltonians
Vicky Choi
In Amin and Choi \cite{AC09}, we show that an adiabatic quantum algorithm for the NP-hard maximum independent set (MIS) problem on a set of special family of graphs in which there…
Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
Vicky Choi
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in…
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Vicky Choi
In [Choi08], we introduced the notion of minor-embedding in adiabatic quantum optimization. A minor-embedding of a graph G in a quantum hardware graph U is a subgraph of U such tha…