Excited state search using quantum annealing

Abstract

Quantum annealing (QA) is one of the ways to search the ground state of the problem Hamiltonian. Here, we propose the QA scheme to search arbitrary excited states of the problem Hamiltonian. In our scheme, an $n$-th excited state of the trivial Hamiltonian is initially prepared and is adiabatically changed into an $n$-th excited state of the target Hamiltonian. Although our scheme is general such that we can search any excited states, we especially discuss the first excited state search in this paper. As a comparison, we consider a non-adiabatic scheme to find the first excited state with non-adiabatic transitions from the ground state. By solving the Lindblad master equation, we evaluate the performance of each scheme under the influence of decoherence. Our conclusion is that the adiabatic scheme show better performance than the non-adiabatic scheme as long as the coherence time of qubits is sufficiently long. These results are important for applications in the area of quantum chemistry, quantum simulation, and post-quantum cryptography.

arXiv comment18 pages, 11 figures

References in corpus (29)

• Quantum Annealing in the Transverse Ising Model
• QuTiP 2: A Python framework for the dynamics of open quantum systems
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Quantum computational chemistry
• Fermionic quantum computation
• Quantum Annealing and Analog Quantum Computation
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Digitized adiabatic quantum computing with a superconducting circuit
• Variational Quantum Computation of Excited States
• Bounds for the adiabatic approximation with applications to quantum computation
• Subspace-search variational quantum eigensolver for excited states
• Variational quantum algorithms for discovering Hamiltonian spectra
• 3D integrated superconducting qubits
• Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network: Toward quantum soft computing
• Adiabatic Quantum Simulation of Quantum Chemistry
• Entanglement properties of multipartite entangled states under the influence of decoherence
• Quantum Speedup by Quantum Annealing
• Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
• Tunneling and speedup in quantum optimization for permutation-symmetric problems
• Exponential Speedup of Quantum Annealing by Inhomogeneous Driving of the Transverse Field
• Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
• Demonstration of Adiabatic Variational Quantum Computing with a Superconducting Quantum Coprocessor
• Toward Practical-Scale Quantum Annealing Machine for Prime Factoring
• Calculation of molecular vibrational spectra on a quantum annealer
• Exploring More-Coherent Quantum Annealing
• Not-so-adiabatic quantum computation for the shortest vector problem
• Necessary Adiabatic Run Times in Quantum Optimization
• Superconducting Quantum Annealing Architecture with LC Resonators
• Quantum annealing with capacitive-shunted flux qubits

Cited by in corpus (3)

• Analysis of the shortest vector problems with the quantum annealing to search the excited states
• Correspondence between excited energy eigenstates and local minima of energy landscape in quantum spin systems
• A combined quantum-classical method applied to material design: optimization and discovery of photochromic materials for photopharmacology applications