Related papers: Iterative Quantum Amplitude Estimation
We present a simple formalism describing evolution of a qubit in the process of its measurement in a circuit QED setup. When a phase-sensitive amplifier is used, the evolution depends on only one output quadrature, and the formalism is the…
Quantum mechanics is well known to accelerate statistical sampling processes over classical techniques. In quantitative finance, statistical samplings arise broadly in many use cases. Here we focus on a particular one of such use cases,…
In recent years, quantum algorithms have been proposed which use quantum phase estimation (QPE) coherently as a subroutine without measurement. In order to do this effectively, the routine must be able to distinguish eigenstates with…
The quantum approximate optimization algorithm (QAOA) is a leading iterative variational quantum algorithm for heuristically solving combinatorial optimization problems. A large portion of the computational effort in QAOA is spent by the…
The quantum approximate optimization algorithm (QAOA) is a near-term quantum algorithm aimed at solving combinatorial optimization problems. Since its introduction, various generalizations have emerged, spanning modifications to the initial…
In this paper, we propose a quantum amplitude estimation method that uses a modified Grover operator and quadratically improves the estimation accuracy in the ideal case, as in the conventional one using the standard Grover operator. Under…
Solving eigenvalue problems is crucially important for both classical and quantum applications. Many well-known numerical eigensolvers have been developed, including the QR and the power methods for classical computers, as well as the…
Quantum phase estimation algorithm (PEA) is one of the most important algorithms in early studies of quantum computation. It is also a key for many other quantum algorithms, such as the quantum counting algorithm and the Shor's integer…
For quantum state preparation, a non-unitary operator is typically designed to decay undesirable states contained in an initial state using ancilla qubits and a probabilistic action. Probabilistic algorithms do not accelerate the…
In this paper, we show new algorithms, hardness results and applications for $\sf{S|LWE\rangle}$ and $\sf{C|LWE\rangle}$ with real Gaussian, Gaussian with linear or quadratic phase terms, and other related amplitudes. Let $n$ be the…
The Quantum Alternating Operator Ansatz (QAOA) represents a branch of quantum algorithms for solving combinatorial optimization problems. A specific variant, the Grover-Mixer Quantum Alternating Operator Ansatz (GM-QAOA), ensures uniform…
We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact…
Due to its significance as a subroutine, in this work, we consider the coherent version of the quantum phase estimation problem, where given an arbitrary input state and black-box access to unitaries $U$ and controlled-$U$, the goal is to…
Grover's algorithm is a well-known contribution to quantum computing. It searches one value within an unordered sequence faster than any classical algorithm. A fundamental part of this algorithm is the so-called oracle, a quantum circuit…
We present several refinements and extensions of the statistical quantum phase estimation (SQPE) framework to address some of its key practical limitations, improving its applicability to realistic cases. Recently, a family of statistical…
An important task in quantum generative machine learning is to model the probability distribution of measurements of many-body quantum systems. Classical generative models, such as generative adversarial networks (GANs) and variational…
Quantum computing offers transformative potential for simulating real-world materials, providing a powerful platform to investigate complex quantum systems across quantum chemistry and condensed matter physics. In this work, we leverage…
Over the past three decades significant reductions have been made to the cost of estimating ground-state energies of molecular Hamiltonians with quantum computers. However, comparatively little attention has been paid to estimating the…
This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…
Quantum imaginary-time evolution (QITE) is a promising tool to prepare thermal or ground states of Hamiltonians, as convergence is guaranteed when the evolved state overlaps with the ground state. However, its implementation using a a…