Quantum annealing with Jarzynski equality
From MaRDI portal
Abstract: We show a practical application of an well-known nonequilibrium relation, the Jarzynski equality, in quantum computation. Its implementation may open a way to solve combinatorial optimization problems, minimization of a real single-valued function, cost function, with many arguments. It has been disclosed that the ordinary quantum computational algorithm to solve a kind of hard optimization problems, has a bottleneck that its computational time is restricted to be extremely slow without relevant errors. However, by our novel strategy shown in the present study, we might overcome such a difficulty.
Recommendations
Cites work
Cited in
(5)- Non-Hermitian quantum annealing in the antiferromagnetic Ising chain
- A quantum analogue of the Jarzynski equality.
- Proposal of a checking parameter in the simulated annealing method applied to the spin Glass model
- On the treatment of thermal and quantum annealing by stochastic variational means
- Simulated annealing and quantum detailed balance
This page was built for publication: Quantum annealing with Jarzynski equality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q546988)