Related papers: Excited-State Adiabatic Quantum Computation Starte…
We introduce two methods for speeding up adiabatic quantum computations by increasing the energy between the ground and first excited states. Our methods are even more general. They can be used to shift a Hamiltonian's density of states…
Adiabatic process has found many important applications in modern physics, the distinct merit of which is that it does not need accurate control over the timing of the process. However, it is a slow process, which limits the application in…
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'. This approach provides intriguing links…
I show how to protect adiabatic quantum computation (AQC) against decoherence and certain control errors, using a hybrid methodology involving dynamical decoupling, subsystem and stabilizer codes, and energy gaps. Corresponding error bounds…
We demonstrate that, rather than resorting to high-cost dynamic correlation methods, qualitative failures in excited-state potential energy surface predictions can often be remedied at no additional cost by ensuring that optimal molecular…
Properly designed control has been shown to be particularly advantageous for improving AQC accuracy and time complexity scaling. Here, an \emph{in situ} quantum control optimization protocol is developed to indirectly optimize state…
Adiabatic time evolution of quantum systems is a widely used tool with applications ranging from state preparation through simplifications of computations and topological transformations to optimization and quantum computing. Adiabatic time…
Ultrastrongly coupled quantum hardware may increase the speed of quantum state processing in distributed architectures, allowing to approach fault-tolerant threshold. We show that circuit QED architectures in the ultrastrong coupling…
Quantum adiabatic transfer is widely used in quantum computation and quantum simulation. However, the transfer speed is limited by the quantum adiabatic approximation condition, which hinders its application in quantum systems with a short…
Adiabatic quantum computing~(AQC) is based on the adiabatic principle, where a quantum system remains in an instantaneous eigenstate of the driving Hamiltonian. The final state of the Hamiltonian encodes solution to the problem of interest.…
Quantum computers with Kerr-nonlinear parametric oscillators (KPOs) have recently been proposed by the author and others. Quantum computation using KPOs is based on quantum adiabatic bifurcations of the KPOs, which lead to quantum…
We introduce a novel computational framework for excited-states molecular quantum dynamics simulations driven by quantum computing-based electronic-structure calculations. This framework leverages the fewest-switches surface-hopping method…
Quantum state preparation through external control is fundamental to established methods in quantum information processing and in studies of dynamics. In this respect, excitons in semiconductor quantum dots (QDs) are of particular interest…
We investigate the computational power of creating steady-states of quantum dissipative systems whose evolution is governed by time-independent and local couplings to a memoryless environment. We show that such a model allows for efficient…
Quantum optimization is the most mature quantum computing technology to date, providing a promising approach towards efficiently solving complex combinatorial problems. Methods such as adiabatic quantum computing (AQC) have been employed in…
The computation of excited electronic states is an important application for quantum computers. In this work, we simulate the excited state spectra of four aromatic heterocycles on IBM superconducting quantum computers, focusing on active…
We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is…
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…
Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation…
The prediction of electronic structure for strongly correlated molecules represents a promising application for near-term quantum computers. Significant attention has been paid to ground state wavefunctions, but excited states of molecules…