Related papers: Amplitude estimation without phase estimation
We present a method to model a discretized time evolution of probabilistic networks on gate-based quantum computers. We consider networks of nodes, where each node can be in one of two states: good or failed. In each time step,…
We provide a new efficient adaptive algorithm for performing phase estimation that does not require that the user infer the bits of the eigenphase in reverse order; rather it directly infers the phase and estimates the uncertainty in the…
Due to the great difficulty in scalability, quantum computers are limited in the number of qubits during the early stages of the quantum computing regime. In addition to the required qubits for storing the corresponding eigenvector, suppose…
Designing high-precision and efficient schemes is of crucial importance for quantum parameter estimation in practice. The estimation scheme based on continuous quantum measurement is one possible type of this, which looks also the most…
We propose an algorithm using a modified variant of amplitude amplification to solve combinatorial optimization problems via the use of a subdivided phase oracle. Instead of dividing input states into two groups and shifting the phase…
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 phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety of quantum applications such as the Shor's factoring algorithm, quantum sampling algorithms and the…
We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations, approximations of transformations and generalizations of…
Phase insensitive optical amplification of an unknown quantum state is known to be a fundamentally noisy operation that inevitably adds noise to the amplified state [1 - 5]. However, this fundamental noise penalty in amplification can be…
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…
Phase estimation is one of the most important facets of quantum metrology, with applications in sensing, microscopy, and quantum computation. When estimating a phase shift in a lossy medium, there is an upper bound on the attainable…
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…
Quantum parametric amplifiers typically generate by operating in proximity to a point of dynamical instability. We consider an alternate general strategy where quantum-limited, large-gain amplification is achieved without any proximity to a…
We present a method for mitigating measurement errors on quantum computing platforms that does not form the full assignment matrix, or its inverse, and works in a subspace defined by the noisy input bit-strings. This method accommodates…
The ability to efficiently infer system parameters is essential in any signal-processing task that requires fast operation. Dealing with quantum systems, a serious challenge arises due to substantial growth of the underlying Hilbert space…
Quantum amplitude amplification and estimation have shown quadratic speedups to unstructured search and estimation tasks. We show that a coherent combination of these quantum algorithms also provides a quadratic speedup to calculating the…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…
We give a technique to reduce the error probability of quantum algorithms that determine whether its input has a specified property of interest. The standard process of reducing this error is statistical processing of the results of…
We consider the use of arbitrary phases in quantum amplitude amplification which is a generalization of quantum searching. We prove that the phase condition in amplitude amplification is given by $\tan(\varphi/2) = \tan(\phi/2)(1-2a)$,…