Related papers: Energy Inference of Black-Box Quantum Computers Us…
Quantum computers have the potential to efficiently simulate large-scale quantum systems for which classical approaches are bound to fail. Even though several existing quantum devices now feature total qubit numbers of more than one…
We derive general lower energy bounds for the ground state energy of any translationally invariant quantum lattice Hamiltonian. The bounds are given by the ground state energy of renormalized Hamiltonians on finite clusters.
Hamiltonian simulation on quantum computers is strongly constrained by gate counts, motivating techniques to reduce circuit depths. While tensor networks are natural competitors to quantum computers, we instead leverage them to support…
We compare recently proposed methods to compute the electronic state energies of the water molecule on a quantum computer. The methods include the phase estimation algorithm based on Trotter decomposition, the phase estimation algorithm…
In this paper, we model and solve a fundamental power system problem, i.e., DC power flow, using a practical quantum computer. The Harrow-Hassidim-Lloyd (HHL) quantum algorithm is used to solve the DC power flow problem. The HHL algorithm…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
Quantum speed limits (QSLs) establish intrinsic bounds on the minimum time required for the evolution of quantum systems. We present a class of QSLs formulated in terms of the two-parameter Sharma-Mittal entropy (SME), applicable to…
The quantum computation of molecular response properties on near-term quantum hardware is a topic of significant interest. While computing time-domain response properties is in principle straightforward due to the natural ability of quantum…
Quantum computers are capable of calculating the energy gap of two electronic states by using the quantum phase difference estimation (QPDE) algorithm. The Bayesian inference based implementations for the QPDE have been reported so far, but…
A longstanding goal in quantum information science is to demonstrate quantum computations that cannot be feasibly reproduced on a classical computer. Such demonstrations mark major milestones: they showcase fine control over quantum systems…
We discuss quantum speed limits (QSLs) for finite-dimensional quantum systems undergoing general physical processes. These QSLs were obtained using two families of entropic measures, namely the square root of the Jensen-Shannon divergence,…
We investigate if physical laws can impose limit on computational time and speed of a quantum computer built from elementary particles. We show that the product of the speed and the running time of a quantum computer is limited by the type…
Most implementations of quantum gate operations rely on external control fields to drive the evolution of the quantum system. Generating these control fields requires significant efforts to design the suitable control Hamiltonians.…
Many optimally scaling quantum simulation algorithms employ controlled time evolution of the Hamiltonian, which is typically the major bottleneck for their efficient implementation. This work establishes a compression protocol for encoding…
The speed of evolution between perfectly distinguishable states is thoroughly analyzed in a closed three-level (qutrit) quantum system. Considering an evolution under an arbitrary time-independent Hamiltonian, we fully characterize the…
Quantum cycles in established heat engines can be modeled with various quantum systems as working substances. For example, a heat engine can be modeled with an infinite potential well as the working substance to determine the efficiency and…
Quantum computers offer an intriguing path for a paradigmatic change of computing in the natural sciences and beyond, with the potential for achieving a so-called quantum advantage, namely a significant (in some cases exponential) speed-up…
We measure and quantify non-Markovian effects in IBM's Quantum Experience. Specifically, we analyze the temporal correlations in a sequence of gates by characterizing the performance of a gate conditioned on the gate that preceded it. With…
We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. Assuming access to a block-encoding of $H'=(H-E)/\lambda$ for some $E \in \mathbb R$, the goal is to implement an…
This paper explores the use of quantum computing, specifically the use of HHL and VQLS algorithms, to solve optimal power flow problem in electrical grids. We investigate the effectiveness of these quantum algorithms in comparison to…