We study the effect of the anneal path control per qubit, a new user control feature offered on the D-Wave 2000Q quantum annealer, on the performance of quantum annealing for solving optimization problems by numerically solving the timedependent Schr ¨odinger equation for the time-dependent Hamiltonian modeling the annealing problems. The anneal path control is thereby modeled as a modified linear annealing scheme, resulting in an advanced and retarded scheme. The considered optimization problems are 2-SAT problems with 12 Boolean variables, a known unique ground state and a highly degenerate first excited state. We show that adjustment of the anneal path control can result in a widening of the minimal spectral gap by one or two orders of m...
Abstract. Discrete combinatorial optimization consists in finding the optimal configuration that min...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
Quantum annealing is a quantum version of classical simulated annealing, but using quantum fluctuati...
In recent years, quantum annealing has gained the status of being a promising candidate for solving ...
We review here some recent work in the field of quantum annealing, alias adiabatic quantum computati...
In recent years, quantum annealing has gained the status of being a promising candidate for solving ...
The path integral Monte Carlo simulated quantum annealing algorithm is applied to the optimization o...
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which pro...
The study of optimal control of quantum annealing by modulating the pace of evolution and by introdu...
To date, conventional computers have never been able to efficiently handle certain tasks, where the ...
Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a g...
In many real-life situations in engineering (and in other disciplines), we need to solve an optimiza...
The observation of an unequivocal quantum speedup remains an elusive objective for quantum computing...
Quantum annealers provide a promising approach for solving optimization problems.The theory of quant...
Abstract. Discrete combinatorial optimization consists in finding the optimal configuration that min...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
Quantum annealing is a quantum version of classical simulated annealing, but using quantum fluctuati...
In recent years, quantum annealing has gained the status of being a promising candidate for solving ...
We review here some recent work in the field of quantum annealing, alias adiabatic quantum computati...
In recent years, quantum annealing has gained the status of being a promising candidate for solving ...
The path integral Monte Carlo simulated quantum annealing algorithm is applied to the optimization o...
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which pro...
The study of optimal control of quantum annealing by modulating the pace of evolution and by introdu...
To date, conventional computers have never been able to efficiently handle certain tasks, where the ...
Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a g...
In many real-life situations in engineering (and in other disciplines), we need to solve an optimiza...
The observation of an unequivocal quantum speedup remains an elusive objective for quantum computing...
Quantum annealers provide a promising approach for solving optimization problems.The theory of quant...
Abstract. Discrete combinatorial optimization consists in finding the optimal configuration that min...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-...