Related papers: Probabilistic Eigensolver with a Trapped-Ion Quant…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…
The hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…
We present a route towards the quantum simulation of exotic quantum magnetism in ion traps by exploiting dual relations between different spin models. Our strategy allows one to start from Hamiltonians that can be realized with current…
We propose a quantum algorithm for solving the following problem: given the Hamiltonian of a physical system and one of its eigenvalues, how to obtain the corresponding eigenstate? The algorithm is based on the resonance phenomena. For a…
Dipolar coupled homonuclear spins present challenging, yet useful systems for quantum information processing. In such systems, eigenbasis of the system Hamiltonian is the appropriate computational basis and coherent control can be achieved…
Quantum simulators with hundreds of qubits and engineerable Hamiltonians have the potential to explore quantum many-body models that are intractable for classical computers. However, learning the simulated Hamiltonian, a prerequisite for…
We show that it is possible to uniquely reconstruct a generic many-body local Hamiltonian from a single pair of initial and final states related by time evolution with the Hamiltonian. We then propose a practical version of the protocol…
One of the goals in quantum simulation is to adiabatically generate the ground state of a complicated Hamiltonian by starting with the ground state of a simple Hamiltonian and slowly evolving the system to the complicated one. If the…
Solving for molecular excited states remains one of the key challenges of modern quantum chemistry. Traditional methods are constrained by existing computational capabilities, limiting the complexity of the molecules that can be studied or…
Computing the excited states of a given Hamiltonian is computationally hard for large systems, but methods that do so using quantum computers scale tractably. This problem is equivalent to the PCA problem where we are interested in…
Hamiltonian simulation is a promising application for quantum computers to achieve a quantum advantage. We present classical algorithms based on tensor network methods to optimize quantum circuits for this task. We show that, compared to…
We explore the feasibility of gate-based hybrid quantum computing using both discrete (qubit) and continuous (qumode) variables on trapped-ion platforms. Trapped-ion systems have demonstrated record one- and two-qubit gate fidelities and…
Quantum simulators offer the potential to utilize the quantum nature of a physical system to study another physical system. In contrast to conventional simulation, which experiences an exponential increase in computational complexity,…
A method is presented in which the ground-state subspace is projected out of a Hamiltonian representation. As a result of this projection, an effective Hamiltonian is constructed where its ground-state coincides with an excited-state of the…
Solving Hamiltonian matrix is a central task in quantum many-body physics and quantum chemistry. Here we propose a novel quantum algorithm named as a quantum Heaviside eigen solver to calculate both the eigen values and eigen states of the…
Quantum computers hold the promise to solve certain computational task much more efficiently than classical computers. We review the recent experimental advancements towards a quantum computer with trapped ions. In particular, various…
We present a novel method for improving the quantum simulation of the ground state energy of molecules. We perform a pre-processing step classically, which reduces the dimensionality of the problem by generating a custom mapping which…
Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure…
Quantum computers have been shown to have tremendous potential in solving difficult problems in quantum chemistry. In this paper, we propose a new classical quantum hybrid method, named as power of sine Hamiltonian operator (PSHO), to…
We study necessary conditions for the efficient simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues and based on the algebraic-geometric invariants introduced in [1-2]. Our results indicate…