Questions tagged [annealing]

It is a metaheuristic for finding the global minimum of a given objective function over a given set of candidate solutions (candidate states), by a process using quantum fluctuations. (Wikipedia)

Filter by
Sorted by
Tagged with
1 vote
0 answers
20 views

Why is quantum annealing not used in optimization for variational quantum algorithms?

I have been learning about variational quantum algorithms and encountered that none of the articles talk about using quantum annealers for optimization of the parameters ? I have however encountered ...
Chetan Waghela's user avatar
2 votes
0 answers
31 views

Quantum Annealing on IBMQ using Qiskit-Pulse

Qiskit-Pulse is the analog level control SDK of IBMQ hardware. Is it possible to implement an adiabatic annealing protocol/algorithm on IBMQ hardware using Qiskit-Pulse? Not asking about QAOA, which I ...
The Quantum Enthusiast's user avatar
3 votes
0 answers
48 views

I would like to know the textbook/paper on hamiltonian for rf-SQUID

I am a graduate student in the Department of Computer Engineering, and I am currently doing research on superconducting quantum computers. In particular, I am focusing on quantum annealing machines ...
Aki's user avatar
  • 31
2 votes
0 answers
100 views

Can D-Wave presently solve real-world problems that conventional computers cannot solve?

There are number of threads on this site about the ability of QCs solving real-world problems (see for example What are the practical applications of quantum computing in engineering by the year 2030?,...
Max's user avatar
  • 85
4 votes
1 answer
759 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 ...
sheesymcdeezy's user avatar
19 votes
2 answers
2k 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 ...
sheesymcdeezy's user avatar
3 votes
1 answer
63 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 ...
Sup's user avatar
  • 231
0 votes
1 answer
70 views

How to translate a problem for a gate-based quantum computer into an equivalent problem for a quantum annealer?

There is an offhand claim (somewhere) in https://www.youtube.com/watch?v=eFIk7wpU5vA that a quantum annealer is in principle a completely equivalent machine to a gate-based quantum computer, in the ...
James's user avatar
  • 475
0 votes
0 answers
57 views

How can I exactly solve a Quadratic Model with integer variables using DWave Ocean classical solvers?

As an example, let's consider the following simple QuadraticModel problem with just 3 INTEGER variables: ...
SimoneGasperini's user avatar
2 votes
1 answer
52 views

Why is a large quantum annealer likely to leave its ground state?

For problems of significant size in quantum annealing, I have read that even for slow transitions, the annealer is likely to leave its ground state. I have not fully grasped the meaning of why exactly ...
fparisio's user avatar
0 votes
0 answers
186 views

Extracting a QUBO matrix from pyqubo

I am benchmarking different QUBO solvers for a very simple instance of the knapsack problem. Some of these solvers require the matrix, Q, and offset, b, from the equation: $$ \begin{equation} x^{\...
Waqas Parvaiz's user avatar
4 votes
2 answers
566 views

Is there any quantum annealer simulator offered by DWave?

I am searching for quantum annealer simulator offered by DWave. I found classical solvers in dimod packages that implement simulated annealing, but I couldn’t find solver that simulates the real ...
SEB4N's user avatar
  • 41
2 votes
2 answers
183 views

Grover's algorithm to maximize QUBO functions

I'm trying to maximize a QUBO function f(x,y,z) = 3xy + 4xz - 3yz + 11y + z. How can I use Grover's algorithm to do this? I've been told to encode this cost ...
Van Peer's user avatar
  • 557
3 votes
1 answer
58 views

What is meant by the "quasi-locality" of the interactions in a quantum annealer?

I am reading a paper on Quantum Annealing [1], and the paper writes the following: "one of the fundamental challenges in building a fully programmable quantum annealer is the competing ...
Q.Ask's user avatar
  • 195
2 votes
0 answers
19 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 ...
devoted4gainz's user avatar
4 votes
0 answers
37 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 ...
Ken Robbins's user avatar
3 votes
1 answer
318 views

Understanding of the transverse-field Ising model

I want to make sure whether I do understand the transverse Ising model correctly or not. The classical Ising model describes the interaction between spins in a grid and the state of spins can be ...
Kai-Chun Lin's user avatar
1 vote
1 answer
108 views

Using entropy quantum computing for solving optimization problems

I would like to follow up on this question (What is Entropy Quantum Computing?). Company Quantum Computing Inc. announced that they made their quantum computer aimed at solving binary optimization ...
Martin Vesely's user avatar
7 votes
1 answer
281 views

What arguments point towards D-Wave devices being potentially useful?

I'm looking for any evidence pointing towards D-Wave's approach to quantum computation being promising to achieve any sort of computational advantage with respect to classical devices. Note that I'm ...
glS's user avatar
  • 23.9k
1 vote
1 answer
440 views

How does Fujitsu's digital annealer work?

I have read Fujitsu's white paper for a brief introduction to their device: http://marketing.us.fujitsu.com/rs/407-MTR-501/images/quantum-inspired-computing.pdf As far as I know, Fujitsu's hardware is ...
CW Lino's user avatar
  • 35
1 vote
0 answers
59 views

How can a QUBO matrix with many identical, non-zero off-diagonal terms be made sparse?

I am with a QUBO matrix where entire off-diagonal sections are with the same value, which is the same between sections. Consider the following example (much smaller than those I am actually working ...
T. Zaborniak's user avatar
3 votes
2 answers
119 views

Can D-Wave machines be applied to simulate Hamiltonians arising in quantum physics?

AFAIK D-Wave primarily advertises their machines as tools for solving problems with classical input, i.e. when the Hamiltonian to be minimized is a function of $Z$s. Can one use their machines in ...
mavzolej's user avatar
  • 1,901
3 votes
1 answer
345 views

Why is quantum annealing often associated with the Ising model?

Quantum annealing is often associated with Ising Model, in the sense that the problem Hamiltonian needs to be in the form of an Ising Hamiltonian. Is this because the physical description of the ...
usercs's user avatar
  • 461
3 votes
1 answer
163 views

Is there any rigorous proof that Quantum Annealing provides a quantum advantage?

Is there any rigorous proof that Quantum Annealing (QA) is of any benefit (e.g. in terms of time to optimal solution, convergence rate, etc.) for a specific problem? Or any empirical evidence for the ...
Nepomuk Hirsch's user avatar
1 vote
2 answers
198 views

Is digital quantum computing more powerful than the analog one?

What I get so far: Analog quantum computing: The Hamiltonian is implemented on the QC, solution is found by e.g. quantum annealing. The whole state is changing continuously. Digital quantum computing: ...
nuemlouno's user avatar
  • 177
1 vote
1 answer
311 views

Convert Hamiltonian to Ising Formulation or QUBO

I have a tridiagonal Hamiltonian matrix that I need to convert to QUBO or Ising format to use D-Wave's quantum annealing solvers. For a generic tridiagonal: \begin{pmatrix} a_1 & b_1 \\ c_1 & ...
MYang's user avatar
  • 17
4 votes
0 answers
78 views

Why do Quantum Annealer have (currently) a higher scaling potential?

One may categorize quantum computers in two classes: Quantum Annealer and (universal) Gate Quantum Computers. There may be also other categories. IBM announced 127 Qubits for their next Gate Quantum ...
choc1709's user avatar
  • 151
2 votes
1 answer
239 views

Quantum Annealing vs Quantum Monte Carlo: can QMC do all that QA can?

I'm working on an essay about quantum technology, and the connection between the annealing algorithm and quantum computing hardware is an important transition in the text. I'd like to know if there is ...
CW Lino's user avatar
  • 35
1 vote
1 answer
211 views

Is the Quantum Annealing model universal?

I understand that the D-Wave Quantum Annealer they have today is not a universal quantum computer. Is the reason that it's not universal because of the lack of error correction and lack of all-to-all ...
bubakazouba's user avatar
0 votes
0 answers
145 views

Mathematical definition of QUBO problem

The quantum annealing approach is using the equivalence between QUBO matrix and Ising Hamiltonian to solve the problem. Therefore, it is necessary to transform a NP-hard problem into a QUBO matrix. ...
Kai-Chun Lin's user avatar
3 votes
1 answer
122 views

Can any binary problem be solved by a QUBO?

As far as I know, if a computing problem can be solved by the quantum annealing approach, it also means the solution space should be binary, e.g., a vector that only contains either 0 and 1. Otherwise,...
Kai-Chun Lin's user avatar
4 votes
0 answers
246 views

Any simulator packages for quantum annealing/adiabatic quantum computation?

Are there any simulator packages for quantum annealing/adiabatic quantum computation, like Qiskit Aer but for quantum annealing? There seems to be only classical heuristics in D-Wave Ocean package, ...
haoyu's user avatar
  • 166
3 votes
1 answer
319 views

What is the relationship between the mixing operators and initial states found in QAOA and Quantum Annealing?

In many papers, the QAOA is shown to be intimately related to Quantum Annealing/Quantum Adiabatic Algorithm/Adiabatic Quantum Optimization. The mixing operator in the QAOA is described by Hadfield as ...
RMistri's user avatar
  • 51
3 votes
1 answer
143 views

Understand final Hamiltonian in Quantum Annealing

Currently, I’m studying quantum annealing in which the system evolves according to the Hamiltonian: $$ H(t) = H_F + \Gamma(t) H_D,\tag{1} $$ where $H_F$ is a final (classical) Hamiltonian, $H_D$ is a ...
Prksa's user avatar
  • 143
2 votes
0 answers
76 views

Example of lower bound on spectral gap for adiabatic quantum computing

is there a list of reference for which the authors prove a lower bound of the spectral gap for an adiabatic quantum algorithm? I.e. I am searching for examples where the authors solve a problem with ...
asdf's user avatar
  • 493
1 vote
1 answer
240 views

How is eigendecomposition of a Hamiltonian equivalent to finding the minimum of an energy function?

This question is in regards to Dwave's quantum computer which is tailored to solve QUBO problems using quantum annealing. QM tells us that the ground state of a quantum system is given by the ...
morpheus's user avatar
  • 359
1 vote
1 answer
94 views

Question about the counter diabatic(CD) term in Digitized Adiabatic Quantum Computing

Recently I have read two articles about the Digitized Adiabatic Quantum Computing(DAQC), and tried to factorize $35=5\times7$ and $2479=67\times37$. But some problems came when trying to solve the ...
Liu's user avatar
  • 21
4 votes
0 answers
69 views

What type of tasks it is possible to solve on a quantum simulator?

In this article, the author claimed that researches from Harvard and MIT created 256 qubits quantum simulator. However, we are not talking about piece of software on a classical computer but actual ...
Martin Vesely's user avatar
7 votes
2 answers
175 views

Quantum annealing - studies showing empirical evidence for better performance in comparison with classical computers

Currently, it is not known wheter quantum anneling or algorithms like VQE and QAOA for general purpose quantum computers bring about any increase in computational power. However, there are some ...
Martin Vesely's user avatar
1 vote
1 answer
61 views

What do the numbers in the Ising sampleset mean?

I am trying to create a portfolio optimization with the DWave Quantum Computer. I wrote some code trying to somehow reconstruct the following Ising model paper: Ai ...
Liza Darwesh's user avatar
4 votes
0 answers
54 views

What is the state-of-the-art annealing device for solving Ising problems?

I understand that in addition to D-Wave's quantum annealer, there have been other unconventional (although non-quantum) Ising solvers like the one from Toshiba, Fujitsu, the Coherent Ising machine, ...
Arun's user avatar
  • 93
4 votes
1 answer
153 views

Is Quantum Annealing threatened by the Quantum Gates approach?

Since Quantum Annealing is extremely powerful for optimization it is limited in scope. However, when a universal Quantum Computer based on gates arrives, it will have a wider scope including ...
Adhisha Gammanpila's user avatar
3 votes
1 answer
115 views

How to decide bias in Hamiltonian Ising model?

I am trying to code finance portfolio optimisation problem into a quantum annealer, using the Hamiltonian Ising model. I am using the dwave module ...
Liza Darwesh's user avatar
3 votes
1 answer
126 views

Relationship of Adiabatic Quantum Computing speedup to Quantum Random Walk hit time

Considering the following two phenomena: Adiabatic quantum computing in general exhibits a quadratic speedup over classical simulated annealing, though for some Hamiltonians it may be faster (while ...
Sideshow Bob's user avatar
4 votes
2 answers
203 views

Why is it so important to have uniform chain lengths in a minor embedding?

Very brief background In quantum annealing, the discrete optimization problem we wish to solve (such as finding the minimum of $b_1b_2 - 3b_1 + 5b_3b_4$ for binary variables $b_i$) may have a ...
user1271772's user avatar
  • 13.5k
14 votes
3 answers
2k views

Are spin-glass problems NP (-complete)?

It is well known that finding ground states for spin-glass systems (Ising, XY...) is NP-hard (at least as hard as the hardest NP-problems) so that they can be efficiently used to solve other NP ...
Wouter's user avatar
  • 253
2 votes
1 answer
189 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}]...
heromano's user avatar
  • 525
1 vote
2 answers
67 views

In quantum adiabatic simulation, is the $s$ in $(1-\frac{s}{T})H_{in}+\frac{s}{T} H_{cl}$ related to the $t$ in $e^{-iHt}$?

I just want to do a whole adiabatic calculation on quantum circuit. To prepare two Hamiltonian of $H_{initial}$ and $H_{classical}$ and solve $H_{classical}$ using adiabatic calc like quantum ...
yumin's user avatar
  • 11
9 votes
3 answers
869 views

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 ...
Dr. Prasanna Date's user avatar
4 votes
0 answers
182 views

D-WAVE QUBO Matrix Form

I am trying to write down this problem (friend/enemy graph) in a polynomial matrix form in order to understand quantum annealing better, but it seems like the problem should actually be split into ...
pars3c's user avatar
  • 41