Spatial Ising machine: photonic acceleration and adiabatic evolution

2021 ◽  
Author(s):  
Claudio Conti
Keyword(s):  
Adiabatic Evolution

scholarly journals Sequential suppression of quarkonia and high-energy nucleus–nucleus collisions

2015 ◽  
Vol 30 (37) ◽  
pp. 1550205 ◽  
Author(s):  
Nirupam Dutta ◽  
Nicolas Borghini
Keyword(s):  
High Energy ◽  
Heavy Quarkonia ◽  
Adiabatic Evolution ◽  
Nuclear Collisions

According to the usual application of the sequential-suppression picture to the dynamics of heavy quarkonia in the hot medium formed in ultrarelativistic nuclear collisions, quark–antiquark pairs created in a given bound or unbound state remain in that same state as the medium evolves. We argue that this scenario implicitly assumes an adiabatic evolution of the quarkonia and we show that the validity of the adiabaticity assumption is questionable.

scholarly journals Fast adiabatic evolution by oscillating initial Hamiltonians

2018 ◽  
Vol 98 (4) ◽  
Author(s):  
Francesco Petiziol ◽  
Benjamin Dive ◽  
Florian Mintert ◽  
Sandro Wimberger
Keyword(s):  
Adiabatic Evolution

scholarly journals Engineering Reflective Metasurfaces with Ising Hamiltonian and Quantum Annealing

2021 ◽  
Author(s):  
Zhen Peng ◽  
Charles Ross ◽  
Qi Jian Lim ◽  
Gabriele Gradoni
Keyword(s):  
Cross Section ◽  
Mobile Networks ◽  
Ground State ◽  
Energy Minimization ◽  
Phase Modulation ◽  
Optimization Problem ◽  
Ground State Solution ◽  
Quantum Annealing ◽  
Adiabatic Evolution ◽  
Annealing Algorithms

<div><div><div><p>We present a novel and flexible method to optimize the phase response of reflective metasurfaces towards a desired scattering profile. The scattering power is expressed as a spin-chain Hamiltonian using the radar cross section formalism. For metasurfaces reflecting an oblique plane wave, an Ising Hamiltonian is obtained. Thereby, the problem of achieving the scattering profile is recast into finding the ground-state solution of the associated Ising Hamiltonian. To rapidly explore the configuration states, we encode the Ising coefficients with quantum annealing algorithms, taking advantage of the fact that the adiabatic evolution efficiently performs energy minimization in the Ising model. Finally, the optimization problem is solved on the D-Wave 2048-qubit quantum adiabatic optimizer machine for binary phase as well as quadriphase reflective metasurfaces. Even though the work is focused on the phase modulation of metasurfaces, we believe this approach paves the way to fast optimization of reconfigurable intelligent surfaces that are mod- ulated in both amplitude and phase for multi-beam generation in and beyond 5G/6G mobile networks.</p></div></div></div>

Generalized quantum partial adiabatic evolution

2013 ◽  
Vol 13 (4) ◽  
pp. 909-916
Author(s):  
Jie Sun ◽  
Songfeng Lu ◽  
Fang Liu
Keyword(s):  
Adiabatic Evolution

scholarly journals Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor

2005 ◽  
Vol 177 (2) ◽  
pp. 285-298 ◽  
Author(s):  
Avik Mitra ◽  
Arindam Ghosh ◽  
Ranabir Das ◽  
Apoorva Patel ◽  
Anil Kumar
Keyword(s):  
Quantum Information ◽  
Adiabatic Evolution ◽  
Experimental Implementation ◽  
Evolution Algorithms

On the General Class of Models of Adiabatic Evolution

2016 ◽  
Vol 23 (03) ◽  
pp. 1650016 ◽  
Author(s):  
Jie Sun ◽  
Songfeng Lu ◽  
Fang Liu
Keyword(s):  
Ground State ◽  
General Class ◽  
Time Complexity ◽  
State Energy ◽  
Search Problem ◽  
Quantum Search ◽  
Final States ◽  
Adiabatic Evolution ◽  
Speed Up ◽  
Effective Use

The general class of models of adiabatic evolution was proposed to speed up the usual adiabatic computation in the case of quantum search problem. It was shown [8] that, by temporarily increasing the ground state energy of a time-dependent Hamiltonian to a suitable quantity, the quantum computation can perform the calculation in time complexity O(1). But it is also known that if the overlap between the initial and final states of the system is zero, then the computation based on the generalized models of adiabatic evolution can break down completely. In this paper, we find another severe limitation for this class of adiabatic evolution-based algorithms, which should be taken into account in applications. That is, it is still possible that this kind of evolution designed to deal with the quantum search problem fails completely if the interpolating paths in the system Hamiltonian are chosen inappropriately, while the usual adiabatic evolutions can do the same job relatively effectively. This implies that it is not always recommendable to use nonlinear paths in adiabatic computation. On the contrary, the usual simple adiabatic evolution may be sufficient for effective use.

Sign in / Sign up

Export Citation Format

Share Document