Related papers: Efficient state initialization by a quantum spectr…
In this paper, we present an algorithm for preparing quantum states of the form $\sum_{i=0}^{n-1} \alpha_i |i\rangle$, where the coefficients $\alpha_i$ are specified by a quantum oracle. Our method achieves this task twice as fast as the…
Quantum state preparation is a central primitive in many quantum algorithms, yet it is generally resource intensive, with efficient constructions known only for structured families of states. This work introduces a method for preparing…
In this paper we present a search algorithm that finds useful optical quantum states which can be created with current technology. We apply the algorithm to the field of quantum metrology with the goal of finding states that can measure a…
It is commonly assumed that Shor's quantum algorithm for the efficient factorization of a large number $N$ requires a pure initial state. Here we demonstrate that a single pure qubit together with a collection of $log_2 N$ qubits in an…
We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations. The first technique realizes that to prepare the ground…
There are fundamental limits to the accuracy with which one can determine the state of a quantum system. I give an overview of the main approaches to quantum state discrimination. Several strategies exist. In quantum hypothesis testing, a…
The problem of quantum state filtering consists of determining whether an unknown quantum state, which is chosen from a known set of states, is either a particular, specified state, or not. We consider this problem for the case that the…
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on…
In this paper, we present a general numerical framework for both deterministic and probabilistic quantum state transformations, under locality constraints. For a given arbitrary bipartite initial state and a desired bipartite target state,…
Error filtration is a method for encoding the quantum state of a single particle into a higher dimensional Hilbert space in such a way that it becomes less sensitive to phase noise. We experimentally demonstrate this method by distributing…
We present a quantum algorithm that provides a general approach for obtaining the energy spectrum of a physical system without making a guess on its eigenstates. In this algorithm, a probe qubit is coupled to a quantum register $R$ which…
It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation,…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
Quantum signal processing (QSP) provides a systematic framework for implementing a polynomial transformation of a linear operator, and unifies nearly all known quantum algorithms. In parallel, recent works have developed randomized…
As the field of quantum computing grows, novel algorithms which take advantage of quantum phenomena need to be developed. As we are currently in the NISQ (noisy intermediate scale quantum) era, quantum algorithm researchers cannot reliably…
While the preparation of a general quantum state is challenging, realistic problem instances, such as those encountered in quantum chemistry and quantum machine learning-typically exhibit hierarchical amplitude structures, consisting of a…
Efficiently uploading data into quantum states is essential for many quantum algorithms to achieve advantage across various applications. In this paper, we address this challenge by developing a method to upload a polynomial function $f(x)$…
We present a quantum information-inspired ansatz for the variational quantum eigensolver (VQE) and demonstrate its efficacy in calculating ground-state energies of atomic systems. Instead of adopting a heuristic approach, we start with an…
Significant effort in applied quantum computing has been devoted to the problem of ground state energy estimation for molecules and materials. Yet, for many applications of practical value, additional properties of the ground state must be…
The performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectation value, and a ratio closely related to the approximation…