# Questions tagged [adiabatic-model]

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)

83 questions
Filter by
Sorted by
Tagged with
156 views

### Does optimization via Hamiltonian evolution have an analogy like gradient descent?

I'm trying to find out, if there is a simplified concept to understand what is occuring during quantum annealing/ Falqon/ Hamiltonian evolution like algorithms. During classical gradient descent ...
• 361
57 views

### Complexity of minor embedding [closed]

I am looking for a proof why the minor embedding problem (or minor graph search or minor testing) belongs to NP-complete problems. I would like to find a paper or in general an explanation that shows ...
1 vote
33 views

### Adiabatic evolution vs QAOA

Attempting to understand some basics here before developing an quantum algorithm. Would of you be able to help clarify the following definitions I attempted to construct which compare the two ...
• 11
1 vote
32 views

### How to approximate the time-dependent Hamiltonian in quantum adiabatic theory by the non time-dependent Hamiltonian?

Recently, I am learning how to solve the linear equation $A\left | x \right \rangle =\left | b \right \rangle$ using quantum adiabatic theory. In the solving process, people usually need to set the ...
1 vote
70 views

### How to actually solve for the eigenstates in the adiabatic version of Grover's algorithm

The adiabatic version of Grover's algorithm says that the eigenstates of the Hamiltonian $H(t)=(1-\frac{t}{T})H_0+\frac{t}{T}H_m$ (equation 10 in the linked paper) can be used to solve the eigenvalue ...
• 175
43 views

### Derivation of energy gap formula for adiabatic Grover algorithm

I am having a difficulty in finding the full derivation for local search energy gap, as described in In the adiabatic version of Grover's algorithm, how is the Hamiltonian constructed?. I looked ...
• 457
27 views

### Can adiabatic quantum computing be used to find local minimum instead of ground states?

We know that with unfriendly energy gap circumstances, adiabatic quantum computing takes exponential time to find a ground state of some hamiltonian. But if some local minimum state is all we look for,...
• 457
61 views

### Understanding circuit to Hamiltonian embedding where we do not have a separate clock register

I am trying to understand the clock construction given in this paper, to embed a circuit to a Hamiltonian, which doesn't need to access a separate clock register. The construction, at a high level, ...
• 1,435
858 views

### Does the D-Wave hardware show any advantage for academic use-cases, for example in condensed matter physics?

The D-Wave team put out a few papers (like this one and this one) in the last few years describing how their methods can find ground states of certain spin-glass Hamiltonians faster than classical ...
• 1,926
3k views

### 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 ...
• 1,926
84 views

### Python code for D-Wave Annealer

In the below screenshot, I am aware of resolving the issue by reducing num_reads as the annealing time is exceeding my allowance. Although it works, my question ...
• 241
119 views

### Adiabatic state preparation for quantum phase estimation

I'm trying to understand the problem of state preparation for quantum phase estimation (QPE). Specifically how states are prepared adiabatically. I have a couple of questions: 1). Typically when one ...
• 31
37 views

### Compiling pulses with time dependent $\sigma_x$ and $\sigma_y$ control

I have a Hamiltonian of the form: $$H = c_x(t) \sigma_x + c_y(t) \sigma_y$$ and I want to compile a pulse "P" that has both $\sigma_x$ and $\sigma_y$ control, with different time dependent ...
• 31
54 views

### Implementing Adiabatic Grover Search via QAOA

I am reading the paper Grover Search Inspired Alternating Operator Ansatz of Quantum Approximate Optimization Algorithm for Search Problems. The paper proposes running the Adiabatic Grover Search ...
• 191
190 views

### Is there a quantum algorithm for the closest vector problem on a 2-dimensional lattice?

Is there a standard quantum algorithm (adiabatic or density matrix based) that can output the answer to a 2-dimensional closest vector problem: ie. find the closest lattice point (the blue one) that ...
• 511
1 vote
76 views

### Link between AQC and QAOA

I try to understand precisely the link between AQC and QAOA, through the Trotter-Suzuki formula. A similar question is Derivation of QAOA from AQC, but I was asked by moderators to post my question ...
• 321
106 views

### Computational complexity of the circuit model vs adiabatic model?

I'm trying to understand how computational complexity is quantified in adiabatic quantum computing. With the circuit model, computational complexity is simple: count the number of times you queried ...
620 views

### Can Shor's algorithm be done with the same efficiency on an adiabatic quantum computer as on a circuit-based one?

Unfortunately, I cannot find any information on this, so I am asking in this forum if anyone knows, and if so, why this is the case?
47 views

### Adiabatic computing basics

I am reading about adiabatic quantum computing- specifically, about how it can find the lowest energy configuration of the Ising model. It is said that the initial state is a superposition of all the ...
297 views

### Derivation of QAOA from AQC

In adiabatic quantum optimization we start with an initial Hamiltonian $H_0$ and then adiabatically evolve from $H_0$ to $H_P$ (problem hamiltonian) for a time $T$ according to \label{...
• 177
21 views

### AQC definition modifications costs and pay-offs

I was wondering if one can think of a more general relation between alleviating conditions for the state in which the evolution takes palce in AQC paradigm and constraining the structure of the ...
42 views

### How to compare Quantum Annealing and Adiabatic Quantum Computing?

I'm still unsure on the difference between adiabatic quantum computing (AQC) and quantum annealing (QA). Please critique these interpretations: AQC: Define a Hamiltonian with an easy-to-prepare ...
• 474
195 views

794 views

### In the adiabatic version of Grover's algorithm, how is the Hamiltonian constructed?

X-posted on physics.stackexchange In quantum computation, there is a famous algorithm to search a marked item in an unstructured database called Grover's algorithm. It achieves a quadratic speedup ...
191 views

### Adiabatic Quantum Computer e intermediate Hamiltonian evolves the state within the manifold

The Adiabatic Quantum Computer is implemented by slowly increasing the parameter s from 0 to 1 in the intermediate Hamiltonian \$[\hat{H}(s) = \hat{H}_{input} + (1-s)\hat{H}_{init} + s\hat{H}_{circuit}]...
• 535
60 views

### Types of Quantum Computer [duplicate]

I am confused of all that different Quantum computers. please correct me if I say something wrong. There are two main different types of quantum computing: Quantum Gates based computing quantum ...
• 141