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
0answers
16 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 ...
2
votes
1answer
41 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 ...
2
votes
0answers
35 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 ...
1
vote
1answer
108 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 ...
1
vote
1answer
30 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 ...
3
votes
0answers
32 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 ...
4
votes
0answers
39 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 ...
1
vote
1answer
36 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 ...
3
votes
0answers
25 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, ...
4
votes
1answer
70 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 ...
3
votes
1answer
36 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 ...
3
votes
1answer
76 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 ...
2
votes
0answers
41 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 ...
11
votes
3answers
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 ...
1
vote
1answer
150 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}]...
1
vote
2answers
51 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 ...
6
votes
2answers
123 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 ...
3
votes
0answers
48 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 ...
4
votes
1answer
171 views

Can QAOA be considered as simulation of a quantum annealer on a gate-based quantum computer?

Quantum annealers are single purpose machines allowing to solve quadratic unconstrained binary optimization (QUBO) problems. QUBO problems have following objective function: $$ F=-\sum_{i<j}J_{ij}...
4
votes
0answers
43 views

Is either the adiabatic or the diabatic version of quantum annealing known to be theoretically more powerful than the other?

Quantum annealing can be considered either in the perfectly adiabatic "slow" limit (in which case it's usually referred as "adiabatic quantum computing" (AQC) instead of "...
1
vote
0answers
42 views

Is it absolutely necessary for Hamiltonians to not commute in QAA?

I have already read through the answers here. So I understand that if the Hamiltonians commute, then they have the same eigenstates but not necessarily the same energy eigenvalues. To formulate my ...
3
votes
2answers
335 views

What is an example of a simple QUBO problem?

I am digging into to the workings of the D-wave quantum annealing computers using this documentation. I find it very intuitive and well-explained, but their example of a "simple QUBO problem" does not ...
2
votes
0answers
104 views

How to convert a qubit hamiltonian to QUBO and vice versa?

This is my hamiltonian. Solving this by hand, Numpy Python package and VQE algorithm gives the minimum energy eigenvalue -2. If we want to find the minimum energy of this hamiltonian with Quantum ...
3
votes
1answer
70 views

Best route to learn quantum annealing as a beginner

My main goal is to learn Quantum annealing and quantum optimization in general. This concept is elaborated in this paper. A better example is this paper. I am particularly interested in reading ...
1
vote
1answer
86 views

Quantum Annealing - Random results on big N

I implemented a solver for the Job Shop Problem, based on quantum annealing, on a D-Wave machine. I have a problem, that even though minimal energy solutions exist, they are only chosen once. I set ...
2
votes
1answer
69 views

Quantum Annealing - Job Shop Problem

using this paper, I want to implement a solution for the Job Shop Problem on a D-Wave machine. One of the constraints mentioned in the paper, is $$ h_3(\bar{x}) = \sum_i \left(\sum_t x_{i,t}-1 \right)^...
1
vote
0answers
28 views

Entanglement and teleportation in quantum annealing and parallel computation

In classical optimization problems, some objective function's surface serves as a landscape for finding its minimum through minimization algorithms. Instead of your typical U-shaped objective ...
5
votes
0answers
46 views

Max eigenvalue algorithm via annealing starting from Gibbs state

In this talk, and the corresponding slides on page 24/44, Brandao talks about the max eigenvalue problem which is: Given a Hermitian $n\times n$ matrix $H$, approximate its largest eigenvalue. (Note ...
1
vote
1answer
119 views

Minimum Spanning Tree on D Wave Processor

I am attempting to implement a minimum spanning tree problem on the D wave quantum computing architecture. I have seen many graph problems implemented, such as a graph coloring example. There are also ...
4
votes
2answers
77 views

What does it mean to have 2000 qubits and 6016 couplers?

From official D-Wave docs: The D-Wave 2000Q QPU has up to 2048 qubits and 6016 couplers. For example, I have the optimization problem defined as the QUBO problem. If I want to solve it on D-Wave,...
3
votes
0answers
73 views

How to calculate the $r^{\text{th}}$ digit of $\sum ^{j−1}_{p=i}d^p_{\pm k}$ using PyQUBO?

I am going to implement "turn circuit encoding" method of Coarse-grained lattice protein folding on a quantum annealer(Babej, Ing & Fingerhuth; 2018) using PyQUBO to run on the DWave qbsolv ...
1
vote
1answer
53 views

Is there an inherent difference in need for error correction between quantum annealing and gate based methods?

When I read about computing using gate based methods, I mainly read about the difficulties with error rates, circuit depth (and connectivity) and not enough qubits. With computing using quantum ...
1
vote
1answer
63 views

Q1Q2Q3Q4 coupling in qubo file

According to the question Q1Q2Q3 coupling in qubo file we can couple 3 qbits. When it comes with 4 qbits like q1q2q3q4, how should set this 4-qbit element to qubo file?
1
vote
1answer
91 views

Q1Q2Q3 coupling in qubo file

When we expand the Ising model we have one component with 3 qbits like Q1Q2Q3. But in qubo file we can only set coupling for 2 qbit only. How should I set this 3-qbit element to qubo file?
1
vote
0answers
29 views

What are techniques are used to esimate the spectral properties of annealer embedding hamiltonians?

Some information about the spectral properties of the hamiltonian of a given annealer emebedding is needed to determine a proper annealing schedule, correct? What are methods that are used to find ...
4
votes
2answers
121 views

Are there established best practices for designing Dwave embeddings?

Some of my larger annealer embeddings (~200 qubits) don't anneal down to the ground state while some of them do very easily. Are there established guidelines for designing annealer embeddings to ...
1
vote
1answer
601 views

Can quantum annealing be used for training convolutional neural networks?

Simulated annealing is applied for deep learning using convolutional neural networks. Likewise, can quantum annealing be used? These two papers: Simulated Annealing Algorithm for Deep Learning (...
5
votes
1answer
218 views

When and where was the first use of the term Chimera?

This is along the same lines as the earlier question: When was the first use of the word Entanglement? I was surprised to discover that when searching for "chimera" in both of Vicky Choi's minor-...
8
votes
2answers
404 views

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 ...
8
votes
1answer
165 views

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 ...
8
votes
1answer
279 views

Adiabatic Quantum Computing vs Adiabatic Quantum Optimization vs Quantum Annealing

I am aware that of the difference of Adiabatic Quantum Computing (AQC) and Quantum Annealing (QA) as explained here. However, another term which came up in some papers was Adiabatic Quantum ...
7
votes
1answer
206 views

Gradient boosting akin to XGBoost using a quantum device

I am currently trying to implement a boosting algorithm akin to XGBoost with a quantum device. The reason is that I want to make use of a quantum device to train weak classifiers. However, as far as I ...
9
votes
2answers
1k views

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, ...
22
votes
4answers
1k views

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[...
7
votes
1answer
354 views

How can a D-Wave style Annealing QPU help sampling?

This question is a follow-up on this one, with the hope of getting more specific clues, and was motivated by this answer by user Rob. Also please note this posts that handle the topic of QA in much ...
24
votes
1answer
2k views

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 ...
20
votes
2answers
3k views

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 ...
6
votes
1answer
52 views

Assessing speed-up via Quantum-Stochastic correspondence

You can make a natural correspondence between a quantum state vector and a classical probability vector, and between a quantum unitary operator and a classical stochastic matrix. There is also a ...
10
votes
1answer
2k views

What is the difference between QAOA and Quantum Annealing?

Edward Farhi's paper on the Quantum Approximate Optimization Algorithm introduces a way for gate model quantum computers to solve combinatorial optimization algorithms. However, D-Wave style quantum ...
6
votes
1answer
227 views

Hardware wise, how does D-Wave achieve quantum annealing?

Quantum computers have shown a new way to compute old problems. D-Wave has a quantum annealer, and Wikipedia describes the D-Wave quantum computer and its use of quantum annealing properties. ...