Related papers: Simulation of adiabatic quantum computing for mole…
Adiabatic Rapid Passage (ARP) is a powerful technique for efficient transfer of population between quantum states. In the lab, the efficiency of ARP is often limited by noise on either the energies of the states or the frequency of the…
We analyze the performance of adiabatic quantum computation (AQC) under the effect of decoherence. To this end, we introduce an inherently open-systems approach, based on a recent generalization of the adiabatic approximation. In contrast…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
We propose a general scheme for dissipatively preparing arbitrary pure quantum states on a multipartite qubit register in a finite number of basic control blocks. Our "splitting-subspace" approach relies on control resources that are…
We present a method for accelerating adiabatic protocols for systems involving a coupling to a continuum, one that cancels both non-adiabatic errors as well as errors due to dissipation. We focus on applications to a generic quantum state…
The ability to efficiently infer system parameters is essential in any signal-processing task that requires fast operation. Dealing with quantum systems, a serious challenge arises due to substantial growth of the underlying Hilbert space…
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The…
Nonequilibrium dynamics of quantum many-body systems is challenging for classical computing, providing opportunities for demonstrating practical quantum computational advantage with analogue quantum simulators. Owing to the intimate…
The efficient preparation of quantum states is an important step in the execution of many quantum algorithms. In the noisy intermediate-scale quantum (NISQ) computing era, this is a significant challenge given quantum resources are scarce…
The control and manipulation of quantum systems without excitation is challenging, due to the complexities in fully modeling such systems accurately and the difficulties in controlling these inherently fragile systems experimentally. For…
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient…
In quantum information processing, the development of fast and robust control schemes remains a central challenge. Although quantum adiabatic evolution is inherently robust against control errors, it typically demands long evolution times.…
We show that it is possible to use a classical computer to efficiently simulate the adiabatic evolution of a quantum system in one dimension with a constant spectral gap, starting the adiabatic evolution from a known initial product state.…
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…
Reliable preparation of many-body ground states is an essential task in quantum computing, with applications spanning areas from chemistry and materials modeling to quantum optimization and benchmarking. A variety of approaches have been…
Macroscopic cat states have been widely studied to illustrate fundamental principles of quantum physics as well as their application in quantum information processing. In this paper, we propose a quantum speedup method for adiabatic…
While dissipation has traditionally been viewed as an obstacle to quantum coherence, it is increasingly recognized as a powerful computational resource. Dissipative protocols can prepare complex many-body quantum states by leveraging…
Calculating the molecular ground-state energy is a central challenge in computational chemistry. Conventional methods such as the Complete Active Space Configuration Interaction scale exponentially with molecular size, limiting their…
The quantum adiabatic theorem ensures that a slowly changing system, initially prepared in its ground state, will evolve to its final ground state with arbitrary precision. As a first result this thesis extends the original theorem to…
Validity conditions for the adiabatic approximation are useful tools to understand and predict the quantum dynamics. Remarkably, the resonance phenomenon in oscillating quantum systems has challenged the adiabatic theorem. In this scenario,…