Related papers: Two Variations of Quantum Phase Estimation for Red…
We revisit quantum phase estimation algorithms for the purpose of obtaining the energy levels of many-body Hamiltonians and pay particular attention to the statistical analysis of their outputs. We introduce the mean phase direction of the…
We propose a novel quantum algorithm for solving nuclear resonances, which is based on the iterative Harrow-Hassidim-Lloyd algorithm and eigenvector continuation with complex scaling. To validate this approach, we compute the resonant…
In this work, we develop a highly efficient representation of functions and differential operators based on Fourier analysis. Using this representation, we create a variational hybrid quantum algorithm to solve static, Schr\"odinger-type,…
Many researchers have been heavily investigated on quantum phase estimation (QPE) algorithms to find the unknown phase, since QPE is the core building block of the most quantum algorithms such as the Shor's factoring algorithm, quantum…
Solving linear systems of equations plays a fundamental role in numerous computational problems from different fields of science. The widespread use of numerical methods to solve these systems motivates investigating the feasibility of…
In this paper, we propose two strategies for decreasing the error of arbitrary single-mode Gaussian transformations implemented using one-way quantum computation on a four-node linear cluster state. We show that it is possible to minimize…
Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one can sometimes improve upon those results with optimized…
The Quantum Phase Difference Estimation (QPDE) algorithm, as an extension of the Quantum Phase Estimation (QPE), is a quantum algorithm designed to compute the differences of two eigenvalues of a unitary operator by exploiting the quantum…
This paper discusses the compilation, optimization, and error mitigation of quantum algorithms, essential steps to execute real-world quantum algorithms. Quantum algorithms running on a hybrid platform with QPU and CPU/GPU take advantage of…
The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient…
We adapt the robust phase estimation algorithm to the evaluation of energy differences between two eigenstates using a quantum computer. This approach does not require controlled unitaries between auxiliary and system registers or even a…
Quantum error correction plays an important role in fault-tolerant quantum information processing. It is usually difficult to experimentally realize quantum error correction, as it requires multiple qubits and quantum gates with high…
We discuss the implementation of an iterative quantum phase estimation algorithm, with a single ancillary qubit. We suggest using this algorithm as a benchmark for multi-qubit implementations. Furthermore we describe in detail the smallest…
Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or thousands of physical qubits. However, it is not…
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…
Quantum algorithms for diverse problems, including search and optimization problems, require the implementation of a reflection operator over a target state. Commonly, such reflections are approximately implemented using phase estimation.…
Quantum computing promises polynomial and exponential speedups in many domains, such as unstructured search and prime number factoring. However, quantum programs yield probabilistic outputs from exponentially growing distributions and are…
We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous…
Accurate ground-state calculations on noisy quantum computers are fundamentally limited by restricted ansatz expressivity and unavoidable hardware errors. We introduce a hybrid-quantum classical framework that simultaneously addresses these…
Sampling noisy intermediate-scale quantum devices is a fundamental step that converts coherent quantum-circuit outputs to measurement data for running variational quantum algorithms that utilize gradient and Hessian methods in cost-function…