Related papers: Non-Hermitian Adiabatic Quantum Optimization
Hamiltonian simulations are key subroutines in adiabatic quantum computation, quantum control, and quantum many-body physics, where quantum dynamics often happen in the low-energy sector. In contrast to time-independent Hamiltonian…
We review the proposal of a quantum algorithm for Hilbert's tenth problem and provide further arguments towards the proof that: (i) the algorithm terminates after a finite time for any input of Diophantine equation; (ii) the final ground…
A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of…
For a T-periodic non-Hermitian Hamiltonian H(t), we construct a class of adiabatic cyclic states of period T which are not eigenstates of the initial Hamiltonian H(0). We show that the corresponding adiabatic geometric phase angles are real…
In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum phase transitions and small gaps due to…
Dissipation in open systems enriches the possible symmetries of the Hamiltonians beyond the Hermitian framework allowing the possibility of novel non-Hermitian topological phases, which exhibit long-living end states that are protected…
A condition on the Hamiltonian of a time-dependent quantum mechanical system is derived which, if satisfied, implies optimal adiabaticity (defined below). The condition is expressed in terms of the Hamiltonian and in terms of the evolution…
Engineering quantum bath networks through non-Hermitian subsystem Hamiltonians has recently emerged as a promising strategy for qubit cooling, state stabilization, and fault-tolerant quantum computation. However, scaling these systems while…
Estimating the ground-state energy of Hamiltonians is a fundamental task for which it is believed that quantum computers can be helpful. Several approaches have been proposed toward this goal, including algorithms based on quantum phase…
Among various algorithms designed to exploit the specific properties of quantum computers with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to find the minimal value of an arbitrary cost function…
The time-dependent pseudo-Hermitian formulation of quantum mechanics allows to study open system dynamics in analogy to Hermitian quantum systems. In this setting, we show that the notion of holonomic quantum computation can equally be…
A possible method to investigate non-Hermitian Hamiltonians is suggested through finding a Hermitian operator $\eta_+$ and defining the annihilation and creation operators to be $\eta_+$-pseudo-Hermitian adjoint to each other. The operator…
Advances in quantum algorithms suggest a tentative scaling advantage on certain combinatorial optimization problems. Recent work, however, has also reinforced the idea that barren plateaus render variational algorithms ineffective on large…
Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian realized with a finite -- and currently small -- number of…
Quantum adiabatic processes -that keep constant the populations in the instantaneous eigenbasis of a time-dependent Hamiltonian- are very useful to prepare and manipulate states, but take typically a long time. This is often problematic…
Standard quantum mechanics predicts the non-conservation of state norms and probability when the fundamental requirement of the Hermiticity of the Hamiltonian is relaxed. Biorthogonal quantum mechanics, or the more general metric formalism,…
The present work contains a review of some of the work we have done on complex action or non-Hermitian Hamiltonian theory, especially the result that the anti-Hermitian part of the Hamiltonian functions by determining the actual solution to…
A computation in adiabatic quantum computing is implemented by traversing a path of nondegenerate eigenstates of a continuous family of Hamiltonians. We introduce a method that traverses a discretized form of the path: At each step we apply…
We apply a quantum adiabatic evolution algorithm to a combinatorial optimization problem where the cost function depends entirely on the of the number of unit bits in a n-bit string (Hamming weight). The solution of the optimization problem…
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to…