Adiabatic quantum computation (AQC) is a form of quantum computing which relies on the adiabatic theorem to do calculations and is closely related to and may be regarded as a subclass of, quantum annealing. (Wikipedia)
Questions tagged [adiabatic-model]
84 questions
31
votes
1 answer
What precisely is quantum annealing?
Many people are interested in the subject of quantum annealing, as an application of quantum technologies, not least because of D-WAVE's work on the subject. The Wikipedia article on quantum annealing implies that if one performs the 'annealing'…
Niel de Beaudrap
- 12,522
- 1
- 33
- 73
30
votes
2 answers
What is the difference between quantum annealing and adiabatic quantum computation models?
From what I understood, there seems to be a difference between quantum annealing and adiabatic quantum computation models but the only thing I found on this subject implies some strange results (see below).
My question is the following: what is…
Adrien Suau
- 5,172
- 22
- 58
29
votes
4 answers
Are quantum computers just a variant on Analog computers of the 50's & 60's that many have never seen nor used?
In the recent Question "Is Quantum Computing just Pie in the Sky" there are many responses regarding the improvements in quantum capabilities, however all are focussed on the current 'digital' computing view of the world.
Analog computers of old…
Philip Oakley
- 391
- 4
- 6
27
votes
4 answers
Why is it crucial that the initial Hamiltonian does not commute with the final Hamiltonian in adiabatic quantum computation?
I've read in many sources and books on adiabatic quantum computation (AQC) that it is crucial for the initial Hamiltonian $\hat{H}_i$ to not commute with the final Hamiltonian $\hat{H}_f$, i.e. $\left[\hat{H}_i,\hat{H}_f\right]\neq 0$. But I've…
Turbotanten
- 606
- 4
- 15
21
votes
2 answers
Did D-Wave show quantum advantage in 2023?
I would like to know your thoughts on whether or not D-Wave has shown a a smoking-gun example of quantum advantage this year. I am genuinely not quite sure what to think, but I believe the answer to this question is important in understanding the…
sheesymcdeezy
- 2,021
- 8
- 27
21
votes
2 answers
Can adiabatic quantum computing be faster than Grover's algorithm?
It has been proven that adiabatic quantum computing is equivalent to "standard", or gate-model quantum computing. Adiabatic computing, however, shows promises for optimisation problems, where the objective is to minimise (or maximise) a function…
Dyon J Don Kiwi van Vreumingen
- 835
- 1
- 5
- 14
12
votes
2 answers
Is there a general method of expressing optimization problem as a Hamiltonian?
Let's say, that we have an optimization problem in the form:
$$ \min_x f(x) \\ g_i(x) \leq 0, i = 1, ..., m \\ h_j(x) = 0, j = 1, ..., p,
$$
where $f(x)$ is an objective function, $g_i(x)$ are inequality constraints and $h_j(x)$ are equality…
brzepkowski
- 1,069
- 7
- 19
11
votes
1 answer
Does the D-Wave 2000Q satisfy DiVincenzo's criteria?
DiVincenzo's criteria for quantum computation are the following:
A scalable physical system with well characterized qubits.
The ability to initialize the state of the qubits to a simple fiducial
state.
Long relevant decoherence times.
A…
user1271772 No more free time
- 14,286
- 2
- 26
- 76
10
votes
3 answers
What is the computational complexity of quantum annealing?
Quantum annealing can be thought of as a black box solver that can find approximate solutions to hard optimization problems. For example, D-Wave quantum annealers can approximately solve quadratic unconstrained binary optimization (QUBO) problems,…
Dr. Prasanna Date
- 297
- 2
- 9
9
votes
1 answer
Can quantum annealing find excited states?
If we start with a Hamiltonian $H(t_i)$, and with our qubits prepared in the ground state of this, and then slowly change this to a Hamiltonian $H(t_i)$, the final state of our qubits should be the ground state of the new Hamiltonian. This is due to…
James Wootton
- 11,700
- 1
- 35
- 74
9
votes
2 answers
What precisely is Reverse Annealing?
Quantum Annealing, (related questions Quantum Annealing, or hamiltonian related) is the process used in D-Waves' Quantum Annealer, in which the energy landscapes are explored, for different solutions, and by tuning a suitable Hamiltonian, zero in to…
user3483902
- 825
- 8
- 15
9
votes
2 answers
Why is the time ordering omitted in the trotterised version of the time-dependent evolution operator?
The unitary evolution of a time-dependent hamiltonian is given by the time-ordered matrix exponential
$$\begin{aligned}
U(t)&=\mathcal T\exp\left[-i\int_0^tH(\tau)d\tau\right]\\
&=I-i\int_0^td\tau\,H(\tau)-\frac12\int_0^td\tau\int_0^t…
Dyon J Don Kiwi van Vreumingen
- 835
- 1
- 5
- 14
9
votes
1 answer
What is known about quantum algorithms for graph isomorphism?
Shor's algorithm (for factoring integers) and Grover's algorithm (for searches) are the two most well-known quantum algorithms. I was wondering if there was a similar result in QC that dealt with the Graph Isomorphism problem?
I can't seem to find a…
paulinho
- 251
- 1
- 4
8
votes
1 answer
What are XX, YY, YZ etc. couplings?
The D-wave quantum computer allows us to be able to minimize Ising models. In reading other questions and responses, particularly What would be the simplest addition that would make the D-Wave architecture universal?, XX couplings (and others have…
Jacob Wise
- 81
- 3
8
votes
2 answers
What's a Qubit on D-Wave 2000Q?
From D-Wave flyer:
The D-Wave 2000Q system has up to 2048 qubits and 5600 couplers. To reach this scale, it uses 128,000
Josephson junctions, which makes the D-Wave 2000Q QPU by far the most complex superconducting
integrated circuit ever…
0x90
- 263
- 1
- 6