相关论文: Statistical Quantum Phase Estimation: Extensions a…

We propose an approach to measure the quantum phase of an electron in a non-Abelian system using the algorithm of Quantum Phase Estimation (QPE). The discrete-path systems were previously studied in the context of square or rectangular…

In this work we investigate a binned version of Quantum Phase Estimation (QPE) set out by [Somma 2019] and known as the Quantum Eigenvalue Estimation Problem (QEEP). Specifically, we determine whether the circuit decomposition techniques we…

While quantum algorithms for simulation exhibit better asymptotic scaling than their classical counterparts, they currently cannot be implemented on real-world devices. Instead, chemists and computer scientists rely on costly classical…

This paper introduces the first quantum computing framework for Stochastic Quantum Power Flow (SQPF) analysis in power systems. The proposed method leverages quantum states to encode power flow distributions, enabling the use of Quantum…

Starting from the Quantum-Phase-Estimate (QPE) algorithm, a method is proposed to construct entangled states that describe correlated many-body systems on quantum computers. Using operators for which the discrete set of eigenvalues is…

The quantum phase estimation (QPE) is one of the fundamental algorithms based on the quantum Fourier transform. It has applications in order-finding, factoring, and finding the eigenvalues of unitary operators. The major challenge in…

We present a scalable formal verification methodology for Quantum Phase Estimation (QPE) circuits. Our approach uses a symbolic qubit abstraction based on quantifier-free bit-vector logic, capturing key quantum phenomena, including…

Quantum phase estimation (QPE) plays a pivotal role in many quantum algorithms, offering provable speedups in applications such as Shor's factoring algorithm. While fault-tolerant quantum algorithms for combinatorial and Hamiltonian…

We develop a quantum version of the probability estimation framework [arXiv:1709.06159] for randomness generation with quantum side information. We show that most of the properties of probability estimation hold for quantum probability…

Dynamical response functions are fundamental quantities to describe the excited-state properties in quantum many-body systems. Quantum algorithms have been proposed to evaluate these quantities by means of quantum phase estimation (QPE),…

In this work we present a detailed analysis of variational quantum phase estimation (VQPE), a method based on real-time evolution for ground and excited state estimation on near-term hardware. We derive the theoretical ground on which the…

Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $\epsilon$ in Heisenberg-limited time $T=\Theta(1/\epsilon)$. Standard gate-based implementations of QPE require…

Subspace diagonalisation methods have appeared recently as promising means to access the ground state and some excited states of molecular Hamiltonians by classically diagonalising small matrices, whose elements can be efficiently obtained…

Quantum Phase Estimation (QPE) is a cornerstone algorithm for fault-tolerant quantum computation, especially for electronic structure calculations of chemical systems. To accommodate the diverse characteristics of quantum chemical systems,…

We present an extension of many-body downfolding methods to reduce the resources required in the quantum phase estimation (QPE) algorithm. In this paper, we focus on the Schrieffer--Wolff (SW) transformation of the electronic Hamiltonians…

While Quantum phase estimation (QPE) is at the core of many quantum algorithms known to date, its physical implementation (algorithms based on quantum Fourier transform (QFT)) is highly constrained by the requirement of high-precision…

Many-body techniques based on the double unitary coupled cluster ansatz (DUCC) can be used to downfold electronic Hamiltonians into low-dimensional active spaces. It can be shown that the resulting dimensionality reduced Hamiltonians are…

A major thrust in quantum algorithm development over the past decade has been the search for the quantum algorithms that will deliver practical quantum advantage first. Today's quantum computers - and even early fault-tolerant quantum…

Recent experimental breakthroughs have signalled the imminent arrival of the early fault-tolerant era. However, for a considerable period in the foreseeable future, relying solely on quantum error correction for full error suppression will…

The preparation of Hamiltonian eigenstates is essential for many applications in quantum computing; the efficiency with which this can be done is of key interest. A canonical approach exploits the quantum phase estimation (QPE) algorithm.…