Related papers: Quantum Zeno approach for molecular energies with …
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between states and thus play the same role as thermal…
Variational methods have offered controllable and powerful tools for capturing many-body quantum physics for decades. The recent introduction of expressive neural network quantum states has enabled the accurate representation of a broad…
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
Berry's approach on "transitionless quantum driving" shows how to set a Hamiltonian which drives the dynamics of a system along instantaneous eigenstates of a reference Hamiltonian to reproduce the same final result of an adiabatic process…
Quantum annealing (QA) is a method for solving combinatorial optimization problems. We can estimate the computational time for QA using the adiabatic condition. The adiabatic condition consists of two parts: an energy gap and a transition…
We formulate a novel ground state quantum computation approach that requires no unitary evolution of qubits in time: the qubits are fixed in stationary states of the Hamiltonian. This formulation supplies a completely time-independent…
A model for quantum Zeno effect based upon an effective Schr\"odinger equation originated by the path-integral approach is developed and applied to a two-level system simultaneously stimulated by a resonant perturbation. It is shown that…
Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Practical applications require development of quantum algorithms with reduced resource requirements.…
We describe a quantum algorithm that solves combinatorial optimization problems by quantum simulation of a classical simulated annealing process. Our algorithm exploits quantum walks and the quantum Zeno effect induced by evolution…
Neural network approaches to approximate the ground state of quantum hamiltonians require the numerical solution of a highly nonlinear optimization problem. We introduce a statistical learning approach that makes the optimization trivial by…
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…
We propose a new design heuristic to tackle combinatorial optimisation problems, inspired by Hamiltonians for optimal state-transfer. The result is a rapid approximate optimisation algorithm. We provide numerical evidence of the success of…
We propose a nonadiabatic approach to quantum annealing, in which we repeat quantum annealing in nonadiabatic time scales, and collect the final states of many realizations to find the ground state among them. In this way, we replace the…
Frequent applications of a mixing quantum operation to a quantum system slow down its time evolution and eventually drive it into the invariant subspace of the named operation. We prove this phenomenon, the quantum Zeno effect, and its…
Hamiltonian simulation is a domain where quantum computers have the potential to outperform their classical counterparts. One of the main challenges of such quantum algorithms is increasing the system size, which is necessary to achieve…
We investigate the quantum Zeno effect as a framework for designing and analyzing quantum algorithms for Hamiltonian simulation. We show that frequent projective measurements of an ancilla qubit register can be used to simulate quantum…
Hybrid quantum-classical algorithms have been proposed as a potentially viable application of quantum computers. A particular example - the variational quantum eigensolver, or VQE - is designed to determine a global minimum in an energy…
We argue the feasibility to study the phase structure of a quantum physical system on quantum devices via adiabatic preparation of states. We introduce a novel method and successfully test it in application to the Schwinger model in the…
We devise a quantum-circuit algorithm to solve the ground state and ground energy of artificial graphene. The algorithm implements a Trotterized adiabatic evolution from a purely tight-binding Hamiltonian to one including kinetic,…