Related papers: Approximate Sparse State Preparation with the Grov…
Quantum state preparation is an important subroutine in many quantum algorithms. The goal is to encode classical information directly to the quantum state so that it is possible to leverage quantum algorithms for data processing. However,…
Quantum state preparation is a crucial process within numerous quantum algorithms, and the need for efficient initialization of quantum registers is ever increasing as demand for useful quantum computing grows. The problem arises as the…
We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for…
The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
We provide explicit circuits implementing the Kitaev-Webb algorithm for the preparation of multi-dimensional Gaussian states on quantum computers. While asymptotically efficient due to its polynomial scaling, we find that the circuits…
Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work we develop an…
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…
We generalize Grover algorithm with two arbitrary phases in a density matrix set up. We give exact analytic expressions for the success probability after arbitrary number of iteration of the generalized Grover operator as a function of…
The efficient preparation of quantum states is an important step in the execution of many quantum algorithms. In the noisy intermediate-scale quantum (NISQ) computing era, this is a significant challenge given quantum resources are scarce…
The compiling of quantum gates is crucial for the successful quantum algorithm implementations. The environmental noise as well as the bandwidth of control pulses pose a challenge to precise and fast qubit control, especially in a weakly…
Quantum state preparation is an important ingredient for other higher-level quantum algorithms, such as Hamiltonian simulation, or for loading distributions into a quantum device to be used e.g. in the context of optimization tasks such as…
Quantum error correction is an essential component for practical quantum computing on noisy quantum hardware. However, logical operations on error-corrected qubits require a significant resource overhead, especially for high-precision and…
The preparation of pseudo-pure states plays a central role in the implementation of quantum information processing in high temperature ensemble systems, such as nuclear magnetic resonance. Here we describe a simple approach based on…
Numerous quantum algorithms operate under the assumption that classical data has already been converted into quantum states, a process termed Quantum State Preparation (QSP). However, achieving precise QSP requires a circuit depth that…
By designing a proper unitary operator U, we synthesize NMR analogues of Einstein-Podolsky-Rosen states (pseudo-EPR states) using generalized Grover's algorithm on a nuclear magnetic resonance (NMR) quantum computer. Experiments also…
State preparation is a necessary component of many quantum algorithms. In this work, we combine a method for efficiently representing smooth differentiable probability distributions using matrix product states with recently discovered…
Finding ways to transform a quantum state to another is fundamental to quantum information processing. In this paper, we apply the sparse matrix approach to the quantum state transformation problem. In particular, we present a new approach…
We describe a simple quantum algorithm for preparing $K$ copies of an $N$-dimensional quantum state whose amplitudes are given by a quantum oracle. Our result extends a previous work of Grover, who showed how to prepare one copy in time…
Grover's Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorithms and patterns for extracting information encoded in…