Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2012

Highly Cited

2012

We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed universal quantum gates can be… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

Adiabatic quantum computation (AQC) is a universal model for quantum computation which seeks to transform the initial ground… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

This chapter contains sections titled: Adiabatic Processes Adiabatic Quantum Computing Exercises

Is this relevant?

Highly Cited

2008

Highly Cited

2008

We show that the NP-hard quadratic unconstrained binary optimization (QUBO) problem on a graph G can be solved using an adiabatic… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

The model of adiabatic quantum computation is a relatively recent model of quantum computation that has attracted attention in… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

The quantum adiabatic optimization algorithm uses the adiabatic theorem from quantum physics to minimize a function by… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

The authors analyze the computational power and limitations of the recently proposed 'quantum adiabatic evolution algorithm… Expand

Is this relevant?