Related papers: Efficient state initialization by a quantum spectr…
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…
While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum…
We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register. The algorithm recovers the initial state of an ancillary register regardless of whether its state is…
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…
The problem of initializing phase in a quantum computing system is considered. The initialization of phases is a problem when the system is initially present in an entangled state and also in the application of the quantum gate…
Preparation of a quantum register is an important step in quantum computation and quantum information processing. It is straightforward to build a simple quantum state such as $|i_1 i_2 ... i_n\ket$ with $i_j$ being either 0 or 1, but is a…
A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of…
Quantum algorithms for ground-state energy estimation of chemical systems require a high-quality initial state. However, initial state preparation is commonly either neglected entirely, or assumed to be solved by a simple product state like…
To date, quantum computational algorithms have operated on a superposition of all basis states of a quantum system. Typically, this is because it is assumed that some function f is known and implementable as a unitary evolution. However,…
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
Filtering is an important technique in quantum computing used for isolating or enhancing some specific states of quantum many-body systems. In this paper, we analyze the performance of filters based on the quantum phase estimation (QPE)…
We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function. Unlike existing approaches, our method does not require handcrafted reversible arithmetic circuits, or quantum table reads, to…
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…
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…
The determination of the ground state of quantum many-body systems via digital quantum computers rests upon the initialization of a sufficiently educated guess. This requirement becomes more stringent the greater the system. Preparing…
We present an efficient method to prepare states of a many-body system on quantum hardware, first isolating individual quantum numbers and then using time evolution to isolate the energy. Our method in its simplest form requires only one…
Quantum phase estimation is one of the critical building blocks of quantum computing. For early fault-tolerant quantum devices, it is desirable for a quantum phase estimation algorithm to (1) use a minimal number of ancilla qubits, (2)…
High-fidelity qubit initialization is of significance for efficient error correction in fault tolerant quantum algorithms. Combining two best worlds, speed and robustness, to achieve high-fidelity state preparation and manipulation is…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…