Optimization using quantum mechanics: quantum annealing through adiabatic evolution
We review here some recent work in the field of quantum annealing, alias adiabatic
quantum computation. The idea of quantum annealing is to perform optimization by a …
quantum computation. The idea of quantum annealing is to perform optimization by a …
Quantum optimization of fully connected spin glasses
Many NP-hard problems can be seen as the task of finding a ground state of a disordered
highly connected Ising spin glass. If solutions are sought by means of quantum annealing, it …
highly connected Ising spin glass. If solutions are sought by means of quantum annealing, it …
Localization and glassy dynamics of many-body quantum systems
When classical systems fail to explore their entire configurational space, intriguing
macroscopic phenomena like aging and glass formation may emerge. Also closed quanto …
macroscopic phenomena like aging and glass formation may emerge. Also closed quanto …
Scaling advantage of chaotic amplitude control for high-performance combinatorial optimization
The development of physical simulators, called Ising machines, that sample from low energy
states of the Ising Hamiltonian has the potential to transform our ability to understand and …
states of the Ising Hamiltonian has the potential to transform our ability to understand and …
Bayes-optimal convolutional AMP
K Takeuchi - IEEE Transactions on Information Theory, 2021 - ieeexplore.ieee.org
This paper proposes Bayes-optimal convolutional approximate message-passing (CAMP)
for signal recovery in compressed sensing. CAMP uses the same low-complexity matched …
for signal recovery in compressed sensing. CAMP uses the same low-complexity matched …
Combinatorial optimization using dynamical phase transitions in driven-dissipative systems
The dynamics of driven-dissipative systems is shown to be well-fitted for achieving efficient
combinatorial optimization. The proposed method can be applied to solve any combinatorial …
combinatorial optimization. The proposed method can be applied to solve any combinatorial …
Optimization by quantum annealing: Lessons from hard satisfiability problems
The path integral Monte Carlo simulated quantum annealing algorithm is applied to the
optimization of a large hard instance of the random satisfiability problem (N= 10 000). The …
optimization of a large hard instance of the random satisfiability problem (N= 10 000). The …
Exploring the complex free-energy landscape of the simplest glass by rheology
For amorphous solids, it has been intensely debated whether the traditional view on solids,
in terms of the ground state and harmonic low energy excitations on top of it, such as …
in terms of the ground state and harmonic low energy excitations on top of it, such as …
Computational complexity for physicists
S Mertens - Computing in Science & Engineering, 2002 - ieeexplore.ieee.org
Computational complexity for physicists Page 1 MAY/JUNE 2002 31 L IMITS OF C
OMPUTATION Compared to the traditionally close rela- tionship between physics and mathe …
OMPUTATION Compared to the traditionally close rela- tionship between physics and mathe …
Relaxation and thermalization after a quantum quench: Why localization is important
S Ziraldo, GE Santoro - Physical Review B—Condensed Matter and Materials …, 2013 - APS
We study the unitary dynamics and the thermalization properties of free-fermion-like
Hamiltonians after a sudden quantum quench, extending the results of S. Ziraldo et al.[Phys …
Hamiltonians after a sudden quantum quench, extending the results of S. Ziraldo et al.[Phys …