Extracting the outcome of a quantum computation is a difficult task. In many cases, the quantum phase estimation algorithm is used to digitally encode a value in a quantum register whose amplitudes' magnitudes reflect the discrete sinc function. In the standard implementation the value is approximated by the most frequent outcome, however, using the frequencies of other outcomes allows for increased precision without using additional qubits. One existing approach is to use Maximum Likelihood Estimation, which uses the frequencies of all measurement outcomes. We provide and analyze several alternative estimators, the best of which rely on only the two most frequent measurement outcomes. The Ratio-Based Estimator uses a closed form expression for the decimal part of the encoded value using the ratio of the two most frequent outcomes. The Coin Approximation Estimator relies on the fact that the decimal part of the encoded value is very well approximated by the parameter of the Bernoulli process represented by the magnitudes of the largest two amplitudes. We also provide additional properties of the discrete sinc state that could be used to design other estimators.
Extracting the outcome of a quantum computation is a difficult task. In many cases, the quantum phase estimation algorithm is used to digitally encode a value in a quantum register whose amplitudes' magnitudes reflect the discrete sinc function. In the standard implementation the value is approximated by the most frequent outcome, however, using the frequencies of other outcomes allows for increased precision without using additional qubits. One existing approach is to use Maximum Likelihood Estimation, which uses the frequencies of all measurement outcomes. We provide and analyze several alternative estimators, the best of which rely on only the two most frequent measurement outcomes. The Ratio-Based Estimator uses a closed form expression for the decimal part of the encoded value using the ratio of the two most frequent outcomes. The Coin Approximation Estimator relies on the fact that the decimal part of the encoded value is very well approximated by the parameter of the Bernoulli process represented by the magnitudes of the largest two amplitudes. We also provide additional properties of the discrete sinc state that could be used to design other estimators.
It is suggested that computers exploiting quantum phenomena can solve tasks with an efficiency surpassing that achievable by classical computers. One example of this quantum advantage arises in the task of phase estimation. Here, an unknown eigenvalue of a unitary evolution is estimated, a critical subroutine for many quantum algorithms and quantum metrology protocols. For a fixed amount of resources, the utilisation of quantum coherence and entanglement can lead to a quadratic increase in precision of the final estimate compared to classical statistical limits. In systems affected by depolarising noise, including current quantum hardware, this improvement becomes a constant factor. While numerous phase estimation algorithms have been proposed claiming to achieve these theoretical limits, the lack of well-defined criteria for both precision and resource utilisation casts doubt on these results. Further issues arise due to a lack of point identification (the existence of multiple equally likely estimates) that some algorithms have. I aim to address these issues in this thesis. I employ statistical inference, the theoretical foundation for interpreting any quantum measurement, in order to find rigorous definitions for precision and resource use. By combining these definitions with previous work in the field of quantum metrology, I am able to derive theoretical precision limits that one can hope to achieve. I then outline several phase estimation algorithms that can achieve these limits in different contexts. These algorithms that I describe are split into three major groups. Algorithms in the first group focus on the process of point identification; one set of measurements provides a precise estimate of the unknown phase before an additional set of measurements removes any ambiguities present. This second set of measurements can be either decided before any measurement is taken or during measurements in an iterative fashion. I show that the balancing of resources used in each set of measurements can lead to optimally scaling precision both with and without depolarising noise. These algorithms are based upon two of my peer-reviewed articles, [Phys. Rev. A 106, 062615 (2022)] and [Phys. Rev. A 109, 042412 (2024)]. The second group of algorithms that I introduce use the principles of Bayesian experimental design. Here, previous measurement outcomes are used to select future measurements recursively. These algorithms require large classical computing times to select each measurement but boast high precision in certain metrics. The final group of algorithms exploit the oscillating nature of phases by using a discrete Fourier transform (DFT). The DFT can be implemented using either classical or quantum hardware, the latter of which leads to the famous quantum phase estimation algorithm (QPEA). In this thesis, I show that the QPEA performs worse than some classical precision limits. However, I also suggest some modifications to the QPEA circuit that can lead to optimal precision scaling. These results and modifications are described in one of my articles awaiting publication [arXiv:2505.00764].
We propose and analyze a simple framework for estimating the amplitudes of a given n-qubit quantum state ∣ψ⟩=∑i=02n−1ai∣i⟩ in computational basis, utilizing a single-qubit measurement only. Previously, it was a common procedure that one could measure all qubits in order to collect measurement outcomes, from which one can estimate amplitudes of given quantum state. Here, we show that if restricting to single-qubit measurement, and one can perform measurement on arbitrary basis, then the measurement outcomes can be used to assist the finding of amplitudes in the usual computational, or Z basis. More concretely, such outcomes are capable of constructing a system of nonlinear algebraic equations, and by classically solving them, we obtain $\Tilde{a}_i$, which is the approximation to the corresponding amplitudes ai, including both real and imaginary component. We then discuss our framework from a broader perspective. First, we show that estimating all (norms of) amplitudes to additive accuracy δ, i.e., $| |\Tilde{a}_i - |a_i| | \leq δ$ for all i, O(4n/δ4) single-qubit measurements is sufficient. Second, we show that to achieve total variation $\sum_{i=0}^{2^n-1} | |\Tilde{a}_i|^2 - |a_i|^2| \leq δ$, O(6n/δ4) a single bit measurement is required. Finally, in order to achieve an average L1 norm error $ \sum_{i=0}^{2^n-1} | |\Tilde{a}_i| - |a_i| |/2^n \leq δ$, a single bit measurement O(2n/δ4) is needed.
Quantum computing is a promising emerging field in computational science, attracting significant international research interest. Data representation is crucial to the success of machine learning models, and covariance analysis to determine relationships between pairs of random variables is an essential step in exploratory data analysis. Here we introduce a novel quantum algorithm for covariance approximation and its circuit implementation for discrete-value vectors. The algorithm leverages vital components of quantum computing, including amplitude encoding, the Grover diffusion algorithm for amplitude amplification and the quantum Fourier transform. As a core innovation, we utilize two quantum states and their properties of superposition product states to estimate the covariance between input vectors. Evaluating the quantum algorithm’s performance over five discrete-value distributions, we found high levels of agreement between the classical and quantum computations, with maximum average errors averaging 0.153. Furthermore, the analysis revealed additional applications of the Grover diffusion operator to solve problems.
Quantum computing is the field that studies computation using quantum mechanical systems, exploiting properties such as superposition or entanglement. The focus of this project will be on quantum phase estimation algorithms. The formalism commonly used to represent quantum algorithms as quantum circuits composed by qubits and quantum gates will be presented. Then, we will be able to explain the quantum Fourier transform (that is exponentially faster than its classical analogue) and three quantum phase estimation algorithms: Kitaev’s phase estimation (KPEA), the phase estimation algorithm based on QFT (PEA) and the iterative quantum phase estimation algorithm based on a semiclassical Fourier transform (IPEA). We will use the Qiskit framework in order to run simulations of such algorithms, and even run them in real IBM Q Experience quantum computers (specifically, we will use the 5 qubit computer ibmq_essex). Statistical post-processing techniques will be essential in order to extract a phase estimation from the results obtained. We will use two post-processing techniques: the majority and the average rule. The performance of these methods applied to the results of several simulations and executions in ibmq_essex will be studied. At last, we will talk about the possible applications of phase estimation algorithms. Phase estimation is used as a subroutine in the field of quantum simulation, allowing us to obtain several magnitudes of a quantum system such as the energy levels. We will present an efficient quantum algorithm for factoring called Shor’s algorithm. The cost of factorization with a classical computer increases exponentially with the size of the input, so this is a example of a task that cannot be solved efficiently on a classical computer, but can be solved efficiently by a quantum computer. Phase estimation is also used in the field of quantum metrology. Specifically, an N-V center can be used to measure magnetic fields with high sensitivity and spatial resolution operating at room temperature thanks to a measuring protocol based on phase estimation.
In this paper we present a canonical quantum computing method to estimate the weighted sum w(k)f(k) of the values taken by a discrete function f and real weights w(k). The canonical aspect of the method comes from relying on a single linear function encoded in the amplitudes of a quantum state, and using register entangling to encode the function f. We further expand this framework by mapping function values to hashes in order to estimate weighted sums w(k)h(f(k)) of hashed function values with real hashes h. This generalization allows the computation of restricted weighted sums such as value at risk, comparators, as well as Lebesgue integrals and partial moments of statistical distributions. We also introduce essential building blocks such as efficient encodings of standardized linear quantum states and normal distributions.
Estimating quantum partition functions is a critical task in a variety of fields. However, the problem is classically intractable in general due to the exponential scaling of the Hamiltonian dimension N in the number of particles. This paper introduces a quantum algorithm for estimating the partition function Zβ of a generic Hamiltonian H up to multiplicative error based on a quantum coin toss. The coin is defined by the probability of applying the quantum imaginary-time evolution propagator fβ[H]=e−βH/2 at inverse temperature β to the maximally mixed state, realized by a block-encoding of fβ[H] into a unitary quantum circuit followed by a post-selection measurement. Our algorithm does not use costly subroutines such as quantum phase estimation or amplitude amplification; and the binary nature of the coin allows us to invoke tools from Bernoulli-process analysis to prove a runtime scaling as O(N/Zβ), quadratically better than previous general-purpose algorithms using similar quantum resources. Moreover, since the coin is defined by a single observable, the method lends itself well to quantum error mitigation. We test this in practice with a proof-of-concept 9-qubit experiment, where we successfully mitigate errors through a simple noise-extrapolation procedure. Our findings offer an interesting alternative for quantum partition function estimation relevant to early-fault quantum hardware.